Skip to main content

Multivalued Action Languages with Constraints in CLP(FD)

  • Conference paper
Logic Programming (ICLP 2007)

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

Included in the following conference series:

Abstract

Action description languages, such as \(\mathcal{A}\) and \(\mathcal{B}\) [6], are expressive instruments introduced for formalizing planning domains and problems. The paper starts by proposing a methodology to encode an action language (with conditional effects and static causal laws), a slight variation of \(\cal B\), using Constraint Logic Programming over Finite Domains. The approach is then generalized to lift the use of constraints to the level of the action language itself. A prototype implementation has been developed, and the preliminary results are presented and discussed.

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 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. Apt, K.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)

    Google Scholar 

  2. Baral, C.: Knowledge representation, reasoning and declarative problem solving. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

  3. Baral, C., Son, T.C., Tuan, L.C.: A Transition Function based Characterization of Actions with Delayed and Continuous Effects. In: KRR, Morgan Kaufmann, San Francisco (2002)

    Google Scholar 

  4. Dovier, A., Formisano, A., Pontelli, E.: A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 67–82. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Dovier, A., Formisano, A., Pontelli, E.: An Empirical Study of CLP and ASP Solutions of Combinatorial Problems. J. of Experimental & Theoretical Artificial Intelligence (2007)

    Google Scholar 

  6. Gelfond, M., Lifschitz, V.: Action Languages. Elect. Trans. Artif. Intell. 2, 193–210 (1998)

    Google Scholar 

  7. Giunchiglia, E., Lierler, Y., Maratea, M.: SAT-Based Answer Set Programming. In: Proc. of AAAI 2004, AAAI/Mit Press, pp. 61–66 (2004)

    Google Scholar 

  8. Jonsson, A.K., Morris, P.H., Muscettola, N., Rajan, K., Smith, B.D.: Planning in Interplanetary Space: Theory and Practice. In: AIPS (2002)

    Google Scholar 

  9. Lee, J., Lifschitz, V.: Describing Additive Fluents in Action Language C+. IJCAI (2003)

    Google Scholar 

  10. Lopez, A., Bacchus, F.: Generalizing GraphPlan by Formulating Planning as a CSP. In: Proc. of IJCAI (2003)

    Google Scholar 

  11. Marriott, K., Stuckey, P.J.: Programming with Constraints. MIT Press, Cambridge (1998)

    MATH  Google Scholar 

  12. Phan, T., Son, T.C., Pontelli, E.: CPP: a Constraint Logic Programming based Planner with Preferences. In: LPNMR, Springer, Heidelberg (2007)

    Google Scholar 

  13. Phan, T., Son, T.C., Baral, C.: Planning with Sensing Actions, Incomplete Information, and Static Causal Laws using Logic Programming. TPLP (to appear)

    Google Scholar 

  14. Reiter, R.: Knowledge in Action: Logical Foundations for Describing and Implementing Dynamical Systems. MIT Press, Cambridge (2001)

    Google Scholar 

  15. Simons, P.: Extending and Implementing the Stable Model Semantics. Doctoral dissertation. Report 58, Helsinki University of Technology (2000)

    Google Scholar 

  16. Son, T.C., Baral, C., McIlraith, S.A.: Planning with different forms of domain-dependent control knowledge. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 226–239. Springer, Heidelberg (2001)

    Google Scholar 

  17. 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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Véronica Dahl Ilkka Niemelä

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dovier, A., Formisano, A., Pontelli, E. (2007). Multivalued Action Languages with Constraints in CLP(FD) . In: Dahl, V., Niemelä, I. (eds) Logic Programming. ICLP 2007. Lecture Notes in Computer Science, vol 4670. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74610-2_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74610-2_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74608-9

  • Online ISBN: 978-3-540-74610-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics