A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
A prolog technology theorem prover
[chapter]
1990
Lecture Notes in Computer Science
Preserved Fulltext
Respondents should be aware that notwithstanding any other provision of law, no person shall be subject to a penalty for failing to comply with a collection of information if it does not display a currently ...
TITLE AND SUBTITLE
A Prolog Technology Theorem Prover
5a. CONTRACT NUMBER
5b. GRANT NUMBER
5c. PROGRAM ELEMENT NUMBER
6. AUTHOR(S)
5d. PROJECT NUMBER
5e. TASK NUMBER
5f. ...
NAME OF
RESPONSIBLE PERSON
a. REPORT
unclassified
b. ABSTRACT
unclassified
c. THIS PAGE
unclassified
Standard Form 298 (Rev. 8-98) ...
doi:10.1007/3-540-52885-7_136
fatcat:bbgumofvafhifguyt52pfgfafi
A Prolog technology theorem prover
1984
New generation computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Respondents should be aware that notwithstanding any other provision of law, no person shall be subject to a penalty for failing to comply with a collection of information if it does not display a currently ...
TITLE AND SUBTITLE
A Prolog Technology Theorem Prover
5a. CONTRACT NUMBER
5b. GRANT NUMBER
5c. PROGRAM ELEMENT NUMBER
6. AUTHOR(S)
5d. PROJECT NUMBER
5e. TASK NUMBER
5f. ...
NAME OF
RESPONSIBLE PERSON
a. REPORT
unclassified
b. ABSTRACT
unclassified
c. THIS PAGE
unclassified
Standard Form 298 (Rev. 8-98) ...
doi:10.1007/bf03037328
fatcat:ebzoiqbvobaufei2sunxjure6a
A Prolog technology theorem prover: a new exposition and implementation in Prolog
1992
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
., A Prolog technology theorem prover: a new exposition and implementation in Prolog, Theoretical Computer Science 104 (1992) 109-128. ...
A Prolog technology theorem prover (P'ITP) is an extension of Prolog that is complete for the full first-order predicate calculus. ...
Acknowledgements I would like to thank Fernando Pereira and Mabry Tyson for their useful comments on the text of this paper and to thank Fernando for giving me feedback on the Prolog code in the technical ...
doi:10.1016/0304-3975(92)90168-f
fatcat:zwyh4kofa5hyjltlm6xkuo25tm
A Prolog technology theorem prover
[chapter]
9th International Conference on Automated Deduction
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Respondents should be aware that notwithstanding any other provision of law, no person shall be subject to a penalty for failing to comply with a collection of information if it does not display a currently ...
TITLE AND SUBTITLE
A Prolog Technology Theorem Prover
5a. CONTRACT NUMBER
5b. GRANT NUMBER
5c. PROGRAM ELEMENT NUMBER
6. AUTHOR(S)
5d. PROJECT NUMBER
5e. TASK NUMBER
5f. ...
NAME OF
RESPONSIBLE PERSON
a. REPORT
unclassified
b. ABSTRACT
unclassified
c. THIS PAGE
unclassified
Standard Form 298 (Rev. 8-98) ...
doi:10.1007/bfb0012881
dblp:conf/cade/Stickel88a
fatcat:nsmbwxndovdyhdbdzc5hmows6i
Ergo 6: A Generic Proof Engine that Uses Prolog Proof Technology
2002
LMS Journal of Computation and Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
A major theme of the paper is that Prolog implementation technology can be generalized to obtain efficient implementations of generic proof engines. ...
Ergo 6 is a generic interactive theorem prover, similar to Isabelle, but with better support for proving schematic theorems with user-defined constraints, and with a different approach to handling variable ...
This work was funded by the Software Verification Research Centre, a Special Research Centre of the Australian Research Council. ...
doi:10.1112/s1461157000000759
fatcat:4d4gbfxy55a4vo72mirypv34dy
Proof checking and logic programming
2015
Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming - PPDP '15
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In most many modern proof checkers and theorem provers, that programming language is a functional programming language, often a variant of ML. ...
Proof checking can help to reduce the size of the trusted base since we do not need to trust an entire theorem prover if we can check the proofs they produce by a trusted (and smaller) checker. ...
Proof theory as a framework If a modern theorem prover outputs a proof as a (persistent) document, that proof document is usually based on specific technology built into the prover. ...
doi:10.1145/2790449.2790510
dblp:conf/ppdp/Miller15
fatcat:deqb2aqdt5h5lanahxijfqlwlm
Proof checking and logic programming
2016
Formal Aspects of Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In most many modern proof checkers and theorem provers, that programming language is a functional programming language, often a variant of ML. ...
Proof checking can help to reduce the size of the trusted base since we do not need to trust an entire theorem prover if we can check the proofs they produce by a trusted (and smaller) checker. ...
Proof theory as a framework If a modern theorem prover outputs a proof as a (persistent) document, that proof document is usually based on specific technology built into the prover. ...
doi:10.1007/s00165-016-0393-z
fatcat:toytkltecrcfdpjevs4jfdbqbu
Page 5699 of Mathematical Reviews Vol. , Issue 93j
[page]
1993
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
.”
93j:68180 68T15 03B35
Stickel, Mark E. (1-SRI-Al)
A Prolog technology theorem prover: a new exposition and implementation in Prolog. ...
Summary: “A Prolog technology theorem prover (PTTP) is an ex- tension of Prolog that is complete for the full first-order predicate calculus. ...
Protein: A PROver with a Theory Extension INterface
[chapter]
1994
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
The idea of the PTTP implementation technique ("Prolog Technology Theorem Prover") [Sti88] is to view Prolog as an "almost complete" theorem prover, which has to be extended by only a few ingredients in ...
By this technique the WAM-technology and other benefits of optimizing Prolog compilers are accessible to theorem proving. ...
PROTEIN currently offers the following: for total theory reasoning the input clauses may contain a call to a Prolog-predicate. ...
doi:10.1007/3-540-58156-1_57
fatcat:wpnsodwck5eohicbkaabbd2nnq
Foundational Proof Certificates in First-Order Logic
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
That semantics is then performed by a (higher-order) logic program: successful performance means that a formal proof of a theorem has been found. ...
We describe how the λProlog programming language provides several features that help guarantee such a soundness claim. ...
The client of the checker is the programmer of a theorem prover who would like to export a proof for checking. ...
doi:10.1007/978-3-642-38574-2_11
fatcat:yjoo3itjwnh55lm7fkvarjsppq
leanCoP: lean connection-based theorem proving
2003
Journal of symbolic computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The Prolog program implements a theorem prover for classical first-order (clausal) logic which is based on the connection calculus. ...
It is sound and complete (provided that an arbitrarily large I is iteratively given), and demonstrates a comparatively strong performance. ...
This technique combines the advantages of "Prolog technology" theorem provers (like e.g. ...
doi:10.1016/s0747-7171(03)00037-3
fatcat:tzbrhxmcxng6vmkfkqxtl5sbbq
nanoCoP: Natural Non-clausal Theorem Proving
2017
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper presents a non-clausal automated theorem prover for classical first-order logic. It is based on a non-clausal connection calculus and implemented with a few lines of Prolog code. ...
Most efficient fully automated theorem provers implement proof search calculi that require the input formula to be in a clausal form, i.e. disjunctive or conjunctive normal form. ...
Acknowledgements The author would like to thank Wolfgang Bibel for his helpful comments on a preliminary version of this paper. ...
doi:10.24963/ijcai.2017/695
dblp:conf/ijcai/Otten17
fatcat:e7twk7ckbnhjvee46egwmol7km
Page 6588 of Mathematical Reviews Vol. , Issue 89M
[page]
1989
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
A Prolog technology theorem prover has been implemented by an extended Prolog-to-LISP compiler that supports these additional features. ...
Comer (Charleston, SC)
89m:03011 03B35 68TI5 68T25 Stickel, Mark E. (1-SRI-Al)
A Prolog technology theorem prover: implementation by an extended Prolog compiler.
J. Automat. ...
Automated theorem proving: mapping logic into AI
1986
Proceedings of the ACM SIGART international symposium on Methodologies for intelligent systems -
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
KEYWORDS: automated theorem proving, mechanisms for automated provers, PROLOG, slightly non-Horn clause set. I n t r o d u c t i o n . ...
We explore the methodologies of ATP, including the logics that underlie the theorem provers, and discuss some of the mechanisms that utilize these logics. ...
As previously mentioned, the technology of PROLOG is that of a linear input resolution theorem prover. ...
doi:10.1145/12808.12833
fatcat:badcsorb25gufhgobxumlws7me
Page 4507 of Mathematical Reviews Vol. , Issue 87h
[page]
1987
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “Although PROLOG is a programming language based on techniques from theorem proving, its use as a base for a theorem prover has not been explored until recently [M. E. ...
We demonstrate the use of the theorem prover for verifying PROLOG programs and proving properties of data types.” ...
« Previous
Showing results 1 — 15 out of 1,040 results