Building small equality graphs for deciding equality logic with uninterpreted functions
From MaRDI portal
Publication:2490118
Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70) Decidability and field theory (12L05) Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Recommendations
- LATIN 2004: Theoretical Informatics
- BDD based procedures for a theory of equality with uninterpreted functions
- Finite instantiations in equivalence logic with uninterpreted functions
- Range allocation for equivalence logic
- Exploiting positive equality in a logic of equality with uninterpreted functions
Cites work
- A SAT based approach for solving formulas over Boolean and linear mathematical propositions
- An experimental evaluation of ground decision procedures
- BDD based procedures for a theory of equality with uninterpreted functions
- Boolean satisfiability with transitivity constraints
- CVC: A cooperating validity checker
- Deciding equality formulas by small domains instantiations
- EVC: A validity checker for the logic of equality with uninterpreted functions and memories, exploiting positive equality, and conservative transformations
- Exploiting positive equality in a logic of equality with uninterpreted functions
- Finite instantiations in equivalence logic with uninterpreted functions
- ICS: Integrated canonizer and solver
- Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions
- Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic
- Range allocation for equivalence logic
- Solvable cases of the decision problem
- The code validation tool (CVT). Automatic verification of a compilation process
- The small model property: How small can it be?
- The UCLID decision procedure
- Tools and Algorithms for the Construction and Analysis of Systems
Cited in
(12)- The small model property: How small can it be?
- BDD based procedures for a theory of equality with uninterpreted functions
- General lower bounds and improved algorithms for infinite-domain CSPs
- Reduced functional consistency of uninterpreted functions
- Range allocation for equivalence logic
- Finite instantiations in equivalence logic with uninterpreted functions
- EVC: A validity checker for the logic of equality with uninterpreted functions and memories, exploiting positive equality, and conservative transformations
- Deciding equality formulas by small domains instantiations
- Exploiting positive equality in a logic of equality with uninterpreted functions
- Tools and Algorithms for the Construction and Analysis of Systems
- Automated Technology for Verification and Analysis
- LATIN 2004: Theoretical Informatics
This page was built for publication: Building small equality graphs for deciding equality logic with uninterpreted functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2490118)