research-article

A new deductive approach to planning

Authors:

Steffen Hölldobler,

Josef SchneebergerAuthors Info & Claims

Volume 8, Issue 3

Pages 225 - 244

https://doi.org/10.1007/BF03037518

Published: 01 October 1990 Publication History

Abstract

We introduce a new deductive approach to planning which is based on Horn clauses. Plans as well as situations are represented as terms and, thus, are first-class objects. We do neither need frame axioms nor state-literals. The only rule of inference is the SLDE-resolution rule, i.e. SLD-resolution, where the traditional unification algorithm has been replaced by anE-unification procedure. We exemplify the properties of our method such as forward and backward reasoning, plan checking, and the integration of general theories. Finally, we present the calculus and show that it is sound and complete.

References

[1]

Lifschitz, V., “On the Semantics of STRIPS,” inProceedings of the Workshop on Reasoning about Actions and Plans (M. P. Georgeff, and A. L. Lansky, eds.), Morgan Kaufmann Publishers, Los Altos, pp. 1–8, 1986.

[2]

Chapman, D., “Planning for Conjunctive Goals,”Artificial Intelligence, Vol. 32, No. 3, pp. 333–377, 1987.

Digital Library

[3]

Hertzberg, J. and Horz, A., “Towards a theory of conflict detection and resolution in nonlinear plans,” inInternational Joint Conference on Artificial Intelligence, 1989.

[4]

Green, C., “Application of theorem proving to problem solving,” inInternational Joint Conference on Artificial Intelligence, Morgan Kaufmann Publishers, Los Altos, CA, pp. 219–239, 1969.

[5]

McCarthy, J. and Hayes, P., “Some Philosophical Problems from the Standpoint of Artificial Intelligence,”Machine Intelligence, Vol. 4 (B. Meltzer, D. Michie, eds.), Edinburgh University Press, Edinburgh, pp. 463–502, 1969.

[6]

Kowalski, R.,Logic for Problem Solving, North-Holland, New York, Amsterdam, Oxford, 1979.

[7]

Bibel, W., “A deductive solution for plan generation,”New Generation Computing, Vol. 4, pp. 115–132, 1986.

Digital Library

[8]

Fronhöfer, B., “Linearity and Plan Generation,”New Generation Computing, Vol. 5, pp. 213–225, 1987.

Digital Library

[9]

Bibel, W., del Cerro, L. F., Fronhöfer, B., and Herzig, A., “Plan Generation by Linear Proofs: on Semantics,” inProceedings of the German Workshop on Artificial Intelligence, Springer-Verlag, 1989.

[10]

Waldinger, R., “Achieving Several Goals Simultaneously,”Machine Intelligence, Vol. 8, Elsevier Publishing Company, 1977.

[11]

Sheperdson, J. C., “Negation as Failure: A Comparison of Clark’s Complete Data Base and Reiter’s Closed World Assumption,”Journal of Logic Programming, Vol. 1, No. 1, pp. 51–79, 1984.

[12]

Gallier, J. H. and Raatz, S., “Extending SLD-Resolution to Equational Horn Clauses Using E-Unification,”Journal of Logic Programming, Vol. 6, pp. 3–44, 1989.

Digital Library

[13]

Hölldobler, S.,Foundations of Equational Logic Programming, Vol. 353 LNCS, Springer-Verlag, 1989.

[14]

Siekmann, J., “Unification Theory,” inProceedings of the European Conference on Artificial Intelligence, pp. 365–400, 1986.

[15]

Lloyd, J. W.,Foundations of Logic Programming, Springer-Verlag, 1984.

[16]

Sussman, G. J.,A Computer Model of Skill Acquisition, Elsevier Publishing Company, 1975.

[17]

Reiter, R., “On closed world data bases,” inProceedings of the Workshop on Logic and Databases (N. Gallaire, ed.), 1977.

[18]

Jaffar, J., Lassez, J.-L., and Maher, M. J., “A Theory of Complete Logic Programs with Equality,” inProceedings of the International Conference on Fifth Generation Computer Systems, pp. 175–184, 1984.

[19]

Jaffar, J., Lassez, J.-L., and Maher, M. J., “A Logic Programming Language Scheme,”Logic Programming (DeGroot, Lindstrom, eds.), Prentice Hall, pp. 441–467, 1986.

[20]

Warren, D. H. D., “An Abstract Prolog Instruction Set,”Technical Note 309, Stanford Research Institute (SRI), 1983.

[21]

Bürckert, H. J., “Lazy Theory Unification in Prolog: An Extension of the Warren abstract machine,” inProceedings of the German Workshop on Artificial Intelligence, pp. 277–288, 1986.

[22]

