Solving Planning Problems by Partial Deduction
- 2 July 2002
- book chapter
- Published by Springer Nature
- p. 451-468
- https://doi.org/10.1007/3-540-44404-1_29
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Decidability Results for the Propositional Fluent CalculusPublished by Springer Nature ,2000
- Solving coverability problems of petri nets by partial deductionPublished by Association for Computing Machinery (ACM) ,2000
- Conjunctive partial deduction: foundations, control, algorithms, and experimentsThe Journal of Logic Programming, 1999
- Partial evaluation of functional logic programsACM Transactions on Programming Languages and Systems, 1998
- Detecting unsolvable queries for definite logic programsPublished by Springer Nature ,1998
- Computing change and specificity with equational logic programsAnnals of Mathematics and Artificial Intelligence, 1995
- The integration of functions into logic programming: From theory to practiceThe Journal of Logic Programming, 1994
- A new deductive approach to planningNew Generation Computing, 1990
- Extending SLD resolution to equational horn clauses using E-unificationThe Journal of Logic Programming, 1989
- Parallel program schemataJournal of Computer and System Sciences, 1969