Two-literal logic programs and satisfiability representation of stable models: A comparison

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2338, Issue , 2002, Pages 119-131

  Huang, Guan Shieng ^a   Jia, Xiumei ^b   Liau, Churn Jung ^c   You, Jia Huai ^b  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b UNIVERSITY OF ALBERTA   (Canada)

^c INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT SATISFACTION PROBLEMS; CONSTRAINT THEORY; FORMAL LOGIC; GRAPH THEORY; LOGIC PROGRAMMING; POLYNOMIAL APPROXIMATION; SEMANTICS;

COMBINATORIAL PROBLEM; CONSTRAINT PROGRAMMING; CONSTRAINT SATISFACTION; EXTRA VARIABLES; GRAPH-THEORETIC; LOGIC PROGRAMS; POLYNOMIAL-TIME; STABLE MODEL SEMANTICS;

COMPUTER CIRCUITS;

EID: 84974705227     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47922-8_11     Document Type: Conference Paper

References (18)

1. Y. Babovich, E. Erdem, and V. Lifschitz. Fage’s theorem and answer set programming. In Proc. Int’l Workshop on Non-Monotonic Reasoning, 2000. 120, 127, 130
2. R. Ben-Eliyahu and R. Dechter. Propositional semantics for disjunctive logic programs. Annals of Math. and Artificial Intelligence, 14:53-87, 1994. 120
3. K. L. Clark. Negation as failure. Logics and Databases, pages 293-322, 1978. 124
4. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5(7):394-397, July 1962. 120
5. P. Dung. A fixpoint approacht o declarative semantics of logic programs. In Proc. North American Conf. on Logic Programming, pages 604-625, 1989. 124
6. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. 5th ICLP, pages 1070-1080. MIT Press, 1988. 119, 121
7. T. Janhunen, I. Niemelä, P. Simons, and J. You. Unfolding partiality and disjunctions in stable model semantics. In Proc. KR 2000, pages 411-424. Morgan Kaufmann, April 2000. 120
8. N. Leone et al. DLV: a disjunctive datalog system, release 2000-10-15. At http://www.dbai.tuwien.ac.at/proj/dlv/, 2000. 120
9. V. Lifschitz. Answer set programming. In K. R. Apt et al., editor, The Logic Programming Paradigm: A 25-Year Perspective, pages 357-371. Springer, 1999. 120
10. V. Marek and M. Truszczyński. Stable models and an alternative logic programming paradigm. In K. R. Apt et al., editor, The Logic Programming Paradigm: A 25-Year Perspective, pages 375-398. Springer, 1999. 124
11. M. Moskecicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Enginerring an efficient sat solver. In Proc. 38th ACM Design Automation Conference, pages 530-535, June 2000. 120
12. I. Niemelä. Logic programs withst able model semantics as a constraint programming paradigm. Annals of Math. and Artificial Intelligence, 25(3-4):241-273, 1999. 120, 122, 124, 127
13. I. Niemelä and P. Simons. Extending the Smodels system with cardinality and weight constraints, pages 491-521. Kluwer Academic Publishers, 2000. 120
14. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994. 120
15. P. Simons. Extending and Implementing the Stable Model Semantics. Ph D thesis, Helsinki University of Technology, Helsinki, Finland, 2000. 120
16. M. Truszczyński. Computing large and small stable models. In Proc. ICLP, pages 169-183. MIT Press, 1999. 120
17. J. You, R. Cartwright, and M. Li. Iterative belief revision in extended logic programs. Theoretical Computer Science, 170:383-406, 1996. 122
18. H. Zhang. Sato: an efficient propositional prover. In Proc. CADE, pages 272-275, 1997. 120