A prolog technology theorem prover: Implementation by an extended prolog compiler

@article{Stickel2004APT,
  title={A prolog technology theorem prover: Implementation by an extended prolog compiler},
  author={M. Stickel},
  journal={Journal of Automated Reasoning},
  year={2004},
  volume={4},
  pages={353-380}
}
  • M. Stickel
  • Published 2004
  • Mathematics, Computer Science
  • Journal of Automated Reasoning
A Prolog technology theorem prover (PTTP) is an extension of Prolog that is complete for the full first-order predicate calculus. It differs from Prolog in its use of unification with the occurs check for soundness, the model-elimination reduction rule that is added to Prolog inferences to make the inference system complete, and depth-first iterative-deepening search instead of unbounded depthfirst search to make the search strategy complete. A Prolog technology theorem prover has been… Expand
ERGO 6: A GENERIC PROOF ENGINE THAT USES PROLOG PROOF TECHNOLOGY
To support formal reasoning in mathematical and software engineering applications, it is desirable to have a generic prover that can be instantiated with a range of logics. This allows the prover toExpand
nanoCoP: Natural Non-clausal Theorem Proving
TLDR
Working entirely on the original structure of the input formula yields not only a speed up of the proof search, but the resulting non-clausal proofs are also shorter. Expand
SLWV-A Logic Programing Theorem Prover
The purpose of this work is to define a theorem prover that retains the procedural aspects of logic programing. The proof system we propose (SLWV1 resolution) is defined for a set of clauses in theExpand
A parallelism-oriented prover with a meta-predicate
  • M. Arai
  • Computer Science
  • 2004 2nd International IEEE Conference on 'Intelligent Systems'. Proceedings (IEEE Cat. No.04EX791)
  • 2004
TLDR
A system for parallel proofs that proves the inconsistency of formulas in the disjunctive-normal-forms and a feature of the system is that any set of clauses can be represented as one meta-rule by using the disJunctive- normal-form shows new approaches to the parallelism and the use of lemmas. Expand
Distributed Logic Programming with Oracles and Kappa
The recursive backtracking performed during the execution of a Prolog program can be interpreted as the traversal of a proof tree. An oracle is a sequence of clause indexes representing a path withinExpand
Restricting backtracking in connection calculi
TLDR
The results show that restricted backtracking is a successful technique when performing proof search in connection calculi and provides the basis for a refined connection calculus. Expand
The PIE Environment for First-Order-Based Proving, Interpolating and Eliminating
TLDR
The PIE system aims at providing an environment for creating complex applications of automated first-order theorem proving techniques, embedded in Prolog, and comes with a built-in default prover that can compute interpolants. Expand
Parallel Theorem Proving
  • M. Bonacina
  • Computer Science
  • Handbook of Parallel Constraint Reasoning
  • 2018
TLDR
This chapter tries to relate lessons learned from investigations of parallel theorem proving and parallel SAT-solving with novel advances in theorem proving, such as SGGS (Semantically-Guided Goal-Sensitive reasoning), a method that lifts the CDCL procedure for SAT to first-order logic. Expand
Search Space Pruning by Checking Dynamic Term Growth
Abs t rac t . In this paper we present a method to detect non-termlnating or falling queries based on analyzing the dynamic growth of terms. It overcomes restrictions known from approaches toExpand
Guiding linear deductions with semantics
TLDR
This research aimed to discover a method for incorporating semantic guidance into linear deduction systems, in particular model elimination based linear systems, and this has been achieved. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 62 REFERENCES
Nonclausal Logic Programming
TLDR
The inclusion of equivalence, negation, conditionals, functions, and equality in TABLOG enables the programmer to combine functional and relational programming in a single framework. Expand
Non-Horn clause logic programming without contrapositives
  • D. Plaisted
  • Computer Science
  • Journal of Automated Reasoning
  • 2004
TLDR
An extension of Prolog-style Horn clause logic programming to full first order logic has some advantages over other such extensions that have been proposed and the relation of these upper bounds to Savitch's theorem relating nondeterministic time to deterministic space is discussed. Expand
A Simplified Problem Reduction Format
  • D. Plaisted
  • Mathematics, Computer Science
  • Artif. Intell.
  • 1982
TLDR
Some new approaches to mechanical theorem proving in the first-order predicate calculus are presented based on a natural deduction system which can be used to show that a set of clauses is inconsistent. Expand
A Portable Environment for Research in Automated Reasoning
TLDR
The Interactive Theorem Prover is an interactive system providing convenient access to and control of the many inference mechanisms of Logic Machine Architecture, and LMA itself has been substantially enhanced since the last report on its status, particularly the addition of a tightly-coupled logic programming component. Expand
Automated theorem proving: mapping logic into AI
TLDR
The methodologies of ATP are explored, including the logics that underlie the theorem provers, and some of the mechanisms that utilize these logics are discussed, including term rewriting systems, mathematical induction, inductionless induction and even mixed integer programming. Expand
Near-Horn PROLOG
TLDR
An extension to Prolog that handles clause sets that are Horn and almost-Horn in a manner that emphasizes clarity, efficiency, and minimal deviation from standard prolog is proposed. Expand
A non-clausal theorem proving system
TLDR
A complete inference system, QUEST, for the first-order predicate calculus using expressions in prenex form is presented and comparison of this system with SL-resolution shows that clausal techniques can be transferred to prenexform and expected advantages do seem to appear. Expand
Logic Machine Architecture: Inference Mechanisms
TLDR
This paper includes the design principles and techniques used in layer 2, as well as two simple theorem provers which illustrate the services of layer 2 — one written in LISP and the other in Pascal. Expand
Ttle sharing of structure in theorem proving programs
TLDR
The concept of the value of an expression in a binding environment which is used to standardize clauses apart and share the structure of parents in representing the resolvent in resolution programs is introduced. Expand
Logic Machine Architecture: Kernel Funtions
TLDR
An attempt to abstract from the great diversity of approaches to automated deduction a core collection of operations which are common to all of them, and outline the architecture for a layered family of software tools to support the development of theorem-proving systems. Expand
...
1
2
3
4
5
...