Abstract
In this paper we discuss the role of certain cyclic rules—and in particular their ressemblance to Frame Axioms—which show up in a backward proof procedure for Linear Connection Proofs (see [4]). Trying to avoid these cyclic rules in proof search leads to an improved search procedure of which we give the basic idea as well as the results of an experimental evaluation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
W. Bibel. A Deductive Solution for Plan Generation. New Generation Computing, 6:115–132, 1986.
B. Fronhöfer. The Action-as-Implication Paradigm: Formal Systems and Application. CSpress, München, 1996.
B. Fronhöfer. Cutting Connections in Linear Connection Proofs. Technical Report AR-96-01, Technische Universität München, 1996. available from ftp://ftp.informatik.tumuenchen.de/local/lehrstuhl/jessen/Automated-Reasoning/Reports/AR-96-01.ps.gz.
B. Fronhöfer. Situational Calculus, Linear Connection Proofs and STRIPS-like Planning: An Experimental Comparison. In P. Miglioli, U. Moscato, D. Mundici, and M. Ornaghi, editors, 5th Workshop on Theorem Proving with Analytic Tableaux and Related Methods, pages 193–209. Terrasini, Palermo, Springer, LNAI 1071, May 1996.
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fronhöfer, B. (1996). Cyclic rules in Linear Connection Proofs. In: Görz, G., Hölldobler, S. (eds) KI-96: Advances in Artificial Intelligence. KI 1996. Lecture Notes in Computer Science, vol 1137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61708-6_48
Download citation
DOI: https://doi.org/10.1007/3-540-61708-6_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61708-2
Online ISBN: 978-3-540-70669-4
eBook Packages: Springer Book Archive