Theory decision by decomposition (Q1041591): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jsc.2008.10.008 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jsc.2008.10.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980250820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on rewrite-based satisfiability procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rewriting approach to satisfiability procedures. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting on Demand in SAT Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewrite-Based Decision Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewrite-Based Satisfiability Procedures for Recursive Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: ${\mathcal{T}}$ -Decision by Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Variable-inactivity and Polynomial Formula-Satisfiability Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using First-Order Theorem Provers in the Jahob Data Structure Verification System / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient theory combination via Boolean search / rank
 
Normal rank
Property / cites work
 
Property / cites work: M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5310200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Theorems with the Modification Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated model building / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient E-Matching for SMT Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering DPLL(T) + Saturation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-based Theory Combination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4809077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplify: a theorem prover for program checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular proof systems for partial functions with Evans equality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Quantified Verification Conditions Using Satisfiability Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision procedures for extensions of the theory of arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frontiers of Combining Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lazy abstraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Combinability of Rewriting-Based Satisfiability Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frontiers of Combining Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Decidability and Combinability Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: SMELS: Satisfiability Modulo Equality with Lazy Superposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplification by Cooperating Decision Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving SAT and SAT Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4345253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Light-Weight Theorem Proving to Debugging and Verifying Pointer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3506045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Deduction – CADE-20 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4809068 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JSC.2008.10.008 / rank
 
Normal rank

Latest revision as of 14:31, 10 December 2024

scientific article
Language Label Description Also known as
English
Theory decision by decomposition
scientific article

    Statements

    Theory decision by decomposition (English)
    0 references
    0 references
    0 references
    3 December 2009
    0 references
    satisfiability modulo theories: decision procedures
    0 references
    combination of theories
    0 references
    automated theorem proving: rewriting
    0 references
    superposition
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references