Skip to main content
SpringerLink
Log in

Declarative Problem-Solving Using the DLV System

  • Chapter
Logic-Based Artificial Intelligence

Part of the book series: The Springer International Series in Engineering and Computer Science ((SECS,volume 597))

Abstract

The need for representing indefinite information led to disjunctive deductive databases, which also fertilized work on disjunctive logic programming. Based on this paradigm, the DLV system has been designed and implemented as a tool for declarative knowledge representation. In this paper, we focus on the usage of DLV for solving problems in a declarative manner and report on experiments that we have run on a suite of benchmark problems. We discuss how problems can be solved in a natural way using a “Guess&Check”-paradigm where solutions are guessed and verified by parts of the program. Furthermore, we describe various front-ends that can be used for solving problems in specific applications. The experiments show that due to the ongoing implementation efforts, which include fine-tuning of the underlying algorithms, successive and significant performance improvements have been achieved during the last two years. The results indicate that DLV is capable of solving some complex problems quite efficiently.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 249.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Apt, K. R., Blair, H. A., and Walker, A. (1988). Towards a theory of declarative knowledge. In Minker, J., editor, Foundations of Deductive Databases and Logic Programming, pages 89–148. Morgan Kaufmann Publishers, Inc., Los Altos, California.

    Google Scholar 

  • Aravindan, C., Dix, J., and Niemelä, I. (1997). Dislop: A research project on disjunctive logic programming. AI Communications, 10(3/4):151–165.

    Google Scholar 

  • Ben-Eliyahu, R. and Dechter, R. (1994). Propositional semantics for disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, 12:53–87.

    Article  MathSciNet  MATH  Google Scholar 

  • Ben-Eliyahu, R. and Palopoli, L. (1994). Reasoning with minimal models: efficient algorithms and applications. In Proc. Fourth International Conf. on Principles of Knowledge Representation and Reasoning (KR-94), pages 39–50.

    Google Scholar 

  • Buccafurri, F., Faber, W., and Leone, N. (1999). Disjunctive logic programs with inheritance. In Schreye, D. D., editor, Proceedings of the 16th International Conference on Logic Programming (ICLP’99), pages 79–93, Las Cruces, New Mexico, USA. The MIT Press.

    Google Scholar 

  • Buccafurri, F., Leone, N., and Rullo, P. (1997). Strong and weak constraints in disjunctive Datalog. In Dix, J., Furbach, U., and Nerode, A., editors, Proceedings of the 4 th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR ’97), number 1265 in Lecture Notes in AI (LNAI), pages 2–17, Dagstuhl, Germany. Springer Verlag.

    Google Scholar 

  • Cadoli, M., Eiter, T., and Gottlob, G. (1997). Default logic as a query language. IEEE Transactions on Knowledge and Data Engineering, 9(3):448–463.

    Article  Google Scholar 

  • Cadoli, M., Palopoli, L., Schaerf, A., and Vasile, D. (1999). NP-SPEC: An executable specification language for solving all problems in NP. In Gupta, G., editor, Proceedings of the 1st International Workshop on Practical Aspects of Declarative Languages (PADL’99), number 1551 in Lecture Notes in Computer Science, pages 16–30. Springer.

    Google Scholar 

  • Chen, W. and Warren, D. S. (1996). Computation of stable models and its integration with logical query processing. IEEE Transactions on Knowledge and Data Engineering, 8(5):742–757.

    Article  Google Scholar 

  • Cholewiński, P., Marek, V. W., Mikitiuk, A., and Truszczyński, M. (1999). Computing with default logic. Artificial Intelligence, 112(2–3): 105–147.

    Article  MathSciNet  Google Scholar 

  • Cholewiński, P., Marek, V. W., and Truszczyński, M. (1996). Default reasoning system DeReS. In Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR’96), pages 518–528. Cambridge, Massachusetts, USA. Morgan Kaufmann Publishers.

    Google Scholar 

  • Dimopoulos, Y., Nebel, B., and Koehler, J. (1997). Encoding planning problems in nonmonotonic logic programs. In Proceedings of the European Conference on Planning 1997 (ECP-97), pages 169–181. Springer Verlag.

    Google Scholar 

  • Eiter, T., Faber, W., Leone, N., and Pfeifer, G. (1999). The diagnosis frontend of the DLV system. AI Communications — The European Journal on Artificial Intelligence, 12(1–2):99–l11.

    MathSciNet  Google Scholar 

  • Eiter, T., Gottlob, G., and Leone, N. (1997a). Abduction from logic programs: Semantics and complexity. Theoretical Computer Science, 189(1–2):129–177.

    Article  MathSciNet  MATH  Google Scholar 

  • Eiter, T., Gottlob, G., and Mannila, H. (1994). Adding disjunction to Datalog. In Proc. of the Thirteenth ACM SIGACT SIGMOD-SIGART Symposium on Principles of Database Systems (PODS-94), pages 267–278. ACM Press.

    Google Scholar 

  • Eiter, T., Gottlob, G., and Mannila, H. (1997b). Disjunctive Datalog. ACM Transactions on Database Systems, 22(3):315–363.

    Article  Google Scholar 

  • Eiter, T., Leone, N., Mateis, C, Pfeifer, G., and Scarcello, F. (1997c). A deductive system for nonmonotonic reasoning. In Dix, J., Furbach, U., and Nerode, A., editors, Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR’97), number 1265 in Lecture Notes in AI (LNAI), pages 363–374, Berlin. Springer.

    Chapter  Google Scholar 

  • Eiter, T., Leone, N., Mateis, C., Pfeifer, G., and Scarcello, F. (1997d). The architecture of a disjunctive deductive database system. In Falaschi, M., Navarro, M., and Policriti, A., editors, Proceedings Joint Conference on Declarative Programming (APPIA-GULP-PRODE’97), pages 141–151.

    Google Scholar 

  • Eiter, T., Leone, N., Mateis, C., Pfeifer, G., and Scarcello, F. (1998a). Progress report on the disjunctive deductive database system DLV. In Andreasen, T., Christiansen, H., and Larsen, H. L., editors, Proc. International Conf. on Flexible Query Answering Systems (FQAS’98), number 1495 in Lecture Notes in AI (LNAI), pages 148–163, Roskilde University, Denmark. Springer.

    Chapter  Google Scholar 

  • Eiter, T., Leone, N., Mateis, C., Pfeifer, G., and Scarcello, F. (1998b). The KR system DLV: Progress report, comparisons and benchmarks. In Cohn, A. G., Schubert, L., and Shapiro, S. C., editors, Proceedings Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR’98), pages 406–417. Morgan Kaufmann Publishers.

    Google Scholar 

  • Erdem, E. (1999). Applications of logic programming to planning: Computational experiments. Unpublished draft, http://www.cs.utexas.edu/users/esra/papers.html.

    Google Scholar 

  • Erdem, E. (since 1998). Website for applications of logic programming to planning: Computational experiments. http://www.cs.utexas.edu/users/esra/experiments/experiments.html.

    Google Scholar 

  • Faber, W. (1998). Disjunctive Datalog with strong and weak constraints: Representational and computational issues. Master’s thesis, Institut für Informationssysteme, Technische Universität Wien.

    Google Scholar 

  • Faber, W. (1999). DLV homepage. <URL: http://www.dbai.tuwien.ac.at/proj/dlv/inheritance/>.

  • Faber, W., Leone, N., Mateis, C., and Pfeifer, G. (1999a). Using database optimization techniques for monmonotonic reasoning. In Committee, I. O., editor, Proceedings of the 7th International Workshop on Deductive Databases and Logic Programming (DDLP’99), pages 135–139. Prolog Association of Japan.

    Google Scholar 

  • Faber, W., Leone, N., and Pfeifer, G. (1999b). Pushing goal derivation in DLP computations. In Gelfond, M., Leone, N., and Pfeifer, G., editors, Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR’99), number 1730 in Lecture Notes in AI (LNAI), pages 177–191, El Paso, Texas, USA. Springer Verlag.

    Google Scholar 

  • Faber, W. and Pfeifer, G. (since 1996). dlv homepage. <URL:http://www.dbai.tuwien.ac.at/proj/dlv/>.

  • Gelfond, M. and Lifschitz, V. (1991). Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365–385.

    Article  Google Scholar 

  • Janhunen, T., Niemela, I., Simons, P., and You, J.-H. (2000). Partiality and disjunctions in stable model semantics. In Cohn, A. G., Giunchiglia, F., and Selman, B., editors, Proceedings of the Seventh International Conference on Principles of Knowledge Representation and Reasoning (KR2000), pages 411–419, Breckenridge, Colorado, USA. Morgan Kaufmann Publishers, Inc.

    Google Scholar 

  • Koch, C. (1999). A simple query facility for the objectivity/db persistent object manager. Unpublished draft, available via the author’s homepage <URL: http://home.cern.ch/~chkoch/>.

    Google Scholar 

  • Koch, C. and Leone, N. (1999). Stable model checking made easy. In Dean, T., editor, The International Joint Conferences on Artificial Intelligence (IJ-CAI) 1999, pages 70–75, Stockholm, Sweden. Morgan Kaufmann Publishers.

    Google Scholar 

  • Leone, N., Rullo, P., and Scarcello, F. (1997). Disjunctive stable models: Unfounded sets, fixpoint semantics and computation. Information and Computation, 135(2):69–112.

    Article  MathSciNet  MATH  Google Scholar 

  • Lifschitz, V. (1996). Foundations of logic programming. In Brewka, G., editor, Principles of Knowledge Representation, pages 69–127. CSLI Publications, Stanford.

    Google Scholar 

  • Lifschitz, V. (1999a). Action languages, answer sets and planning. In Apt, K., Marek, V. W., Truszczyński, M., and Warren, D. S., editors, The Logic Programming Paradigm — A 25-Year Perspective, pages 357–373. Springer Verlag.

    Google Scholar 

  • Lifschitz, V. (1999b). Answer set planning. In Schreye, D. D., editor, Proceedings of the 16th International Conference on Logic Programming (ICLP’99), pages 23–37, Las Cruces, New Mexico, USA. The MIT Press.

    Google Scholar 

  • Lifschitz, V. and Turner, H. (1994). Splitting a logic program. In Van Hentenryck, P., editor, Proceedings of the 11th International Conference on Logic Programming (ICLP’94), pages 23–37, Santa Margherita Ligure, Italy. MIT Press.

    Google Scholar 

  • Lobo, J., Minker, J., and Rajasekar, A. (1992). Foundations of Disjunctive Logic Programming. The MIT Press, Cambridge, Massachusetts.

    Google Scholar 

  • Marek, V. W. and Truszczyński, M. (1999). Stable models and an alternative logic programming paradigm. In Apt, K., Marek, V. W., Truszczyński, M., and Warren, D. S., editors, The Logic Programming Paradigm — A 25-Year Perspective, pages 375–398. Springer Verlag.

    Google Scholar 

  • McCain, N. (1999). The clausal calculator homepage.<URL:http://www.cs.utexas.edu/users/mccain/cc/>.

  • Minker, J. (1994). Overview of disjunctive logic programming. Annals of Mathematics and Artificial Intelligence, 12:1–24.

    Article  MathSciNet  Google Scholar 

  • Niemelä, I. (1999). Logic programming with stable model semantics as constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3–4):241–273.

    Article  MathSciNet  MATH  Google Scholar 

  • Niemelä, I. and Simons, P. (1996). Efficient implementation of the well-founded and stable model semantics. In Maher, M. J., editor, Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming (ICLP’96), pages 289–303, Bonn, Germany. MIT Press.

    Google Scholar 

  • Niemelä, I. and Simons, P. (1997). Smodels — an implementation of the stable model and well-founded semantics for normal logic programs. In Dix, J., Furbach, U., and Nerode, A., editors, Proceedings of the 4th Int. Conf. on Logic Programming and Nonmonotonic Reasoning (LPNMR’97), volume 1265 of Lecture Notes in AI (LNAI), pages 420–429, Dagstuhl, Germany. Springer Verlag.

    Chapter  Google Scholar 

  • Poole, D. (1989). Explanation and prediction: An architecture for default and abductive reasoning. Computational Intelligence, 5(1):97–110.

    Article  MathSciNet  Google Scholar 

  • Przymusinski, T. C. (1991). Stable semantics for disjunctive programs. New Generation Computing, 9:401–424.

    Article  Google Scholar 

  • Rao, P., Sagonas, K. F., Swift, T., Warren, D. S., and Freire, J. (1997). XSB: A system for efficiently computing well-founded semantics. In Dix, J., Furbach, U., and Nerode, A., editors, Proceedings of the 4th Int. Conf. on Logic Programming and Non-Monotonic Reasoning (LPNMR’97), number 1265 in Lecture Notes in AI (LNAI), pages 2–17, Dagstuhl, Germany. Springer Verlag.

    Google Scholar 

  • Reiter, R. (1987). A theory of diagnosis from first principles. Artificial Intelligence, 32:57–95.

    Article  MathSciNet  MATH  Google Scholar 

  • Seipel, D. and Thöne, H. (1994). DisLog — A system for reasoning in disjunctive deductive databases. In Olivé, A., editor, Proceedings International Workshop on the Deductive Approach to Information Systems and Databases (DAISD’94), pages 325–343. Universitat Politecnica de Catalunya (UPC).

    Google Scholar 

  • Subrahmanian, V. and Zaniolo, C. (1995). Relating stable models and AI planning domains. In Sterling, L., editor, Proceedings of the 12 th International Conference on Logic Programming, pages 233–247, Tokyo, Japan. MIT Press.

    Google Scholar 

  • Turner, H. (1997). Representing actions in logic programs and default theories: A situation calculus approach. Journal of Logic Programming, 31(1–3):245–298.

    Article  MathSciNet  MATH  Google Scholar 

  • van Gelder, A., Ross, K., and Schlipf, J. (1991). The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620–650.

    MATH  Google Scholar 

  • Winston, P. H. (1992). Artificial Intelligence. Addison Wesley.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Systems Department, Technische Universität, Paniglgasse 16, A-1040, Wien, Austria

    Thomas Eiter, Wolfgang Faber, Nicola Leone & Gerald Pfeifer

Authors
  1. Thomas Eiter
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wolfgang Faber
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nicola Leone
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gerald Pfeifer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Advanced Computer Studies and Department of Computer Science, University of Maryland, USA

    Jack Minker

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer Science+Business Media New York

About this chapter

Cite this chapter

Eiter, T., Faber, W., Leone, N., Pfeifer, G. (2000). Declarative Problem-Solving Using the DLV System. In: Minker, J. (eds) Logic-Based Artificial Intelligence. The Springer International Series in Engineering and Computer Science, vol 597. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1567-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-1567-8_4

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-5618-9

  • Online ISBN: 978-1-4615-1567-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation