Solving hard ASP programs efficiently

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

Volumn 3662 LNAI, Issue , 2005, Pages 240-252

  Faber, Wolfgang ^a   Ricca, Francesco ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; HEURISTIC METHODS; LARGE SCALE SYSTEMS; RESEARCH AND DEVELOPMENT MANAGEMENT;

ANSWER SET PROGRAMMING (ASP); COMPLEXITY CLASSES; CONDITIONAL PLANNING; EXTENSIVE EXPERIMENTS;

PROBLEM SOLVING;

EID: 33646120116     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11546207_19     Document Type: Conference Paper

References (30)

1. Lifschitz, V.: Answer Set Planning. In Schreye, D.D., ed.: ICLP'99, Las Cruces, New Mexico, USA, The MIT Press (1999) 23-37
2. Eiter, T., Gottlob, G., Mannila, H.: Disjunctive Datalog. ACM TODS 22 (1997) 364-418
3. Rintanen, J.: Improvements to the Evaluation of Quantified Boolean Formulae. In Dean, T., ed.: IJCAI 1999, Sweden,(1999) 1192-1197
4. Eiter, T., Gottlob, G.: The Complexity of Logic-Based Abduction. JACM 42 (1995) 3-42
5. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. CUP (2002)
6. Leone, N., Rosati, R., Scarcello, F.: Enhancing Answer Set Planning. In: IJCAI-01 Workshop on Planning under Uncertainty and Incomplete Information. (2001) 33-42
7. Janhunen, T., Niemelä, I., Simons, P., You, J.H.: Partiality and Disjunctions in Stable Model Semantics. In: KR 2000, 12-15,(2000) 411-419
8. Koch, C., Leone, N., Pfeifer, G.: Enhancing Disjunctive Logic Programming Systems by SAT Checkers. Artificial Intelligence 15 (2003) 177-212
9. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV System for Knowledge Representation and Reasoning. ACM TOCL (2005) To appear.
10. Simons, P., Niemelä, I., Soininen, T.: Extending and Implementing the Stable Model Semantics. Artificial Intelligence 138 (2002) 181-234
11. Lin, F., Zhao, Y.: ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers. In: AAAI-2002, Edmonton, Alberta, Canada, AAAI Press / MIT Press (2002)
12. Lierler, Y., Maratea, M.: Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs. In: LPNMR-7. LNCS, (2004) 346-350
13. Faber, W., Leone, N., Pfeifer, G.: Experimenting with Heuristics for Answer Set Programming. In: IJCAI 2001, Seattle, WA, USA,(2001) 635-640
14. Cadoli, M., Giovanardi, A., Schaerf, M.: Experimental Analysis of the Computational Cost of Evaluating Quantified Boolean Formulae. In: AP*IA 97. Italy, (1997) 207-218
15. Gent, I., Walsh, T.: The QSAT Phase Transition. In: AAAI. (1999)
16. Narizzano, M., Tacchella, A.: QBF Solvers Evaluation page (2002) http://www.qbflib.org/qbfeval/index.html/.
17. Berre, D.L., Simon, L., Tacchella, A.: Challenges in the QBF Arena: the SAT'03 Evaluation of QBF Solvers. In: SAT'03. Santa Margherita Ligure, Italy, (2003) 468-485
18. Marek, W., Subrahmanian, V.: The Relationship between Logic Program Semantics and Non-Monotonic Reasoning. In: ICLP'89, MIT Press (1989) 600-617
19. Leone, N., Rullo, P., Scarcello, F.: Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics and Computation. Information and Computation 135 (1997) 69-112
20. Baral, C., Gelfond, M.: Logic Programming and Knowledge Representation. JLP 19/20 (1994) 73-148
21. Ben-Eliyahu, R., Dechter, R.: Propositional Semantics for Disjunctive Logic Programs. AMAI 12 (1994) 53-87
22. Faber, W., Leone, N., Pfeifer, G.: Pushing Goal Derivation in DLP Computations. In: LPNMR'99. LNCS 1730
23. Eiter, T., Gottlob, G.: On the Computational Cost of Disjunctive Logic Programming: Propositional Case. AMAI 15 (1995) 289-323
24. Feldmann, R., Monien, B., Schamberger, S.: A Distributed Algorithm to Evaluate Quantified Boolean Formulae. In: Proceedings National Conference on AI (AAAI'00), Austin, Texas, AAAI Press (2000) 285-290
25. Letz, R.: Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas. In: TABLEAUX 2002. Denmark, (2002) 160-175
26. Biere, A.: Resolve and Expand. (2004) SAT'04.
27. Zhang, L., Malik, S.: Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation. In: CP 2002. NY, USA, (2002) 200-215
28. Cadoli, M., Eiter, T., Gottlob, G.: Default Logic as a Query Language. IEEE TKDE 9 (1997) 448-463
29. Zolda, M.: Comparing Different Prenexing Strategies for Quantified Boolean Formulas. Master's thesis, TU Wien (2005)
30. Castellini, C., Giunchiglia, E., Tacchella, A.: SAT-based planning in complex domains: Concurrency, constraints and nondeterminism. Artificial Intelligence 147 (2003) 85-117