Skip to main content
SpringerLink
Log in

Solving Alternating Boolean Equation Systems in Answer Set Programming

  • Conference paper
Applications of Declarative Programming and Knowledge Management (INAP 2004, WLP 2004)

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

  • 483 Accesses

Abstract

In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive and conjunctive Boolean equation systems. Based on this we devise a mapping from Boolean equation systems with alternating fixed points to normal logic programs such that the solution of a given variable of an equation system can be determined by the existence of a stable model of the corresponding logic program. The technique can be used to model check alternating formulas of modal μ-calculus.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Andersen, H.R.: Model checking and Boolean graphs. Theoretical Computer Science 126, 3–30 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  2. Arnold, A., Crubille, P.: A linear algorithm to solve fixed-point equations on transition systems. Information Processing Letters 29, 57–66 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  3. Arnold, A., Niwinski, D.: Rudiments of μ-calculus. Studies in Logic and the foundations of mathematics, vol. 146. Elsevier, Amsterdam (2001)

    Book  Google Scholar 

  4. Bhat, G., Cleaveland, R.: Efficient local model-checking for fragments of the modal μ-calculus. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 107–126. Springer, Heidelberg (1996)

    Google Scholar 

  5. Delzanno, G., Podelski, A.: Model checking in CLP. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, pp. 223–239. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  6. Emerson, E.A., Jutla, C., Sistla, A.P.: On model checking for fragments of the μ-calculus. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 385–396. Springer, Heidelberg (1993)

    Google Scholar 

  7. Emerson, E.A., Jutla, C., Sistla, A.P.: On model checking for the μ-calculus and its fragments. Theoretical Computer Science 258, 491–522 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  8. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the 5th International Conference on Logic Programming, Seattle, USA, August 1988, pp. 1070–1080. The MIT Press, Cambridge (1988)

    Google Scholar 

  9. Groote, J.F., Keinänen, M.: Solving Disjunctive/Conjunctive Boolean Equation Systems with Alternating Fixed Points. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 436–450. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Heljanko, K., Niemelä, I.: Bounded LTL model checking with stable models. Theory and Practice of Logic Programming 3, 519–550 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  11. Jurdzinski, M.: Deciding the winner in parity games is in UP ∩ co − UP. Information Processing Letters 68, 119–124 (1998)

    Article  MathSciNet  Google Scholar 

  12. Kozen, D.: Results on the propositional μ-calculus. Theoretical Computer Science 27, 333–354 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  13. Kumar, K.N., Ramakrishnan, C.R., Smolka, S.A.: Alternating fixed points in Boolean equation systems as preferred stable models. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol. 2237, pp. 227–241. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  14. Lifschitz, V.: Answer Set Planning. In: Proceedings of the 16th International Conference on Logic Programming, pp. 25–37. The MIT Press, Cambridge (1999)

    Google Scholar 

  15. Lifschitz, V., Turner, H.: Splitting a Logic Program. In: Proceedings of the Eleventh International Conference on Logic Programming, pp. 23–37. The MIT Press, Cambridge (1994)

    Google Scholar 

  16. Liu, X., Ramakrishnan, C.R., Smolka, S.A.: Fully Local and Efficient Evaluation of Alternating Fixed Points. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 5–19. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  17. Liu, X., Smolka, S.A.: Simple Linear-Time Algorithms for Minimal Fixed Points. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 53–66. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  18. Mader, A.: Verification of Modal Properties using Boolean Equation Systems. PhD thesis, Technical University of Munich (1997)

    Google Scholar 

  19. Marek, W., Truszczyński, M.: Stable Models and an Alternative Logic Programming Paradigm. In: The Logic Programming Paradigm: a 25-Year Perspective, pp. 375–398. Springer, Heidelberg (1999)

    Google Scholar 

  20. Niemelä, I.: Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm. Annals of Mathematics and Artificial Intelligence 25(3,4), 241–273 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  21. Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  22. Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138(1–2), 181–234 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  23. Vergauwen, B., Lewi, J.: Efficient local correctness checking for single and alternating Boolean equation systems. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol. 820, pp. 302–315. Springer, Heidelberg (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Engineering, Lab. for Theoretical Comp. Science, Helsinki University of Technology, HUT, P.O. Box 5400, FI-02015, Finland

    Misa Keinänen & Ilkka Niemelä

Authors
  1. Misa Keinänen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ilkka Niemelä
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universität Würzburg, Am Hubland, 97074, Würzburg, Germany

    Dietmar Seipel

  2. Institut für Informatik, CAU Kiel, Germany

    Michael Hanus

  3. Fraunhofer FIRST, Berlin

    Ulrich Geske

  4. IF Computer Japan, 5-28-2 Sendagi, Bunkyo-ku, 113-0022, Tokyo, Japan

    Oskar Bartenstein

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Keinänen, M., Niemelä, I. (2005). Solving Alternating Boolean Equation Systems in Answer Set Programming. In: Seipel, D., Hanus, M., Geske, U., Bartenstein, O. (eds) Applications of Declarative Programming and Knowledge Management. INAP WLP 2004 2004. Lecture Notes in Computer Science(), vol 3392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11415763_9

Download citation

  • DOI: https://doi.org/10.1007/11415763_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25560-4

  • Online ISBN: 978-3-540-32124-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation