Defeasible logic programming: language definition, operational semantics, and parallelism

Authors

  • Alejandro Javier García Department of Computer Science, Universidad Nacional del Sur, Bahía Blanca, Argentia

Abstract

This thesis defines Defeasible Logic Programming and provides a concrete specification of this new language through its operational semantics. Defeasible Logic Programming, or DeLP for short, has been defined based on the Logic Programming paradigm and considering features of recent developments in the area of Defeasible Argumentation. DeLP relates and improves many aspects of the areas of Logic Programming, Defeasible Argumentation, Intelligent Agents, and Parallel Logic Programming

Downloads

Download data is not yet available.

Downloads

Published

2001-10-01

Issue

Vol. 1 No. 05 (2001): Fifth Issue

Section

Thesis Overview

License

 

Copyright and Licensing

Articles accepted for publication will be licensed under the Creative Commons BY-NC-SA. Authors must sign a non-exclusive distribution agreement after article acceptance.

How to Cite

[1]
“Defeasible logic programming: language definition, operational semantics, and parallelism”, JCS&T, vol. 1, no. 05, p. 3 p., Oct. 2001, Accessed: Dec. 11, 2025. [Online]. Available: https://journal.info.unlp.edu.ar/JCST/article/view/989