Optimizing the computation of heuristics for answer set programming systems

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

Volumn 2173 LNAI, Issue , 2001, Pages 295-308

  Faber, Wolfgang ^a   Leone, Nicola ^b   Pfeifer, Gerald ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET PROGRAMMING; BACKTRACKING SEARCH; BENCH-MARK PROBLEMS; HEURISTIC CRITERION; LITERALS; LOOK-AHEAD; SAT SOLVERS;

LOGIC PROGRAMMING; OPTIMIZATION;

QUALITY CONTROL;

EID: 84867759736     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45402-0_22     Document Type: Conference Paper

References (17)

1. M. Cadoli, T. Eiter, and G. Gottlob. Default Logic as a Query Language. IEEE TKDE, 9(3):448-463, 1997.
2. T. Eiter, W. Faber, N. Leone, and G. Pfeifer. The Diagnosis Frontend of the dlv System. AI Communications, 12(1-2):99-111, 1999.
3. T. Eiter, W. Faber, N. Leone, and G. Pfeifer. Declarative Problem-Solving Using the DLV System. Logic-Based Artificial Intelligence, pp. 79-103. Kluwer, 2000.
4. T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. Progress Report on the Disjunctive Deductive Database System dlv. FQAS'98, pp. 148-163. Springer.
5. T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. The KR System dlv: Progress Report, Comparisons and Benchmarks. KR'98, pp. 406-417. Morgan Kaufmann Publishers, 1998.
6. E. Erdem. Applications of Logic Programming to Planning: Computational Experiments. Unpublished draft. http://www.cs.utexas.edu/users/esra/papers.html, 1999.
7. W. Faber, N. Leone, C. Mateis, and G. Pfeifer. Using Database Optimization Techniques for Nonmonotonic Reasoning. DDLP'99, pp. 135-139.
8. W. Faber, N. Leone, and G. Pfeifer. Pushing Goal Derivation in DLP Computations. LPNMR'99, pp. 177-191.
9. W. Faber, N. Leone, and G. Pfeifer. Experimenting with heuristics for answer set programming. In IJCAI 2001, Seattle, WA, USA, August 2001. To appear.
10. M. Gelfond and V. Lifschitz. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 9:365-385, 1991.
11. C. L. Li and Anbulagan. Heuristics based on unit propagation for satisfiability problems. In IJCAI 1997, pp. 366-371.
12. V. Lifschitz. Foundations of logic programming. Principles of Knowledge Representation, pp. 69-127. CSLI Publications, Stanford, 1996.
13. V. Lifschitz. Answer set planning. ICLP'99, pp. 23-37. The MIT Press.
14. N. Leone, P. Rullo, and F. Scarcello. Disjunctive stable models: Unfounded sets, fixpoint semantics and computation. Information and Computation, 135(2):69-112, 1997.
15. J. Minker. On Indefinite Data Bases and the Closed World Assumption. CADE'82, LNCS 138, pp. 292-308, New York, 1982. Springer.
16. P. Simons. Extending and Implementing the Stable Model Semantics. PhD thesis, Helsinki University of Technology, Finland, 2000.
17. B. Selman and H. Kautz, 1997. ftp://ftp.research.att.com/dist/ai/.