Skip to main content
SpringerLink
Log in

Abductive Partial Order Planning with Dependent Fluents

  • Conference paper
  • First Online:
KI 2001: Advances in Artificial Intelligence (KI 2001)

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

Included in the following conference series:

Abstract

Our query planning application for system integration requires a backward partial-order planner able to deal with non-ground plans in the presence of state constraints. While many partial-order planners exist for the case of independent fluents, partial-order planning with dependent fluents is a significantly more complex problem, which we tackle in an abductive event calculus framework. We show that existing abductive procedures have non-minimality problems that are significant especially in our planning domain and propose an improved abductive procedure to alleviate these problems. We also describe a general transformation from an abductive framework to Constraint Handling Rules (CHRs), which can be used to obtain an efficient implementation.

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.

Reference

  1. Denecker M., Missiaen L., Bruynooghe M. Temporal reasoning with abductive event calculus, ECAI-92, 384–388.

    Google Scholar 

  2. Denecker M., DeSchreye D. SLDNFA: an abductive procedure for abductive logic programs, J.Logic Programming 34(2),111–167, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  3. Fruewirth T. Constraint Handling Rules, in Podelski A. (ed) Constraint Programming: Basic and Trends, LNCS 910, 90–107, 1995.

    Google Scholar 

  4. Kakas A., Michael A., Mourlas C. ACLP: a case for non-monotonic reasoning, Proc. NM’98.

    Google Scholar 

  5. Kowalski R., Toni F., Wetzel G. Executing suspended logic programs, Fundamenta Informaticae 34 (1998), 1–22.

    MathSciNet  Google Scholar 

  6. Lin F., Reiter R. State constraints revisited, JLC4(5), 655–678.

    Google Scholar 

  7. Shanahan M. An abductive event calculus planner, JLP44 (2000)

    Google Scholar 

  8. Kakas A., Kowalski R., Toni F. The role of abduction in logic programming, Handbook of logic in AI and LP 5, OUP1998, 235–324.

    Google Scholar 

  9. Kowalski R., Sadri F., Soper P. iIntegrity checking in deductive databases, VLDB’97.

    Google Scholar 

  10. Bylander T., Allemang D., Tanner M.C., Josephson J.R. The computational complexity of abduction, AIJ 49(1-3), pp. 25–60, 1991.

    MATH  MathSciNet  Google Scholar 

  11. Wetzel G. Using integrity constraints as deletion rules, Proc. DYNAMICS’97, 147–161, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AI Lab, National Institute for Research and Development in Informatics, 8-10 Averescu Blvd., Bucharest, Romania

    Liviu Badea & Doina Tilivea

Authors
  1. Liviu Badea
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Doina Tilivea
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. RWTH Aachen, Theoretical Computer Science, Ahornstrasse 55, 52074, Aachen, Germany

    Franz Baader

  2. Intelligent Systems Department, University of Leipzig, Computer Science Institute, Augustusplatz 10-11, 04109, Leipzig, Germany

    Gerhard Brewka

  3. Institute of Information Systems Knowledge-Based Systems Group, Vienna University of Technology, Favoritenstrasse 11, 1040, Wien, Austria

    Thomas Eiter

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Badea, L., Tilivea, D. (2001). Abductive Partial Order Planning with Dependent Fluents. In: Baader, F., Brewka, G., Eiter, T. (eds) KI 2001: Advances in Artificial Intelligence. KI 2001. Lecture Notes in Computer Science(), vol 2174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45422-5_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-45422-5_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42612-7

  • Online ISBN: 978-3-540-45422-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation