Solving planning problems by partial deduction

Authors:
Helko Lehmann;Michael Leuschel
Affiliations:
Department of Electronics and Computer Science, University of Southampton, Southampton, UK;Department of Electronics and Computer Science, University of Southampton, Southampton, UK
Venue:
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Year:
2000

Citing 15
Cited 3

Planning for conjunctive goals

Artificial Intelligence
Extending SLD resolution to equational horn clauses using E-unification

Journal of Logic Programming
Unification theory

Journal of Symbolic Computation
Foundations of Equational Logic Programming

Foundations of Equational Logic Programming
A new deductive approach to planning

New Generation Computing
A type system for logic program

Journal of Logic Programming
Partial evaluation in logic programming

Journal of Logic Programming
Fast and precise regular approximations of logic programs

Proceedings of the eleventh international conference on Logic programming
Controlling generalization and polyvariance in partial deduction of normal logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Partial evaluation of functional logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Program specialisation and abstract interpretation reconciled

JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
From situation calculus to fluent calculus: state update axioms as a solution to the inferential frame problem

Artificial Intelligence
Using regular approximations for generalisation during partial evalution

PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Solving coverability problems of petri nets by partial deduction

Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Detecting Unsolvable Queries for Definite Logic Programs

PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming

Homeomorphic embedding for online termination of symbolic methods

The essence of computation
The Ecce and Logen partial evaluators and their web interfaces

Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Partial deduction for linear logic—the symbolic negotiation perspective

DALT'04 Proceedings of the Second international conference on Declarative Agent Languages and Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop an abstract partial deduction method capable of solving planning problems in the Fluent Calculus. To this end, we extend "classical" partial deduction to accommodate both, equational theories and regular type information. We show that our new method is actually complete for conjunctive planning problems in the propositional Fluent Calculus. Furthermore, we believe that our approach can also be used for more complex systems, e.g., in cases where completeness can not be guaranteed due to general undecidability.