Integrating linear arithmetic into superposition calculus

Authors:
Konstantin Korovin;Andrei Voronkov
Affiliations:
The University of Manchester;The University of Manchester
Venue:
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Year:
2007

Citing 8
Cited 25

Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
Normalized rewriting: an alternative to rewriting modulo a set of equations

Journal of Symbolic Computation
Term rewriting and all that

Term rewriting and all that
Superposition theorem proving for abelian groups represented as integer modules

Theoretical Computer Science - Special issue on rewriting techniques and applications
Cancellative abelian monoids and related structures in refutational theorem proving (part II)

Journal of Symbolic Computation
A Precedence-Based Total AC-Compatible Ordering

RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Superposition and Chaining for Totally Ordered Divisible Abelian Groups

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Superposition with completely built-in Abelian groups

Journal of Symbolic Computation

Engineering DPLL(T) + Saturation

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

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Finding Loop Invariants for Programs over Arrays Using a Theorem Prover

FASE '09 Proceedings of the 12th International Conference on Fundamental Approaches to Software Engineering: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Generalizing DPLL to Richer Logics

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Combinable Extensions of Abelian Groups

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Interpolation and Symbol Elimination

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Superposition modulo linear arithmetic SUP(LA)

FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
On theorem proving for program checking: historical perspective and recent developments

Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Instantiation of SMT problems modulo integers

AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Separation logic + superposition calculus = heap theorem prover

Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Model evolution with equality modulo built-in theories

CADE'11 Proceedings of the 23rd international conference on Automated deduction
On Deciding Satisfiability by Theorem Proving with Speculative Inferences

Journal of Automated Reasoning
Invariant and type inference for matrices

VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Linear quantifier elimination as an abstract decision procedure

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Automatic generation of invariants for circular derivations in SUP(LA)

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
E-Matching with free variables

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
The TPTP typed first-order form with arithmetic

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Hierarchic superposition with weak abstraction

CADE'13 Proceedings of the 24th international conference on Automated Deduction
TFF1: the TPTP typed first-order form with rank-1 polymorphism

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
Theorem proving in large formal mathematics as an emerging AI field

Automated Reasoning and Mathematics
SMELS: Satisfiability Modulo Equality with Lazy Superposition

Journal of Automated Reasoning
A Resolution Calculus for First-order Schemata

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a method of integrating linear rational arithmetic into superposition calculus for first-order logic. One of our main results is completeness of the resulting calculus under some finiteness assumptions.