Skip to main content

Handling Implication and Universal Quantification Constraints in FLUX

  • Conference paper
Principles and Practice of Constraint Programming - CP 2005 (CP 2005)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3709))

Abstract

FLUX is a CLP-approach for programming agents that reason about actions under incomplete state knowledge. FLUX is based on the solution to the fundamental frame problem in the fluent calculus. The core is a set of Constraint Handling Rules for the constraints that are used to encode state knowledge. In order to allow for efficient constraint solving, the original expressiveness of state representations in FLUX has been carefully restricted. In this paper, we enhance the expressiveness by adding both implication and universal quantification constraints. We do so without losing the computational merits of FLUX. We present a set of Constraint Handling Rules for these new constraints and prove their correctness against the fluent calculus.

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

Access this chapter

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. McCarthy, J.: Programs with common sense. In: Proc. of the Symposium on the Mechanization of Thought Processes, London, vol. 1, pp. 77–84 (1958)

    Google Scholar 

  2. McCarthy, J.: Situations and Actions and Causal Laws. Stanford Artif. Intell. Project, Memo 2, Stanford University, CA (1963)

    Google Scholar 

  3. McCarthy, J., Hayes, P.J.: Some philosophical problems from the standpoint of artificial intelligence. Machine Intell. 4, 463–502 (1969)

    MATH  Google Scholar 

  4. Fikes, R.E., Nilsson, N.J.: STRIPS: A new approach to the application of theorem proving to problem solving. Artif. Intell. 2, 189–208 (1971)

    Article  MATH  Google Scholar 

  5. Reiter, R.: On knowledge-based programming with sensing in the situation calculus. ACM Transactions on Computational Logic 2, 433–457 (2001)

    Article  MathSciNet  Google Scholar 

  6. Shanahan, M., Witkowski, M.: High-level robot control through logic. In: Castelfranchi, C., Lespérance, Y. (eds.) ATAL 2000. LNCS (LNAI), vol. 1986, pp. 104–121. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Thielscher, M.: Pushing the envelope: programming reasoning agents. In: Baral, C. (ed.) AAAI Workshop on Cognitive Robotics, pp. 110–117. AAAI Press, Menlo Park (2002)

    Google Scholar 

  8. Thielscher, M.: FLUX: A logic programming method for reasoning agents. Theory and Practice of Logic Programming (2005), Available at www.fluxagent.org

  9. Frühwirth, T.: Theory and practice of constraint handling rules. Journal of Logic Programming 37, 95–138 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  10. Thielscher, M.: From situation calculus to fluent calculus: State update axioms as a solution to the inferential frame problem. Artif. Intell. 111, 277–299 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  11. Thielscher, M.: Reasoning about actions with CHRs and finite domain constraints. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol. 2401, pp. 70–84. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  12. Van Hentenryck, P.: Constraint Satisfaction in Logic Programming. MIT Press, Cambridge (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Thielscher, M. (2005). Handling Implication and Universal Quantification Constraints in FLUX. In: van Beek, P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564751_49

Download citation

  • DOI: https://doi.org/10.1007/11564751_49

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-32050-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics