Abstract
Most SAT solvers and Answer Set Programming (ASP) systems employ a backtracking search by repeatedly assuming the truth of literals. The choice of these branching literals is crucial for the performance of these systems.
Competitive ASP systems employ advanced heuristics to select branching literals, which are usually based on “look-ahead“ techniques: To evaluate the heuristic value of a literal L, truth and falsity of L are assumed in the current interpretation, consequences are derived, and the quality of the resulting interpretations is evaluated. This process can be very expensive, and often consumes most of the time taken by an ASP system.
In this paper, we present two techniques to optimize the computation of the heuristics in the ASP system DLV. The first technique singles out pairs of literals 〈A, not B〉 having precisely the same consequences, which allows for making only one look-ahead for each of these pairs. The second technique (inspired by SAT solvers) is a 2-layered heuristic, in which a simple heuristic criterion reduces the set of literals to be looked-ahead. We implement both techniques in the ASP system DLV and evaluate their efficiency on a number of benchmark problems taken from various domains. The experiments confirm the usefulness of both techniques, sensibly improving the performance of DLV.
This work was supported by FWF (Austrian Science Funds) under the projects Z29-INF and P14781 and MURST under project COFIN-2000 “From Data to Information (D2I)”.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. Cadoli, T. Eiter, and G. Gottlob. Default Logic as a Query Language. IEEE TKDE, 9(3):448–463, 1997. 304, 305
T. Eiter, W. Faber, N. Leone, and G. Pfeifer. The Diagnosis Frontend of the dlv System. AI Communications, 12(1-2):99–111, 1999. 295
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. 297
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. 295
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. 295
E. Erdem. Applications of Logic Programming to Planning: Computational Experiments. Unpublished draft. http://www.cs.utexas.edu/users/esra/papers.html, 1999. 304, 305
W. Faber, N. Leone, C. Mateis, and G. Pfeifer. Using Database Optimization Techniques for Nonmonotonic Reasoning. DDLP’99, pp. 135–139. 298, 304
W. Faber, N. Leone, and G. Pfeifer. Pushing Goal Derivation in DLP Computations. LPNMR’99, pp. 177–191. 296, 299, 300, 301
W. Faber, N. Leone, and G. Pfeifer. Experimenting with heuristics for answer set programming. In IJCAI 2001, Seattle, WA, USA, August 2001. To appear. 296
M. Gelfond and V. Lifschitz. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 9:365–385, 1991. 295, 297, 298
C. L. Li and Anbulagan. Heuristics based on unit propagation for satisfiability problems. In IJCAI 1997, pp. 366–371. 297, 303
V. Lifschitz. Foundations of logic programming. Principles of Knowledge Representation, pp. 69–127. CSLI Publications, Stanford, 1996. 298
V. Lifschitz. Answer set planning. ICLP’99, pp. 23–37. The MIT Press. 296
N. Leone, P. Rullo, and F. Scarcello. Disjunctive stable models: Unfounded sets, fixpoint semantics and computation. Information and Computation, 135(2):69–112, 1997. 300
J. Minker. On Indefinite Data Bases and the Closed World Assumption. CADE’82, LNCS 138, pp. 292–308, New York, 1982. Springer. 295
P. Simons. Extending and Implementing the Stable Model Semantics. PhD thesis, Helsinki University of Technology, Finland, 2000. 305
B. Selman and H. Kautz, 1997. ftp://ftp.research.att.com/dist/ai/305
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Faber, W., Leone, N., Pfeifer, G. (2001). Optimizing the Computation of Heuristics for Answer Set Programming Systems. In: Eiter, T., Faber, W., Truszczyński, M.l. (eds) Logic Programming and Nonmotonic Reasoning. LPNMR 2001. Lecture Notes in Computer Science(), vol 2173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45402-0_22
Download citation
DOI: https://doi.org/10.1007/3-540-45402-0_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42593-9
Online ISBN: 978-3-540-45402-1
eBook Packages: Springer Book Archive