Ordered Semantic Hyper-Linking

Authors:
David A. Plaisted;Yunshan Zhu
Affiliations:
Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, NC 27599-3175. e-mail: plaisted@cs.unc.edu;Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, NC 27599-3175. e-mail: zhu@cs.unc.edu
Venue:
Journal of Automated Reasoning
Year:
2000

Citing 34
Cited 23

Non-Horn problems

Journal of Automated Reasoning
Explicit representation of terms defined by counter examples

Journal of Automated Reasoning
Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Non-horn clause logic programming without contrapositives

Journal of Automated Reasoning
Rewrite systems

Handbook of theoretical computer science (vol. B)
Proving refutational completeness of theorem-proving strategies: the transfinite semantic tree method

Journal of the ACM (JACM)
A method for simultaneous search for refutations and models by equational constraint solving

Journal of Symbolic Computation
Use of replace rules in theorem proving

Methods of Logic in Computer Science
Empirical explorations of the geometry-theorem proving machine

Computers & thought
Basic paramodulation

Information and Computation
Increasing model building capabilities by constraint solving on terms with integer exponents

Journal of Symbolic Computation
The resolution calculus

The resolution calculus
Term rewriting and all that

Term rewriting and all that
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving

Journal of the ACM (JACM)
Automatic Theorem Proving With Renamable and Semantic Resolution

Journal of the ACM (JACM)
A Simplified Format for the Model Elimination Theorem-Proving Procedure

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
Automated Reasoning: Introduction and Applications

Automated Reasoning: Introduction and Applications
Solution of the Robbins Problem

Journal of Automated Reasoning
SATCHMO: A Theorem Prover Implemented in Prolog

Proceedings of the 9th International Conference on Automated Deduction
A Complete Semantic Back Chaining Proof System

Proceedings of the 10th International Conference on Automated Deduction
Semantically Guided First-Order Theorem Proving using Hyper-Linking

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
A Method for Building Models Automatically. Experiments with an Extension of OTTER

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Ordered Chaining for Total Orderings

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
The Search Efficiency of Theorem Proving Strategies

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Soft Typing for Ordered Resolution

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Non-Horn Magic Sets to Incorporate Top-down Inference into Bottom-up Theorem Proving

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Elimination of Equality via Transformation with Ordering Constraints

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Automated theorem proving: A logical basis (Fundamental studies in computer science)

Automated theorem proving: A logical basis (Fundamental studies in computer science)
Equational reasoning using AC constraints

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Extending semantic resolution via automated model building: applications

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

Ordered Semantic Hyper Tableaux

Journal of Automated Reasoning
Semantic Selection for Resolution in Clause Graphs

AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Emphasizing Human Techniques in Automated Geometry Theorem Proving: A Practical Realization

ADG '00 Revised Papers from the Third International Workshop on Automated Deduction in Geometry
A relevance restriction strategy for automated deduction

Artificial Intelligence
First-order logic Davis-Putnam-Logemann-Loveland procedure

Exploring artificial intelligence in the new millennium
Certifying cryptographic protocols by abstract model-checking and proof concretization

ACM SIGBED Review - Special issues on workshop on innovative techniques for certification of embedded systems
TPTP, CASC and the development of a semantically guided theorem prover

AI Communications - CASC
Visualizing SAT Instances and Runs of the DPLL Algorithm

Journal of Automated Reasoning
The model evolution calculus as a first-order DPLL method

Artificial Intelligence
Logical Engineering with Instance-Based Methods

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Proof Systems for Effectively Propositional Logic

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Instantiation-Based Automated Reasoning: From Theory to Practice

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Solving quantified verification conditions using satisfiability modulo theories

Annals of Mathematics and Artificial Intelligence
Towards a unified model of search in theorem-proving: subgoal-reduction strategies

Journal of Symbolic Computation
Instantiation of SMT problems modulo integers

AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Modular instantiation schemes

Information Processing Letters
A Combined Superposition and Model Evolution Calculus

Journal of Automated Reasoning
Theory instantiation

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
The space efficiency of OSHL

TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
The model evolution calculus with equality

CADE' 20 Proceedings of the 20th international conference on Automated Deduction
An Instantiation Scheme for Satisfiability Modulo Theories

Journal of Automated Reasoning
Model Evolution with equality - Revised and implemented

Journal of Symbolic Computation
Instantiation Schemes for Nested Theories

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.02

Visualization

Abstract

The ordered semantic hyper-linking strategy is complete for first-order logic and accepts a user-specified natural semantics that guides the search for a proof. Any semantics in which the meanings of the function and predicate symbols are computable on ground terms may be used. This instance-based strategy is efficient on near-propositional problems, is goal sensitive, and has an extension to equality and term rewriting. However, it sometimes has difficulty generating large terms. We compare this strategy with some others that use semantic information, and present a proof of soundness and completeness. We also give some theoretical results about the search efficiency of the strategy. Some examples illustrate the performance of the strategy.