ASSAT: Computing answer sets of a logic program by SAT solvers

Artificial Intelligence

Volumn 157, Issue 1-2, 2004, Pages 115-137

  Lin, Fangzhen ^a   Zhao, Yuting ^a  

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

Author keywords

Answer set programming; Answer set semantics; Logic programming; SAT; SAT solvers; Stable model semantics

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING; HAMILTONIANS; MATHEMATICAL MODELS; SEMANTICS; SET THEORY;

ANSWER SET PROGRAMMING; ANSWER SET SEMANTICS; SAT; SAT SOLVERS; STABLE MODEL SEMANTICS;

LOGIC PROGRAMMING;

EID: 2942667864     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2004.04.004     Document Type: Article

References (25)

1. Apt K.R., Blair H.A., Walker A. Towards a theory of declarative knowledge. Minker J. Foundations of Deductive Databases and Logic Programming. 1988;293-322 Morgan Kaufmann, Los Altos, CA.
2. Babovich Y., Erdem E., Lifschitz V. Fages' theorem and answer set programming. Proc. of NMR-2000, Breckenridge, CO. 2000.
3. Ben-Eliyahu R., Dechter R. Propositional semantics for disjunctive logic programs. Ann. Math. Artificial Intelligence. 12:1996;53-87.
4. Cheeseman P., Kanefsky B., Taylor W.M. Where the really hard problems are. Proc. IJCAI-91, Sydney, Australia. 1991;331-337.
5. Clark K.L. Negation as failure. Gallaire H., Minker J. Logics and Databases. 1978;293-322 Plenum Press, New York.
6. Fages F. Consistency of Clark's completion and existence of stable of stable models. J. Methods Logic Comput. Sci. 1:1994;51-60.
7. Gelfond M., Lifschitz V. The stable model semantics for logic programming. Proc. Fifth International Conference and Symposium on Logic Programming, Seattle, WA. 1988;1070-1080.
8. Huang G.-S., Jia X., Liau C.-J., You J.-H. Two-literal logic programs and satisfiability representation of stable models: a comparison. Proc. 15th Canadian Conference on AI, Calgary, AB. Lecture Notes in Comput. Sci. vol. 2338:2002;119-131 Springer, Berlin.
9. Lee J. Nondefinite vs. definite causal theories. Proc. 7th Internat. Conference on Logic Programming and Nonmonotonic Reasoning, Fort Lauderdale, FL. Lecture Notes in Comput. Sci. vol. 2923:2004;141-153 Springer, Berlin.
10. Lee J., Lifschitz V. Loop formulas for disjunctive logic programs. Proceedings of ICLP-2003, Mumbai, India. Lecture Notes in Comput. Sci. vol. 2916:2003;451-465 Springer, Berlin.
11. Lee J., Lin F. Loop formulas for circumscription. Proc. AAAI-2004, San Jose, CA. 2004;AAAI Press, Menlo Park, CA. in press.
12. Leone N., , et al. DLV: a disjunctive datalog system. release 2001-6-11. At http://www.dbai.tuwien.ac.at/proj/dlv/:2001;
13. Li C.M., Anbulagan. Heuristics based on unit propagation for satisfiability problems. Proc. IJCAI-97, Nagoya, Japan. 1997;366-371.
14. Lierler Y., Maratea M. Cmodels-2: SAT-based answer set solver enhanced to non-tight programs. Proc. of LPNMR-2004, Fort Lauderdale, FL. Lecture Notes in Comput. Sci. vol. 2923:2004;346-350 Springer, Berlin.
15. Lin F., Zhao Y. ASSAT: Computing answer sets of a logic program by sat solvers. Proc. AAAI-2002, Edmonton, AB. 2002;112-118 AAAI Press, Menlo Park, CA.
16. McCain N., Turner H. Causal theories of action and change. Proc. AAAI-97, Providence, RI. 1997;460-465 AAAI Press, Menlo Park, CA.
17. Moskewicz M., Madigan C., Zhao Y., Zhang L., Malik S. Chaff: engineering an efficient SAT solver. Proc. 39th Design Automation Conference, Las Vegas, NV. 2001;530-535.
18. Niemelä I. Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. Artificial Intelligence. 25:(3-4):1999;241-273.
19. Selman B., Kautz H.A., Cohen B. Noise strategies for improving local search. Proc. AAAI-94, Seattle, WA. 1994;337-343 AAAI Press, Menlo Park, CA.
20. Silva J.P.M., Sakallah K.A. GRASP - A new search algorithm for satisfiability. Proceedings of the International Conference on Computer-Aided Design (ICCAD'96), San Jose, CA. 1996;220-227.
21. Simons P. Smodels: A system for computing the stable models of logic programs. version 2.25. At http://www.tcs.hut.fi/Software/smodels/:2000;
22. Tarjan R. Depth-first search and linear graph algorithms. SIAM J. Comput. 1:1972;146-160.
23. B. Vandegriend, Finding Hamiltonian Cycles: algorithms, graphs and performance, MSc Thesis, Department of Computer Science, University of Alberta, 1998.
24. You J., Cartwright R., Li M. Iterative belief revision in extended logic programs. Theoret. Comput. Sci. 170:1996.
25. Zhang H., Stickel M.E. Implementing the Davis-Putnam method. J. Automat. Reasoning. 24:(1/2):2000;277-296.