Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/annotated-reasoning-Aq83Djfzb7
References (34)
-
J. Tenenberg (1988)
Abstraction in planning -
G. Robinson, L. Wos (1983)
Paramodulation and Theorem-Proving in First-Order Theories with Equality -
(1996)
Wolpers: Deduction in the Veriication Support Environment (VSE). Formal Methods Europe 96 -
Claus Hintermeier, C. Kirchner, H. Kirchner (1998)
Dynamically Typed Computations for Order-Sorted Equational PresentationsJ. Symb. Comput., 25
-
V. Subrahmanian (1994)
Amalgamating knowledge basesACM Trans. Database Syst., 19
-
W. Bibel, P. Schmitt (1998)
Automated deduction : a basis for applications -
D. Hutter (1997)
Coloring Terms to Control Equational ReasoningJournal of Automated Reasoning, 18
-
D. Hutter, M. Kohlhase (2000)
Managing Structural Information by Higher-Order Colored UnificationJournal of Automated Reasoning, 25
-
V.S. Subrahmaniam (1994)
Amalgamating knowledgeACM Trans. Database Syst., 19
-
Vincent Digricoli (1980)
First Experiments with Rue Automated Deduction -
Fausto Giunchiglia, T. Walsh (1992)
A Theory of AbstractionArtif. Intell., 57
-
Christoph Walther (1990)
Many-Sorted Inferences in Automated Theorem Proving -
A. Bundy, A. Stevens, F. Harmelen, Andrew Ireland, A. Smaill (1993)
Rippling: A Heuristic for Guiding Inductive ProofsArtif. Intell., 62
-
L. Bachmair, H. Ganzinger, C. Lynch, Wayne Snyder (1992)
Basic Paramodulation and Superposition -
D. Gabbay, J. Woods (2003)
Chapter 13 – Labelled Deductive Systems, 1
-
D. Basin, T. Walsh (1996)
A calculus for and termination of ripplingJournal of Automated Reasoning, 16
-
J. Quinlan, E. Hunt (1968)
A Formal Deductive Problem-Solving SystemJournal of the ACM (JACM), 15
-
E. Melis, Axel Schairer (1998)
Similarities and Reuse of Proofs in Formal Software Verification -
A. Deursen, P. Klint, F. Tip (1993)
Origin TrackingJ. Symb. Comput., 15
-
P. Robinson, J. Staples (1993)
Formalizing a Hierarchical Structure of Practical Mathematical ReasoningJ. Log. Comput., 3
-
R. Nieuwenhuis, A. Rubio (1992)
Theorem Proving with Ordering Constrained Clauses -
D. Plaisted (1980)
Abstraction Mappings in Mechanical Theorem Proving -
Claire Gardent, M. Kohlhase, K. Konrad (1999)
Higher-order colored unification : A linguistic application, 18
-
D.M. Gabbay (1996)
Labelled Deductive Systems -
F. Baader, T. Nipkow (1998)
Term rewriting and all that -
F.B. Fitch (1952)
Symbolic Logic -
T. Melham (1990)
Formalizing abstraction mechanisms for hardware verification in higher order logic -
D. Loveland (1999)
Automated Deduction: Looking AheadAI Mag., 20
-
(1988)
Schairer: Similarities and Reuse of Proofs in Formal Software Veriication 4 th European Workshop on Case Based Reasoning (EWCBR 98) -
S. Autexier, D. Hutter, H. Mantel, A. Schairer (1999)
Lecture Notes in Artificial Intelligence -
T. Kolbe, Christoph Walther (1994)
Reusing Proofs -
J.R. Hobbs (1985)
Proceedings of the Ninth International Joint Conference on Artificial Intelligence -
J. Tenenberg (1991)
Chapter 4 – Abstraction in Planning -
D. Basin, T. Walsh (1994)
A Calculus for Rippling
- Publisher
- Springer Journals
- Copyright
- Copyright © 2000 by Kluwer Academic Publishers
- Subject
- Computer Science; Computer Science, general; Artificial Intelligence (incl. Robotics); Mathematics, general; Complexity
- ISSN
- 1012-2443
- eISSN
- 1573-7470
- DOI
- 10.1023/A:1018980012242
- Publisher site
- See Article on Publisher Site
Abstract
The application of deduction in various domains resulted in a variety of different techniques to guide the proof search. Many of these techniques incorporate additional knowledge to restrict or select possible proof steps. As a consequence, usually the underlying calculus has to be modified to keep track of this information during the proof search. In this paper we present a general framework for maintaining additional strategic knowledge within a proof. We introduce a formal notion of annotations attached to the constituents of formulas and illustrate how a generic method of inheriting these annotations can be instantiated for various purposes.
Journal
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Oct 1, 2004