Mathematical logic formalizes the process of mathematical reasoning. For centuries, it has been a dream of mathematicians to do mathematical reasoning mechanically. In the TPTP library, one finds thousands of problems from various domains of mathematics such as group theory, number theory, set theory, etc. Many of these problems can now be solved with state of the art automated theorem provers. Theorem proving also has applications in artificial intelligence and formal verification. As a formal method, theorem proving has been used to verify the correctness of various hardware and software designs. In this thesis, we propose a novel first-order theorem proving strategy-- ordered semantic hyper linking (OSHL). OSHL is an instance-based theorem proving strategy. It proves first-order unsatisfiability by generating instances of first-order clauses and proving the set of instances to be propositionally unsatisfiable. OSHL can use semantics, i.e. domain information, to guide its search. OSHL allows a general form of semantics which is represented as a ground decision procedure on Herbrand atoms. Term rewriting and narrowing are used in OSHL to handle equations. Theorem prover OSHL represents a novel combination of efficient propositional decision procedures, semantic guidance and term rewriting. We apply OSHL to planning problems. We analyze the complexity of ordered semantic hyper linking using a novel concept of theorem proving complexity measure. We compare the complexity with those of common theorem proving strategies. We show that OSHL is both experimentally and asymptotically efficient. iv
|
1397
|
STRIPS: A new approach in the application of theorem proving to problem solving
– Fikes, Nilsson
- 1971
|
|
1224
|
Some philosophical problems from the standpoint of arti cial intelligence
– McCarthy, Hayes
- 1969
|
|
1177
|
A logic for default reasoning
– Reiter
- 1979
|
|
778
|
A computing procedure for quantification theory
– Davis, Putnam
- 1960
|
|
738
|
A machine-oriented logic based on the resolution principle
– Robinson
- 1965
|
|
722
|
Rewrite systems
– Dershowitz, Jouannaud
- 1990
|
|
579
|
Term rewriting systems
– Klop
- 1992
|
|
523
|
The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression
– Reiter
- 1991
|
|
418
|
Simple word problems in universal algebras
– Knuth, Bendix
- 1970
|
|
414
|
Termination of rewriting
– Dershowitz
- 1987
|
|
340
|
First-Order Logic and Automated Theorem Proving (2 nd ed
– Fitting
- 1996
|
|
249
|
A temporal logic for reasoning about processes and plans
– McDermott
- 1982
|
|
247
|
The relative efficiency of propositional proof systems
– Cook, Reckhow
- 1979
|
|
238
|
Symbolic Logic and Mechanical Theorem Proving
– Chang, Lee
- 1973
|
|
238
|
ADL: Exploring the middle ground between STRIPS and the situation calculus
– Pednault
- 1989
|
|
230
|
The intractability of resolution
– Haken
- 1985
|
|
204
|
Automated Theorem Proving: A Logical Basis
– Loveland
- 1978
|
|
200
|
Application of theorem proving to problem solving
– Green
- 1969
|
|
162
|
Logical Foundations of Artificial Intelligence
– Genesereth, Nilsson
- 1987
|
|
138
|
Monotonic Solution of the Frame Problem in the Situation Calculus: an Efficient Method for Worlds with Fully Specified Actions
– Schubert
- 1989
|
|
131
|
On the semantics of strips
– Lifschitz
- 1986
|
|
127
|
Encoding plans in propositional logic
– Kautz, McAllester, et al.
- 1996
|
|
126
|
On the structure of abstract algebras
– Birkhoff
- 1935
|
|
114
|
Complexity Results for Planning
– Bylander
- 1991
|
|
114
|
examples for resolution
– Hard
- 1987
|
|
109
|
Complete Sets of Reductions for Some Equational Theories
– PETERSON, STICKEL
- 1981
|
|
106
|
Completion without failure
– Bachmair, Dershowitz, et al.
- 1989
|
|
100
|
The TPTP problem library
– Sutcliffe, Suttner, et al.
- 1994
|
|
99
|
Solution of the Robbins problem
– McCune
- 1997
|
|
96
|
A.: An Empirical Study of Greedy Local Search for Satisfiability Testing
– Selman, Kautz
- 1993
|
|
68
|
A unification algorithm for associative-commutative functions
– Stickel
- 1981
|
|
59
|
Automated Reasoning: Introduction and Applications
– Wos, Overbeek, et al.
- 1984
|
|
58
|
Automated Reasoning: 33 Basic Research Problems
– Wos
- 1988
|
|
49
|
UCPOP: A sound, complete, partial-order planner for adl
– Penberthy, Weld
- 1992
|
|
48
|
Termination orderings for associativecommutative rewriting systems
– Bachmair, Plaisted
- 1985
|
|
42
|
Equational reasoning and term rewriting systems
– Plaisted
- 1993
|
|
40
|
Eliminating Duplicates with the Hyper-Linking Strategy
– Lee, Plaisted
- 1992
|
|
35
|
Implementing the Davis-Putnam algorithm by tries
– Zhang, Stickel
- 1994
|
|
31
|
ADL and the state-transition model of action
– Pednault
- 1994
|
|
30
|
Semantically guided first-order theorem proving using hyper-linking
– Chu, Plaisted
- 1994
|
|
30
|
Automatic theorem proving with renamable and semantic resolution
– Slagle
- 1967
|
|
21
|
The search efficiency of theorem proving strategies
– Plaisted
- 1994
|
|
18
|
A new method for proving termination of ac-rewrite systems
– Kapur, Sivakumar, et al.
- 1990
|
|
16
|
Ordered Semantic Hyper Linking
– Plaisted, Zhu
- 1997
|
|
14
|
1960], `A proof method for quantification theory
– Gilmore
|
|
14
|
A Case Study of Theorem Proving by the Knuth-Bendix Method: Discovering that x = x implies Ring Commutativity
– Stickel
- 1984
|
|
13
|
Relative Complexities of First-Order Calculi
– Eder
- 1992
|
|
13
|
Hierarchical Deduction
– Wang, Bledsoe
- 1987
|
|
11
|
Empirical explorations of the geometry theorem proving machine
– Gelernter, Hansen, et al.
- 1963
|
|
10
|
Proof lengths for equational completion
– Plaisted, Sattler-Klein
- 1996
|
|
