Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
HILOG: a foundation for higher-order logic programming
Journal of Logic Programming
Logical foundations of object-oriented and frame-based languages
Journal of the ACM (JACM)
Reducing disjunctive to non-disjunctive semantics by shift-operations
Fundamenta Informaticae - Special issue: to the memory of Prof. Helena Rasiowa
Reasoning with Prioritized Defaults
LPKR '97 Selected papers from the Third International Workshop on Logic Programming and Knowledge Representation
Intellectics and Computational Logic (to Wolfgang Bibel on the occasion of his 60th birthday)
Alternating Fixpoint Theory for Logic Programs with Priority
CL '00 Proceedings of the First International Conference on Computational Logic
Computing preferred answer sets by meta-interpretation in Answer Set Programming
Theory and Practice of Logic Programming
A framework for compiling preferences in logic programs
Theory and Practice of Logic Programming
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Embedding defeasible logic into logic programming
Theory and Practice of Logic Programming
Logic Programming with Defaults and Argumentation Theories
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
An extension to conformant planning using logic programming
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A polynomial reduction from ASPDA to ASP
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
| Hi-index | 0.00 |
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made the field hard to navigate and the different techniques hard to compare. Our earlier work on Logic Programming with Defaults and Argumentation Theories (LPDA) introduced a degree of unification into the approaches that rely on the well-founded semantics. The present work takes this idea further and introduces ASPDA--a unifying framework for defeasibility of disjunctive logic programs under the Answer Set Programming (ASP). Since the well-founded and the answer set semantics underlie almost all existing approaches to defeasible reasoning in Logic Programming, LPDA and ASPDA together capture most of those approaches. In addition to ASPDA, we obtained a number of interesting and non-trivial results. First, we show that ASPDA is reducible to ordinary ASP programs, albeit at the cost of exponential blowup in the number of rules. Second, we study reducibility of ASPDA to the non-disjunctive case and show that head-cycle-free ASPDA programs reduce to the non-disjunctive case-- similarly to head-cycle-free ASP programs, but through a more complex transformation. The blowup in the program size is linear in this case.