Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Logic programs with classical negation
Logic programming
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
A mathematical treatment of defeasible reasoning and its implementation
Artificial Intelligence
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Unfounded sets and well-founded semantics for general logic programs
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
ACM Computing Surveys (CSUR)
Characterizations of the Disjunctive Well-Founded Semantics: Confluent Calculi and Iterated GCWA
Journal of Automated Reasoning
Knowledge Representation with Logic Programs
LPKR '97 Selected papers from the Third International Workshop on Logic Programming and Knowledge Representation
Prolegomena to Logic Programming for Non-monotonic Reasoning
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
Nonmonotonic reasoning: towards efficient calculi and implementations
Handbook of automated reasoning
Transformation-based bottom-up computation of the well-founded model
Theory and Practice of Logic Programming
Defeasible logic programming: an argumentative approach
Theory and Practice of Logic Programming
A logic programming framework for possibilistic argumentation with vague knowledge
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Theory and Practice of Logic Programming
Comparisons and computation of well-founded semantics for disjunctive logic programs
ACM Transactions on Computational Logic (TOCL)
Argumentation and the Dynamics of Warranted Beliefs in Changing Environments
Autonomous Agents and Multi-Agent Systems
Argument-based critics and recommenders: a qualitative perspective on user support systems
Data & Knowledge Engineering - Special issue: WIDM 2004
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Autonomous Agents and Multi-Agent Systems
An alternative foundation for DeLP: defeating relations and truth values
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
The foundations of DeLP: defeating relations, games and truth values
Annals of Mathematics and Artificial Intelligence
Negotiation among DDeLP agents
ArgMAS'04 Proceedings of the First international conference on Argumentation in Multi-Agent Systems
Argumentation-Supported information distribution in a multiagent system for knowledge management
ArgMAS'05 Proceedings of the Second international conference on Argumentation in Multi-Agent Systems
t-DeLP: an argumentation-based Temporal Defeasible Logic Programming framework
Annals of Mathematics and Artificial Intelligence
Hi-index | 5.23 |
This paper relates the Defeasible Logic Programming (DeLP) framework and its semantics SEMDeLP to classical logic programming frameworks. In DeLP, we distinguish between two different sorts of rules: strict and defeasible rules. Negative literals (∼A) in these rules are considered to represent classical negation. In contrast to this, in normal logic programming (NLP), there is only one kind of rules, but the meaning of negative literals (not A) is different: they represent a kind of negation as failure, and thereby introduce defeasibility. Various semantics have been defined for NLP, notably the well-founded semantics (WFS) (van Gelder et al., Proceedings of the Seventh Symposium on Principles of Database Systems, 1988, pp. 221-230; J. ACM 38 (3) (1991) 620) and the stable semantics Stable (Gelfond and Lifschitz, Fifth Conference on Logic Programming, MIT Press, Cambridge, MA, 1988, pp. 1070-1080; Proceedings of the Seventh International Conference on Logical Programming, Jerusalem, MIT Press, Cambridge, MA, 1991, pp. 579-597).In this paper we consider the transformation properties for NLP introduced by Brass and Dix (J. Logic Programming 38(3) (1999) 167) and suitably adjusted for the DeLP framework. We show which transformation properties are satisfied, thereby identifying aspects in which NLP and DeLP differ. We contend that the transformation rules presented in this paper can help to gain a better understanding of the relationship of DeLP semantics with respect to more traditional logic programming approaches. As a byproduct, we obtain the result that DeLP is a proper extension of NLP.