On the implementation of weight constraint rules in Conflict-Driven ASP solvers

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

Volumn 5649 LNCS, Issue , 2009, Pages 250-264

  Gebser, Martin ^a   Kaminski, Roland ^a   Kaufmann, Benjamin ^a   Schaub, Torsten ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET; CARDINALITIES; CONSTRAINT-BASED; EXPERIMENTAL EVALUATION; PROPAGATION ALGORITHM; SALIENT FEATURES; WEIGHT CONSTRAINTS;

DATA STRUCTURES; LOGIC PROGRAMMING;

CONTEXT FREE GRAMMARS;

EID: 69949116873     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02846-5_23     Document Type: Conference Paper

References (14)

1. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)
2. Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2), 181-234 (2002)
3. Dowling, W., Gallier, J.: Linear-time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming 1, 267-284 (1984)
4. Giunchiglia, E., Lierler, Y., Maratea, M.: Answer set programming based on propositional satisfiability. Journal of Automated Reasoning 36(4), 345-377 (2006)
5. Marques-Silva, J., Sakallah, K.: GRASP: A search algorithm for propositional satisfiability. IEEE Transactions on Computers 48(5), 506-521 (1999)
6. Zhang, L., Madigan, C., Moskewicz, M., Malik, S.: Efficient conflict driven learning in a Boolean satisfiability solver. In: ICCAD 2001, pp. 279-285 (2001)
7. Ferraris, P., Lifschitz, V.: Weight constraints as nested expressions. Theory and Practice of Logic Programming 5(1-2), 45-74 (2005)
8. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: IJCAI 2007, pp. 386-392. AAAI Press, Menlo Park (2007)
9. Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)
10. Drescher, C., Gebser, M., Grote, T., Kaufmann, B., König, A., Ostrowski, M., Schaub, T.: Conflict-driven disjunctive answer set solving. In: KR 2008, pp. 422-432. AAAI Press, Menlo Park (2008)
11. Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: DAC 2001, pp. 530-535. ACM Press, New York (2001)
12. Sheini, H., Sakallah, K.: Pueblo: A hybrid Pseudo-Boolean SAT solver. Journal on Satisfiability, Boolean Modeling and Computation 2, 165-189 (2006)
13. Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502-518. Springer, Heidelberg (2004)
14. http://www.cs.uni-potsdam.de/clasp