Solving planning problems by partial deduction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1955, Issue , 2000, Pages 451-468

  Lehmann, Helko ^a   Leuschel, Michael ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS;

EQUATIONAL THEORY; FLUENT CALCULUS; PARTIAL DEDUCTION; PLANNING PROBLEM; TYPE INFORMATION; UNDECIDABILITY;

COMPUTER CIRCUITS;

EID: 84956858878     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44404-1_29     Document Type: Conference Paper

References (24)

1. M. Alpuente, M. Falaschi, and G. Vidal. Partial evaluation of functional logic programs. ACM Trans. Program. Lang. Syst., 20(4):768–844, 1998.
2. M. Bruynooghe, H. Vandecasteele, D. A. de Waal, and M. Denecker. Detecting unsolvable queries for definite logic programs. In C. Palamidessi, H. Glaser, and K. Meinke, editors, Proceedings of ALP/PLILP’98, LNCS 1490, pages 118–133. Springer, 1998.
3. D. Chapman. Planning for conjunctive goals. AIJ, 32(3):333–377, 1985.
4. D. De Schreye, R. Glück, J. Jørgensen, M. Leuschel, B. Martens, and M. H. Sørensen. Conjunctive partial deduction: Foundations, control, algorithms and experiments. J. Logic Program., 41(2 & 3):231–277, 1999.
5. J.P. Gallagher and D. A. de Waal. Fast and precise regular approximations of logic programs. In P. Van Hentenryck, editor, Proceedings of ICLP’94, pages 599–613. The MIT Press, 1994.
6. J. P. Gallagher and J. C. Peralta. Using regular approximations for generalisation durign partial evaluation. In Proceedings of PEPM’00, pages 44–51. ACM Press.
7. J. H. Gallier and S. Raatz. Extending SLD resolution to equational horn clauses using E-unification. J. Logic Program., 6(1-2):3–43, 1989.
8. M. Hanus. The integration of functions into logic programming. J. Logic Program., 19 & 20:583–628, May 1994.
9. S. Hölldobler. Foundations of Equational Logic Programming, LNAI 353. Springer, 1989.
10. S. Hölldobler and J. Schneeberger. A new deductive approach to planning. New Gen. Comput., 8:225–244, 1990.
11. S. Hölldobler and M. Thielscher. Computing change and specificity with equational logic programs. Annals of Mathematics and Artificial Intelligence, 14:99–133, 1995.
12. R. M. Karp and R. E. Miller. Parallel program schemata. Journal of Computer and System Sciences, 3:147–195, 1969.
13. H. Lehmann and M. Leuschel. Decidability results for the propositional fluent calculus. In J. Lloyd et al., editor, Proceedings of CL’2000, LNAI 1861, pages 762–776, London, UK, 2000. Springer.
14. M. Leuschel. Program specialisation and abstract interpretation reconciled. In Joxan Jaffar, editor, Proceedings of JICSLP’98, pages 220–234, Manchester, UK, 1998. MIT Press.
15. M. Leuschel and H. Lehmann. Coverability of reset Petri nets and other wellstructured transition systems by partial deduction. In J. Lloyd et al., editor, Proceedings of CL’2000, LNAI 1861, pages 101–115, London, UK, 2000. Springer.
16. M. Leuschel and H. Lehmann. Solving coverability problems of Petri nets by partial deduction. In Proceedings of PPDP’2000. ACM Press, 2000. To appear.
17. M. Leuschel, B. Martens, and D. De Schreye. Controlling generalisation and polyvariance in partial deduction of normal logic programs. ACM Trans. Program. Lang. Syst., 20(1):208–258, 1998.
18. J. W. Lloyd and J. C. Shepherdson. Partial evaluation in logic programming. J. Logic Program., 11(3&4):217–242, 1991.
19. R. Marlet. Vers une Formalisation de l’ Évaluation Partielle. PhD thesis, Université de Nice - Sophia Antipolis, 1994.
20. G. Plotkin. Building in equational theories. In B. Meltzer and D. Michie, editors, Machine Intelligence, number 7, pages 73–90, Edinburgh, Scotland, 1972. Edinburgh University Press.
21. J. H. Siekmann. Unification theory. Journal of Symbolic Computation, 7(3–4):207–274, 1989.
22. M. H. Sørensen and R. Glück. An algorithm of generalization in positive supercompilation. In J. Lloyd, editor, Proceedings of ILPS’95, pages 465–479, Portland, USA, 1995. MIT Press.
23. M. Thielscher. From Situation Calculus to Fluent Calculus: State update axioms as a solution to the inferential frame problem. AIJ, 111(1–2):277–299, 1999.
24. E. Yardeni and E. Shapiro. A type system for logic programs. J. Logic Program., 10(2):125–154, 1990.