A generalization of the Lin-Zhao theorem

Annals of Mathematics and Artificial Intelligence

Volumn 47, Issue 1-2, 2006, Pages 79-101

  Ferraris, Paolo ^a   Lee, Joohyung ^b   Lifschitz, Vladimir ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b ARIZONA STATE UNIVERSITY   (United States)

Author keywords

Answer set programming; Clark's completion; Logic programming; Loop formulas; Nonmonotonic reasoning; Stable models

Indexed keywords

EID: 33750972879     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10472-006-9025-2     Document Type: Article

References (23)

1. Clark, K.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293-322. Plenum, New York (1978)
2. Erdem, E., Lifschitz, V.: Tight logic programs. Theory and Pract. Log. Prog. 3, 499-518 (2003)
3. Fages, F.: Consistency of Clark's completion and existence of stable models. J. Meth. Log. Comput. Sci. 1, 51-60 (1994)
4. Ferraris, P., Lifschitz, V.: Mathematical foundations of answer set programming. In: We Will Show Them! Essays in Honour of Dov Gabbay, vol. 1, pp. 615-664. King's College, London (2005)
5. Ferraris, P.: Answer sets for propositional theories. In: Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), Cosenza, Italy, 119-131, (2005)
6. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Proceedings of International Logic Programming Conference and Symposium, MIT, Cambridge, Massachusetts, 1070-1080 (1988)
7. Gelfond, M., Lifschitz, V.: Logic programs with classical negation. In: Warren D., Szeredi P. (eds.) Proceedings of International Conference on Logic Programming (ICLP), Jerusalem, Israel, 579-597, June (1990)
8. Lee, J., Lifschitz, V.: Loop formulas for disjunctive logic programs. In: Proceedings of International Conference on Logic Programming (ICLP), Mumbai, India, 451-465, December (2003)
9. Lee, J.: A model-theoretic counterpart of loop formulas. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), Edinburgh, Scotland, 503-508 (2005)
10. Leone, N., Rullo, P., Scarcello, F.: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. Inf. Comput. 135(2), 69-112 (1997)
11. Lierler, Y.: Cmodels: SAT-based disjunctive answer set solver. In: Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), Diamante, Italy, 447-452 (2005)
12. Lifschitz, V., Razborov, A.: Why are there so many loop formulas? ACM Trans. Comput. Log. 7(2), 261-268 (2006)
13. Lifschitz, V., Tang, L.R., Turner, H.: Nested expressions in logic programs. Ann. Math. Artif. Intell. 25, 369-389 (1999)
14. Lifschitz, V.: Circumscription. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A., (eds.) The Handbook of Logic in AI and Logic Programming, vol.3 pp. 298-352. Oxford University Press, UK (1994)
15. Lin, F., Zhao, Y.: ASSAT: Computing answer sets of a logic program by SAT solvers. Artif. Intell. 157, 115-137 (2004)
16. McCarthy J.: Circumscription - a form of non-monotonic reasoning. Artif. Intell. 13, 27-39, 171-172 (1980)
17. McCarthy J. Applications of circumscription to formalizing common sense knowledge. Artif. Intell. 26(3), 89-116 (1986)
18. McCarthy J.: Formalizing Common Sense: Papers by John McCarthy. Ablex, Norwood, New Jersey (1990)
19. Pearce, D., Tompits, H., Woltran, S.: Encodings for equilibrium logic and logic programs with nested expressions. In: Proceedings of Portuguese Conference on Artificial Intelligence (EPIA), Porto, Portugal, 306-320 (2001)
20. Pearce, D.: A new logical characterization of stable models and answer sets. In: Dix, J., Pereira L., Przymusinski, T. (eds.) Non-Monotonic Extensions of Logic Programming (Lecture Notes in Artificial Intelligence 1216), pp. 57-70. Springer, Berlin Heidelberg New York (1997)
21. Saccá, D., Zaniolo, C.: Stable models and non-determinism in logic programs with negation. In: Proceedings of ACM Symposium on Principles of Database Systems (PODS), Nashville, Tennesse 205-217 (1990)
22. Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory. Cambridge University Press, UK (1996)
23. Van Gelder, A., Ross K., Schlipf J.: The well-founded semantics for general logic programs. J. ACM 38(3), 620-650 (1991)