Stable models and difference logic

Annals of Mathematics and Artificial Intelligence

Volumn 53, Issue 1-4, 2008, Pages 313-329

  Niemelä, Ilkka ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Difference logic; Logic programs; Semantics; Stable model

Indexed keywords

EID: 67349283788     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10472-009-9118-9     Document Type: Article

References (28)

1. Apt, K.R., Blair, H.A., Walker, A.: Towards a theory of declarative knowledge. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 89-148. Morgan Kaufmann, Los Altos (1988)
2. Baselice, S., Bonatti, P.A., Gelfond, M.: Towards an integration of answer set and constraint solving. In: Logic Programming, 21st International Conference, ICLP 2005, Sitges, Spain, 2-5 October 2005, Proceedings, pp. 52-66 (2005)
3. R. Ben-Eliyahu R. Dechter 1994 Propositional semantics for disjunctive logic programs Ann. Math. Artif. Intell. 12 1-2 53 87
4. M. Bozzano R. Bruttomesso A. Cimatti T.A. Junttila P. van Rossum S. Schulz R. Sebastiani 2005 Mathsat: tight integration of SAT and mathematical decision procedures J. Autom. Reason. 35 1-3 265 293 (Pubitemid 44619287)
5. Buccafurri, F., Leone, N., Rullo, P.: Strong and weak constraints in disjunctive datalog. In: Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning, pp. 2-17. Springer, New York (1997) (Pubitemid 127100724)
6. Clark, K.L.: Negation as failure. In: Gallaire, H., Minker, J. (eds.), Logic and Data Bases, pp. 293-322. Plenum, New York (1978)
7. E. Clarke A. Biere R. Raimi Y. Zhu 2001 Bounded model checking using satisfiability solving Formal Methods Syst. Des. 19 1 7 34 July
8. Cotton, S., Maler, O.: Fast and flexible difference constraint propagation for DPLL(T). In: Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, 12-15 August 2006, Proceedings, pp. 170-183 (2006)
9. T. Eiter G. Gottlob H. Mannila 1997 Disjunctive datalog ACM Trans. Database Syst. 22 3 364 418 (Pubitemid 127483103)
10. C. Elkan 1990 A rational reconstruction of nonmonotonic truth maintenance systems Artif. Intell. 43 219 234 (Pubitemid 20697328)
11. E. Erdem V. Lifschitz 2003 Tight logic programs Theory and Practice of Logic Programming 3 4-5 499 518
12. F. Fages 1994 Consistency of Clark's completion and existence of stable models J. Methods Logic Comput. Sci. 1 51 60
13. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the 5th International Conference on Logic Programming, pp. 1070-1080. MIT, Seattle, USA (1988), August
14. Janhunen, T.: Representing normal programs with clauses. In: Proceedings of the 16th European Conference on Artificial Intelligence, pp. 358-362. IOS, Amsterdam (2004)
15. T. Janhunen 2006 Some (in)translatability results for normal logic programs and propositional theories J. Appl. Non-Classical Logics 16 1-2 35 86
16. Kautz, H., Selman, B.: Planning as satisfiability. In: Proceedings of the 10th European Conference on Artificial Intelligence, pp. 359-363 (1992)
17. Kautz, H., Selman, B.: Pushing the envelope: planning, propositional logic, and stochastic search. In: Proceedings of the 13th National Conference on Artificial Intelligence, pp. 1194-1201 (1996)
18. Lierler, Y., Maratea, M.: Cmodels-2: SAT-based answer set solver enhanced to non-tight programs. In: Logic Programming and Nonmonotonic Reasoning, 7th International Conference, LPNMR 2004, Fort Lauderdale, FL, USA, 6-8 January 2004, Proceedings, pp. 346-350 (2004)
19. Lifschitz, V.: Answer set planning. In: Proceedings of the 16th International Conference on Logic Programming, pp. 25-37. Las Cruces, New Mexico. MIT, Massachusetts (1999), December
20. V. Lifschitz A.A. Razborov 2006 Why are there so many loop formulas? ACM Trans. Comput. Logic 7 2 261 268 (Pubitemid 43909223)
21. Lin, F., Zhao, J.: On tight logic programs and yet another translation from normal logic programs to propositional logic. In: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, pp. 853-858 (2003)
22. Lin, F., Zhao, Y.: ASSAT: Computing answer sets of a logic program by SAT solvers. In: Proceedings of the 18th National Conference on Artificial Intelligence, pp. 112-117. Edmonton, Alberta, Canada. AAAI, Massachusetts (2002), July/August
23. V.W. Marek V.S. Subrahmanian 1992 The relationship between stable, supported, default and autoepistemic semantics for general logic programs Theor. Comp. Sci. 103 365 386
24. Marek, W., Truszczyński, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: a 25-Year Perspective, pp. 375-398. Springer, New York (1999)
25. Mellarkod, V.S., Gelfond, M.: Enhancing ASP systems for planning with temporal constraints. In: Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning, pp. 309-314 (2007)
26. I. Niemelä 1999 Logic programs with stable model semantics as a constraint programming paradigm Ann. Math. Artif. Intell. 25 3,4 241 273
27. Nieuwenhuis, R., Oliveras, A.: DPLL(T) with exhaustive theory propagation and its application to difference logic. In: Computer Aided Verification, 17th International Conference, CAV 2005, Edinburgh, Scotland, UK, 6-10 July 2005, Proceedings, pp. 321-334 (2005)
28. R. Nieuwenhuis A. Oliveras C. Tinelli 2006 Solving SAT and SAT Modulo Theories: from an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T) J. ACM 53 6 937 977 (Pubitemid 46276962)