Computing stable models via reductions to difference logic

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

Volumn 5753 LNAI, Issue , 2009, Pages 142-154

  Janhunen, Tomi ^a   Niemelä, Ilkka ^a   Sevalnev, Mark ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL PLATFORMS; LINEAR TRANSLATION; LOGIC PROGRAMS; PROPOSITIONAL SATISFIABILITY; SAT SOLVERS; SATISFIABILITY MODULO THEORIES; STABLE MODEL; STABLE MODEL SEMANTICS;

COMPUTATIONAL LINGUISTICS; COMPUTER SCIENCE; DECISION THEORY; FARM BUILDINGS; LOGIC PROGRAMMING;

PROGRAM TRANSLATORS;

EID: 70349862107     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04238-6_14     Document Type: Conference Paper

References (22)

1. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICLP, pp. 1070-1080. MIT Press, Cambridge (1988)
2. Lifschitz, V.: Answer set planning. In: ICLP, pp. 23-37. MIT Press, Cambridge (1999)
3. Marek, V., Truszczýnski, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: a 25-Year Perspective, pp. 375-398. Springer, Heidelberg (1999)
4. Niemelä, I.: Logic programming with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell. 25(3-4), 241-273 (1999)
5. Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2), 181-234 (2002)
6. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Scarcello, F.: The DLV System for Knowledge Representation and Reasoning. ACM TOCL 7(3), 499-562 (2006)
7. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Clasp: A conflict-driven answer set solver. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol.4483, pp. 260-265. Springer, Heidelberg (2007)
8. Clark, K.: Negation as failure. In: Logic and Data Bases, pp. 293-322. Plenum Press (1978)
9. Erdem, E., Lifschitz, V.: Tight logic programs. TPLP 3(4-5), 499-518 (2003)
10. Lin, F., Zhao, Y.: ASSAT: computing answer sets of a logic program by SAT solvers. AIJ 157(1-2), 115-137 (2004)
11. Lierler, Y.: Cmodels - SAT-based disjunctive answer set solver. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol.3662, pp. 447-451. Springer, Heidelberg (2005)
12. Giunchiglia, E., Lierler, Y., Maratea, M.: Answer set programming based on propositional satisfiability. Journal of Automated Reasoning 36(4), 345-377 (2006)
13. Ben-Eliyahu, R., Dechter, R.: Propositional Semantics for Disjunctive Logic Programs. Ann. Math. Artif. Intell. 12(1-2), 53-87 (1994)
14. Lin, F., Zhao, J.: On tight logic programs and yet another translation from normal logic programs to propositional logic. In: IJCAI, pp. 853-858 (2003)
15. Janhunen, T.: Representing normal programs with clauses. In: ECAI, pp. 358-362. IOS Press, Amsterdam (2004)
16. Niemelä, I.: Stable models and difference logic. Ann. Math. Artif. Intell. 53(1-4), 313-329 (2008)
17. Nieuwenhuis, R., Oliveras, A.: DPLL(T) with exhaustive theory propagation and its application to difference logic. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.3576, pp. 321-334. Springer, Heidelberg (2005)
18. Bozzano, M., Bruttomesso, R., Cimatti, A., Junttila, T., van Rossum, P., Schulz, S., Sebastiani, R.: MathSAT: Tight integration of sat and mathematical decision procedures. Journal of Automated Reasoning 35(1-3), 265-293 (2005)
19. Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT Modulo Theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). J. ACM 53(6), 937-977 (2006)
20. Cotton, S., Maler, O.: Fast and flexible difference constraint propagation for DPLL(T). In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.4121, pp. 170-183. Springer, Heidelberg (2006)
21. Apt, K., Blair, H., Walker, A.: Towards a theory of declarative knowledge. In: Foundations of Deductive Databases and Logic Programming, pp. 89-148. Morgan Kaufmann, San Francisco (1988)
22. Marek, V.W., Subrahmanian, V.S.: The relationship between stable, supported, default and autoepistemic semantics for general logic programs. TCS 103, 365-386 (1992)