A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Based on this idea, we implement a new default logic solver -dl2asp. ... 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. ... The first author is partially supported by Natural Science Foundation of China under dl2asp: Implementing Default Logic via Answer Set Programming ...doi:10.1007/978-3-642-15675-5_11 fatcat:5ilhtzhw3bhnha4e2joaobvfly
To date, it has been used to embed in it default logic (propositional case), autoepistemic logic, Turner's logic of universal causation, and general logic programming under stable model semantics. ... In this paper, for the first time, we show how the logic of GK can be embedded into disjunctive logic programming in a polynomial but non-modular translation with new variables. ... For a logic program P without not, the answer set of P is any minimal consistent subset S of Lit that satisfies P . We use Γ P (S) to denote the set of answer sets of P S . ...arXiv:1405.0809v1 fatcat:3s4z6qh4mbggrl3wyvvzjxr2r4