A rewriting approach to satisfiability procedures

Authors:
Alessandro Armando;Silvio Ranise;Michaël Rusinowitch
Affiliations:
DIST--Università degli Studi di Genova, via all'Opera Pia 13, Genova 16145, Italy;DIST--Università degli Studi di Genova, via all'Opera Pia 13, Genova 16145, Italy and LORIA & INRIA-Lorraine, 615, rue du Jardin Botanique, BP 101, Villers les Nancy Cedex 54602, France;LORIA & INRIA-Lorraine, 615, rue du Jardin Botanique, BP 101, Villers les Nancy Cedex 54602, France
Venue:
Information and Computation - RTA 2001
Year:
2003

Citing 25
Cited 51

On word problems in equational theories

14th International Colloquium on Automata, languages and programming
Deciding Horn classes by hyperresolution

CSL '89 Proceedings of the third workshop on Computer science logic
Any ground associative-commutative theory has a finite canonical system

RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Theorem-proving with resolution and superposition

Journal of Symbolic Computation
On word problems in horn theories

Journal of Symbolic Computation
Rewrite systems

Handbook of theoretical computer science (vol. B)
Introduction to HOL: a theorem proving environment for higher order logic

Introduction to HOL: a theorem proving environment for higher order logic
Towards a foundation of completion procedures as semidecision procedures

Theoretical Computer Science
Proof lengths for equational completion

Information and Computation - special issue: symposium on theoretical aspects of computer software TACS '94
Fast Decision Procedures Based on Congruence Closure

Journal of the ACM (JACM)
Variations on the Common Subexpression Problem

Journal of the ACM (JACM)
Deciding Combinations of Theories

Journal of the ACM (JACM)
Automated complexity analysis based on ordered resolution

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Automatic Decidability

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Congruence Closure Modulo Associativity and Commutativity

FroCoS '00 Proceedings of the Third International Workshop on Frontiers of Combining Systems
Shostak's Congruence Closure as Completion

RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Automatic verification of Pipelined Microprocessor Control

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Decision Procedures Using Model Building Techniques

CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
PVS: A Prototype Verification System

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Abstract Congruence Closure and Specializations

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
System Abstract: E 0.61

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Completion Procedures as Semidecision Procedures

Proceedings of the 2nd International CTRS Workshop on Conditional and Typed Rewriting Systems
A Decision Procedure for an Extensional Theory of Arrays

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Simplification by cooperating decision procedures

Simplification by cooperating decision procedures

Soundness and completeness warnings in ESC/Java2

Proceedings of the 2006 conference on Specification and verification of component-based systems
Intelligent Systems and Formal Methods in Software Engineering

IEEE Intelligent Systems
Modular proof systems for partial functions with Evans equality

Information and Computation - Special issue: Combining logical systems
Rewrite-Based Satisfiability Procedures for Recursive Data Structures

Electronic Notes in Theoretical Computer Science (ENTCS)
Rewrite-Based Decision Procedures

Electronic Notes in Theoretical Computer Science (ENTCS)
Decision procedures for extensions of the theory of arrays

Annals of Mathematics and Artificial Intelligence
${\mathcal{T}}$-Decision by Decomposition

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Handling Polymorphism in Automated Deduction

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Automatic Decidability and Combinability Revisited

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions

FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
An SMT Approach to Bounded Reachability Analysis of Model Programs

FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
New results on rewrite-based satisfiability procedures

ACM Transactions on Computational Logic (TOCL)
SMELS: Satisfiability Modulo Equality with Lazy Superposition

ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
On Bounded Reachability of Programs with Set Comprehensions

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Deciding array formulas with frugal axiom instantiation

SMT '08/BPR '08 Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning
Satisfiability Procedures for Combination of Theories Sharing Integer Offsets

TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
On Deciding Satisfiability by DPLL($\Gamma+{\mathcal T}$) and Unsound Theorem Proving

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Combinable Extensions of Abelian Groups

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Locality Results for Certain Extensions of Theories with Bridging Functions

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
veriT: An Open, Trustable and Efficient SMT-Solver

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Theory decision by decomposition

Journal of Symbolic Computation
Combination of convex theories: Modularity, deduction completeness, and explanation

Journal of Symbolic Computation
A Schemata Calculus for Propositional Logic

TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Combining Non-stably Infinite, Non-first Order Theories

Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a unified model of search in theorem-proving: subgoal-reduction strategies

Journal of Symbolic Computation
Guiding the correction of parameterized specifications

IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Building extended canonizers by graph-based deduction

ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Data structures with arithmetic constraints: a non-disjoint combination

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
Automatic decidability and combinability

Information and Computation
A theory of skiplists with applications to the verification of concurrent datatypes

NFM'11 Proceedings of the Third international conference on NASA Formal methods
A declarative two-level framework to specify and verify workflow and authorization policies in service-oriented architectures

Service Oriented Computing and Applications
On Deciding Satisfiability by Theorem Proving with Speculative Inferences

Journal of Automated Reasoning
Modular termination and combinability for superposition modulo counter arithmetic

FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Deciding extensions of the theory of arrays by integrating decision procedures and instantiation strategies

JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Theory instantiation

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Automatic combinability of rewriting-based satisfiability procedures

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Nelson-Oppen, shostak and the extended canonizer: a family picture with a newborn

ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Decision procedures for the formal analysis of software

ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Decidability and undecidability results for nelson-oppen and rewrite-based decision procedures

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
On a rewriting approach to satisfiability procedures: extension, combination of theories and an experimental appraisal

FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
An Instantiation Scheme for Satisfiability Modulo Theories

Journal of Automated Reasoning
On superposition-based satisfiability procedures and their combination

ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Bounded model checking of software using SMT solvers instead of SAT solvers

SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Challenging SMT solvers to verify neural networks

AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
A calculus for generating ground explanations

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
How to translate efficiently extensions of temporal logics into alternating automata

ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
A rule-based framework for building superposition-based decision procedures

WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
Completeness and decidability results for first-order clauses with indices

CADE'13 Proceedings of the 24th international conference on Automated Deduction
SMELS: Satisfiability Modulo Equality with Lazy Superposition

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show how a well-known superposition-based inference system for first-order equational logic can be used almost directly for deciding satisfiability in various theories including lists, encryption, extensional arrays, extensional finite sets, and combinations of them. We also give a superposition-based decision procedure for homomorphism.