Skip to main content
SpringerLink
Log in

Satisfiability Checking for PC(ID)

  • Conference paper
Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3835))

Abstract

The logic FO(ID) extends classical first order logic with inductive definitions. This paper studies the satisifiability problem for PC(ID), its propositional fragment. We develop a framework for model generation in this logic, present an algorithm and prove its correctness. As FO(ID) is an integration of classical logic and logic programming, our algorithm integrates techniques from SAT and ASP. We report on a prototype system, called MidL, experimentally validating our approach.

Works supported by FWO-Vlaanderen, IWT-Vlaanderen, European Framework 5 Project WASP, and by GOA/2003/08.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

  1. Berman, K.A., Schlipf, J.S., Franco, J.V.: Computing the well-founded semantics faster. In: Marek, V.W., Truszczyński, M., Nerode, A. (eds.) LPNMR 1995. LNCS, vol. 928, pp. 113–126. Springer, Heidelberg (1995)

    Google Scholar 

  2. Brachman, R.J., Levesque, H.J.: Competence in knowledge representation. In: Proc. of the National Conference on Artificial Intelligence, pp. 189–192 (1982)

    Google Scholar 

  3. Davis, M., Longemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM 5, 394–397 (1962)

    Article  MATH  Google Scholar 

  4. Dell’Armi, T., Faber, W., Ielpa, G., Koch, C., Leone, N., Perri, S., Pfeifer, G.: System description: DLV. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 424–428. Springer, Heidelberg (2001)

    Google Scholar 

  5. Denecker, M.: Knowledge Representation and Reasoning in Incomplete Logic Programming. PhD thesis, Department of Computer Science, K.U.Leuven (1993)

    Google Scholar 

  6. Denecker, M.: The well-founded semantics is the principle of inductive definition. In: Dix, J., Fariñas del Cerro, L., Furbach, U. (eds.) JELIA 1998. LNCS (LNAI), vol. 1489, pp. 1–16. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  7. Denecker, M.: Extending classical logic with inductive definitions. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 703–717. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  8. Denecker, M., Bruynooghe, M., Marek, V.: Logic programming revisited: logic programs as inductive definitions. ACM Transactions on Computational Logic 2(4), 623–654 (2001)

    Article  MathSciNet  Google Scholar 

  9. Denecker, M., De Schreye, D.: Justification semantics: a unifying framework for the semantics of logic programs. In: LPNMR, pp. 365–379. MIT Press, Cambridge (1993)

    Google Scholar 

  10. Denecker, M., Ternovska, E.: Inductive situation calculus. In: Dubois, D., Welty, C.A., Williams, M. (eds.) KR, pp. 545–553. AAAI Press, Menlo Park (2004)

    Google Scholar 

  11. East, D., Truszczyński, M.: dcs: An implementation of datalog with constraints. CoRR, cs.AI/0003061 (2000)

    Google Scholar 

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

    Article  Google Scholar 

  13. Lierler, Y., Maratea, M.: Cmodels-2: SAT-based answer set solver enhanced to non-tight programs. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 346–350. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  14. Lin, F., Zhao, Y.: ASSAT: computing answer sets of a logic program by sat solvers. Artif. Intell. 157(1-2), 115–137 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  15. Lonc, Z., Truszczyński, M.: On the problem of computing the well-founded semantics. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 673–687. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  16. Mariën, M., Gilis, D., Denecker, M.: On the relation between ID-logic and answer set programming. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS, vol. 3229, pp. 108–120. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  17. Mariën, M., Mitra, R., Denecker, M., Bruynooghe, M.: Satisfiability checking for PC(ID). Technical Report CW426, K.U. Leuven (2005)

    Google Scholar 

  18. Marques-Silva, J.P., Sakallah, K.A.: GRASP: A search algorithm for propositional satisfiability. IEEE Trans. Computers 48(5), 506–521 (1999)

    Article  MathSciNet  Google Scholar 

  19. Mitchell, D.G., Ternovska, E.: A framework for representing and solving NP search problems. In: Twentieth National Conf. on Artificial Intelligence (AAAI 2005). AAAI Press/MIT Press (2005)

    Google Scholar 

  20. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: DAC, pp. 530–535. ACM, New York (2001)

    Google Scholar 

  21. Niemelä, I., Simons, P., Syrjänen, T.: Smodels: a system for answer set programming. In: NMR (2000)

    Google Scholar 

  22. Nuutila, E., Soisalon-Soininen, E.: On finding the strongly connected components in a directed graph. Inf. Process. Lett. 49(1), 9–14 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  23. Pelov, N., Ternovska, E.: Reducing inductive definitions to propositional satisfiability. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 221–234. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  24. Ryan, L.: Efficient algorithms for clause-learning SAT solvers. Master’s thesis, Simon Fraser University (2004)

    Google Scholar 

  25. Sagonas, K.F., Swift, T., Warren, D.S.: XSB as an efficient deductive database engine. In: Snodgrass, R.T., Winslett, M. (eds.) SIGMOD Conference, pp. 442–453. ACM Press, New York (1994)

    Google Scholar 

  26. Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146–160 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  27. Van Gelder, A.: The alternating fixpoint of logic programs with negation. Journal of Computer and System Sciences 47(1), 185–221 (1993)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  29. Zhang, L., Madigan, C.F., Moskewicz, M.W., Malik, S.: Efficient conflict driven learning in a boolean satisfiability solver. In: ICCAD, pp. 279–285. ACM, New York (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Katholieke Universiteit Leuven, Belgium

    Maarten Mariën, Rudradeb Mitra, Marc Denecker & Maurice Bruynooghe

Authors
  1. Maarten Mariën
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rudradeb Mitra
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marc Denecker
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Maurice Bruynooghe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Miami, USA

    Geoff Sutcliffe

  2. University of Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mariën, M., Mitra, R., Denecker, M., Bruynooghe, M. (2005). Satisfiability Checking for PC(ID). In: Sutcliffe, G., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2005. Lecture Notes in Computer Science(), vol 3835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11591191_39

Download citation

  • DOI: https://doi.org/10.1007/11591191_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30553-8

  • Online ISBN: 978-3-540-31650-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation