Artificial Intelligence
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints
Journal of Automated Reasoning
Default logic generalized and simplified
Annals of Mathematics and Artificial Intelligence
Realizing Default Logic over Description Logic Knowledge Bases
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Discovering classes of strongly equivalent logic programs
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Conflict-driven answer set solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Annals of Mathematics and Artificial Intelligence
Well-Supported semantics for logic programs with generalized rules
Correct Reasoning
Hi-index | 0.00 |
In this paper, we show that Reiter's default logic in the propositional case can be translated into answer set programming by identifying the internal relationships among formulas in a default theory. Based on this idea, we implement a new default logic solver - dl2asp. We report some experimental results, in particular the application of dl2asp for solving the fair division problem in social choice theory.