Abstract answer set solvers

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

Volumn 5366 LNCS, Issue , 2008, Pages 377-391

  Lierler, Yuliya ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DAVIS-PUTNAM-LOGEMANN-LOVELAND (DPLL); LOGIC PROGRAMS; SET SOLVERS; TRANSITION SYSTEMS; ANSWER SET; DAVIS-PUTNAM-LOGEMANN-LOVELAND; PSEUDO-CODE; SMODELS; TRANSITION SYSTEM;

COMPUTER PROGRAMMING; PROGRAMMING THEORY; LOGIC PROGRAMMING;

LOGIC PROGRAMMING; ALGORITHMS;

EID: 58749113414     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89982-2_35     Document Type: Conference Paper

References (14)

1. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of ACM 5(7), 394-397 (1962)
2. Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). Journal of the ACM 53(6), 937-977 (2006)
3. Simons, P.: Extending and Implementing the Stable Model Semantics. PhD thesis, Helsinki University of Technology (2000)
4. Giunchiglia, E., Lierler, Y., Maratea, M.: Answer set programming based on propositional satisfiability. Journal of Automated Reasoning 36, 345-377 (2006)
5. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Proceedings of International Logic Programming Conference and Symposium, pp. 1070-1080. MIT Press, Cambridge (1988)
6. Ward, J.: Answer Set Programming with Clause Learning. PhD thesis, The University of Cincinnati (2004)
7. Van Gelder, A., Ross, K., Schlipf, J.: The well-founded semantics for general logic programs. Journal of ACM 38(3), 620-650 (1991)
8. 10
9. Een, N., Sörensson, N.: An extensible sat-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919. Springer, Heidelberg (2004)
10. Fages, F.: Consistency of Clark's completion and existence of stable models. Journal of Methods of Logic in Computer Science 1, 51-60 (1994)
11. Clark, K.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293-322. Plenum Press, New York (1978)
12. Giunchiglia, E., Maratea, M.: On the relation between answer set and SAT procedures (or, between smodels and cmodels). In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 37-51. Springer, Heidelberg (2005)
13. Gebser, M., Schaub, T.: Tableau calculi for answer set programming. In: Etalle, S., Truszczyński, M. (eds.) ICLP 2006. LNCS, vol. 4079, pp. 11-25. Springer, Heidelberg (2006)
14. Leone, N., Rullo, P., Scarcello, F.: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. Information and Computation 135(2), 69-112 (1997)