Instantiation-Based Automated Reasoning: From Theory to Practice

Authors:
Konstantin Korovin
Affiliations:
University of Manchester, UK
Venue:
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Year:
2009

Citing 21
Cited 6

Ordered Semantic Hyper-Linking

Journal of Automated Reasoning
Partial Instantiation Methods for Inference in First-Order Logic

Journal of Automated Reasoning
Automated Theorem Proving Proof and Model Generation with Disconnection Tableaux

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
The Disconnection Method - A Confluent Integration of Unification in the Analytic Framework

TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Integration of Equality Reasoning into the Disconnection Calculus

TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
DCTP 1.2 - System Abstract

TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A Superposition Decision Procedure for the Guarded Fragment with Equality

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
New Directions in Instantiation-Based Theorem Proving

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
A Resolution-Based Decision Procedure for $\boldsymbol{\mathcal{SHOIQ}}$

Journal of Automated Reasoning
Encodings of Bounded LTL Model Checking in Effectively Propositional Logic

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
(LIA) - Model Evolution with Linear Integer Arithmetic Constraints

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
The 4th IJCAR Automated Theorem Proving System Competition - CASC-J4

AI Communications
CVC3

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Z3: an efficient SMT solver

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Testing strong equivalence of datalog programs – implementation and examples

LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Theory instantiation

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Blocking and other enhancements for bottom-up model generation methods

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
The model evolution calculus with equality

CADE' 20 Proceedings of the 20th international conference on Automated Deduction

Labelled unit superposition calculi for instantiation-based reasoning

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
The 5th IJCAR automated theorem proving system competition - CASC-J5

AI Communications
Extending Sledgehammer with SMT solvers

CADE'11 Proceedings of the 23rd international conference on Automated deduction
A Combined Superposition and Model Evolution Calculus

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

Journal of Symbolic Computation
The 6th IJCAR automated theorem proving system competition --CASC-J6

AI Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Instantiation-based automated reasoning aims at combining the efficiency of propositional SAT and SMT technologies with the expressiveness of first-order logic. Propositional SAT and SMT solvers are probably the most successful reasoners applied to real-world problems, due to extremely efficient propositional methods and optimized implementations. However, the expressiveness of first-order logic is essential in many applications ranging from formal verification of software and hardware to knowledge representation and querying. Therefore, there is a growing demand to integrate efficient propositional and more generally ground reasoning modulo theories into first-order reasoning.