Pushing Goal Derivation in DLP Computations

  • Wolfgang Faber
  • Nicola Leone
  • Gerald Pfeifer
Conference paper

DOI: 10.1007/3-540-46767-X_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1730)
Cite this paper as:
Faber W., Leone N., Pfeifer G. (1999) Pushing Goal Derivation in DLP Computations. In: Gelfond M., Leone N., Pfeifer G. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 1999. Lecture Notes in Computer Science, vol 1730. Springer, Berlin, Heidelberg

Abstract

dlv is a knowledge representation system, based on disjunctive logic programming, which offers front-ends to several advanced KR formalisms. This paper describes new techniques for the computation of answer sets of disjunctive logic programs, that have been developed and implemented in the dlv system. These techniques try to “push” the query goals in the process of model generation (query goals are often present either explicitly, like in planning and diagnosis, or implicitly in the form of integrity constraints). This way, a lot of useless models are discarded “a priori” and the computation converges rapidly toward the generation of the “right” answer set. A few preliminary benchmarks show dramatic efficiency gains due to the new techniques.

Keywords

Disjunctive Logic Programming Algorithms Heuristics 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Wolfgang Faber
    • 1
  • Nicola Leone
    • 1
  • Gerald Pfeifer
    • 1
  1. 1.Institut für InformationssystemeWienAustria

Personalised recommendations