Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
The automation of syllogistic. II. optimization and complexity issues
Journal of Automated Reasoning
First-order logic and automated theorem proving (2nd ed.)
First-order logic and automated theorem proving (2nd ed.)
Foundations of real and abstract analysis
Foundations of real and abstract analysis
Set theory for computing: from decision procedures to declarative programming with sets
Set theory for computing: from decision procedures to declarative programming with sets
Proceedings of the 5th Conference on Automated Deduction
Proceedings of the 5th Conference on Automated Deduction
A 'Theory' Mechanism for a Proof-Verifier Based on First-Order Set Theory
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
A Fast Saturation Strategy for Set-Theoretic Tableaux
TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A New Fast Tableau-Based Decision Procedure for an Unquantified Fragment of Set Theory
Selected Papers from Automated Deduction in Classical and Non-Classical Logics
Decision Procedures for Some Fragments of Set Theory
Proceedings of the 5th Conference on Automated Deduction
Using Meta-Theoretic Reasoning to do Algebra
Proceedings of the 5th Conference on Automated Deduction
From Bisimulation to Simulation: Coarsest Partition Problems
Journal of Automated Reasoning
An efficient algorithm for computing bisimulation equivalence
Theoretical Computer Science
Theory-specific automated reasoning
A 25-year perspective on logic programming
Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
Discrete Applied Mathematics
Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets
Journal of Automated Reasoning
| Hi-index | 0.00 |
The Referee system (aka AetnaNova), accessible on the Web, ingests bodies of text which it either certifies as constituting a valid sequence of definitions and theorems, or rejects as defective. The functionality of this proof verifier and the key issues for its effective use are illustrated, in particular by a case-study referring to bisimulations, and through excerpts from a large-scale script which leads from the built-in rudiments of set theory to the formal foundations of mathematical analysis. (The latter scenario, although incomplete as yet, already comprises over 1000 verified proofs, definitions, and ‘theories'.) The paper also discusses enhancements to Referee which are in progress: a new inference mechanism, named proof-by-structure, whose addition should make proofs lighter and more readable; an interface to external provers; and an automatic proof optimizer (currently being tested), aimed at speeding up proof verification.