New Directions in Instantiation-Based Theorem Proving

Authors:
Harald Ganzinger;Konstantin Korovin
Affiliations:
-;-
Venue:
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Year:
2003

Citing 0
Cited 32

The model evolution calculus as a first-order DPLL method

Artificial Intelligence
Using SMT solvers to verify high-integrity programs

Proceedings of the second workshop on Automated formal methods
The CADE-21 automated theorem proving system competition

AI Communications
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying

ACM Transactions on Computational Logic (TOCL)
Logical Engineering with Instance-Based Methods

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
iProver --- An Instantiation-Based Theorem Prover for First-Order Logic (System Description)

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Deciding Effectively Propositional Logic Using DPLL and Substitution Sets

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Proof Systems for Effectively Propositional Logic

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
SMELS: Satisfiability Modulo Equality with Lazy Superposition

ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
The 4th IJCAR Automated Theorem Proving System Competition - CASC-J4

AI Communications
Instantiation-Based Automated Reasoning: From Theory to Practice

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Grounding with bounds

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Towards a unified model of search in theorem-proving: subgoal-reduction strategies

Journal of Symbolic Computation
Deciding Effectively Propositional Logic Using DPLL and Substitution Sets

Journal of Automated Reasoning
Combining instance generation and resolution

FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
The 5th IJCAR automated theorem proving system competition - CASC-J5

AI Communications
Encoding industrial hardware verification problems into effectively propositional logic

Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
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
Comparing instance generation methods for automated reasoning

TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Equational constraint solving via a restricted form of universal quantification

FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
The model evolution calculus with equality

CADE' 20 Proceedings of the 20th international conference on Automated Deduction
iProver-Eq: an instantiation-based theorem prover with equality

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Model Evolution with equality - Revised and implemented

Journal of Symbolic Computation
Boolean formulas of simple conceptual graphs SGBF

GKR'11 Proceedings of the Second international conference on Graph Structures for Knowledge Representation and Reasoning
Instantiation Schemes for Nested Theories

ACM Transactions on Computational Logic (TOCL)
Quantifier instantiation techniques for finite model finding in SMT

CADE'13 Proceedings of the 24th international conference on Automated Deduction
InKreSAT: modal reasoning via incremental reduction to SAT

CADE'13 Proceedings of the 24th international conference on Automated Deduction
First-Order theorem proving and vampire

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
SMELS: Satisfiability Modulo Equality with Lazy Superposition

Journal of Automated Reasoning
The 6th IJCAR automated theorem proving system competition --CASC-J6

AI Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider instantiation-based theorem provingwhereby instances of clauses are generated by certaininferences, and where inconsistency is detected bypropositional tests. We give a model construction proofof completeness by which restrictive inference systemsas well as admissible simplification techniques can bejustified. Another contribution of the paper are novelinference systems that allow one to also employ decisionprocedures for first-order fragments more complex thanpropositional logic. The decision procedure provides for anapproximative consistency test, and the instance generationinference system is a means of successively refining theapproximation.