Swartout, W. (ed.), “DARPA Santa Cruz Workshop on Planning,”AI Magazine, pp. 115–130, Summer, 1988.

[23]

Kowalski, R., “Logic Programming,” inProceedings of the World Computer Congress of the IFIP, pp. 133–145, 1983.

[24]

Kowalski, R., “Directions of Logic Programming,” inProceedings of the Symposium on Logic Programming, Computer Society, Press of the IEEE, Washington, pp. 2–7, 1985.

[25]

Buntine, W. L. and Bürckert, H.-J., “On Solving Equations and Disequations,”Technical Report, FB Informatik, Universität Kaiserslautern, 1989.

Cited By

Zieliński B(2023)Explanatory Denotational Semantics for Complex Event PatternsFormal Aspects of Computing10.1145/360848635:4(1-37)Online publication date: 10-Jul-2023
https://dl.acm.org/doi/10.1145/3608486
Eppe MBhatt M(2015)A history based approximate epistemic action theory for efficient postdictive reasoningJournal of Applied Logic10.1016/j.jal.2015.08.00113:4(720-769)Online publication date: 1-Dec-2015
https://dl.acm.org/doi/10.1016/j.jal.2015.08.001
Basseda RKifer M(2015)State Space Planning Using Transaction LogicProceedings of the 17th International Symposium on Practical Aspects of Declarative Languages - Volume 913110.1007/978-3-319-19686-2_2(17-33)Online publication date: 18-Jun-2015
https://dl.acm.org/doi/10.1007/978-3-319-19686-2_2
Show More Cited By

Recommendations

Extensional Higher-Order Paramodulation in Leo-III
Abstract
Leo-III is an automated theorem prover for extensional type theory with Henkin semantics and choice. Reasoning with primitive equality is enabled by adapting paramodulation-based proof search to higher-order logic. The prover may cooperate with ...
A new approach to hybrid probabilistic logic programs

This paper presents a novel revision of the framework of Hybrid Probabilistic Logic Programming, along with a complete semantics characterization, to enable the encoding of and reasoning about real-world applications. The language of Hybrid ...
Mixed integer programming methods for computing nonmonotonic deductive databases

Though the declarative semantics of both explicit and nonmonotonic negation in logic programs has been studied extensively, relatively little work has been done on computation and implementation of these semantics. In this paper, we study three ...

Comments

Information & Contributors

Information

Published In

cover image New Generation Computing

New Generation Computing Volume 8, Issue 3

Oct 1990

90 pages

ISSN:0288-3635

Issue’s Table of Contents

Copyright © 1990 Ohmsha, Ltd. and Springer.

Publisher

Ohmsha

Japan

Publication History

Published: 01 October 1990

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

34
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zieliński B(2023)Explanatory Denotational Semantics for Complex Event PatternsFormal Aspects of Computing10.1145/360848635:4(1-37)Online publication date: 10-Jul-2023
Eppe MBhatt M(2015)A history based approximate epistemic action theory for efficient postdictive reasoningJournal of Applied Logic10.1016/j.jal.2015.08.00113:4(720-769)Online publication date: 1-Dec-2015
Basseda RKifer M(2015)State Space Planning Using Transaction LogicProceedings of the 17th International Symposium on Practical Aspects of Declarative Languages - Volume 913110.1007/978-3-319-19686-2_2(17-33)Online publication date: 18-Jun-2015
Mueller E(2014)Commonsense ReasoningundefinedOnline publication date: 11-Nov-2014
Lakemeyer GLevesque H(2011)A semantic characterization of a useful fragment of the situation calculus with knowledgeArtificial Intelligence10.1016/j.artint.2010.04.005175:1(142-164)Online publication date: 1-Jan-2011
Kahramanoğulları O(2009)On linear logic planning and concurrencyInformation and Computation10.1016/j.ic.2009.02.008207:11(1229-1258)Online publication date: 1-Nov-2009
Bosse TJonker CTreur J(2007)SIMULATION AND ANALYSIS OF CONTROLLED MULTI-REPRESENTATIONAL REASONING PROCESSESApplied Artificial Intelligence10.1080/0883951070152722621:10(973-1018)Online publication date: 1-Nov-2007
Jonker CTreur JWijngaards W(2007)Specification, analysis and simulation of the dynamics within an organisationApplied Intelligence10.1007/s10489-006-0024-027:2(131-152)Online publication date: 1-Oct-2007
Skvortsova O(2007)θ-Subsumption Based on Object ContextInductive Logic Programming10.1007/978-3-540-73847-3_36(394-408)Online publication date: 1-Mar-2007
Hölldobler SKarabaev ESkvortsova O(2006)FLUCAPJournal of Artificial Intelligence Research10.5555/1622572.162258427:1(419-439)Online publication date: 1-Dec-2006
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents