On tight logic programs and yet another translation from normal logic programs to propositional logic

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 853-858

  Lin, Fangzhen ^a   Zhao, Jicheng ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK DOMAINS; HAMILTONIAN CIRCUITS; LOGIC PROGRAMS; POLYNOMIAL TRANSFORMATIONS; PROGRAM COMPLETION; PROPOSITIONAL LOGIC; STABLE MODEL; STABLE MODEL SEMANTICS;

ARTIFICIAL INTELLIGENCE; ENCODING (SYMBOLS); FORMAL LOGIC; LOGIC PROGRAMMING; SEMANTICS;

PROGRAM TRANSLATORS;

EID: 84880829367     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. K. R. Apt, H. A. Blair, and A. Walker. In Jack Minker, editor, Foundations of deductive databases and logic programming, pages 89-148.
2. Y. Babovich, E. Erdem, and V. Lifschitz. Fages' theorem and answer set programming. In NMR-2000, 2000.
3. R. Ben-Eliyahu and R. Dechter. Propositional semantics for disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, 12:53-87, 1996.
4. K. L. Clark. In H Gallaire and J. Minker, editors, Logics and Databases, pages 293-322.
5. F. Fages. Consistency of dark\s completion and existence of stable models. In Journal of Methods of Logic in Computer Science, volume 1, pages 51-60, 1994.
6. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In ICLP'88, August 1988.
7. G.-S. Huang, X. Jia, C.-J. Liau, and J.-H. You. Two-literal logic programs and satisfiability representation of stable models: A comparison. In Proc. 15th Canadian Conference on AI, LNCS, Springer, 2002.
8. V. Lifschitz. Foundations of logic progrmming. In Priciples of Knowledge Representation, 1996.
9. F. Lin and Y. Zhao. ASSAT: Computing answer sets of a logic program by sat solvers. In AA4/'02,2002.
10. I. Niemela. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3-4):241-273,1999.
11. R Simons. Smodels: a system for computing the stable models of logic programs, version 2.27, 2003.