Deciding Boolean algebra with Presburger arithmetic (Q861705): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Solvable cases of the decision problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4406531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of logical theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computational Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic and \(p\)-recognizable sets of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to evaluate quantified Boolean formulae and its experimental evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2740887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof synthesis and reflection for linear arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming by Refinement, as Exemplified by the SETL Representation Sublanguage / rank
 
Normal rank
Property / cites work
 
Property / cites work: The first order properties of products of algebraic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of logical theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic basis for computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: MONA IMPLEMENTATION SECRETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of computation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Deduction – CADE-20 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4813414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Constraints for Sets with Cardinality Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negative Boolean constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplification by Cooperating Decision Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isabelle/HOL. A proof assistant for higher-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transition predicate abstraction and fair termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presburger arithmetic with bounded quantifier alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Databases and Information Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized finite automata theory with an application to a decision problem of second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining nonstably infinite theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: The anatomy of vampire. Implementing bottom-up procedures with code trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification: Theory and Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining sets with cardinals / rank
 
Normal rank

Latest revision as of 13:18, 25 June 2024

scientific article
Language Label Description Also known as
English
Deciding Boolean algebra with Presburger arithmetic
scientific article

    Statements

    Deciding Boolean algebra with Presburger arithmetic (English)
    0 references
    0 references
    0 references
    0 references
    30 January 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Boolean algebra
    0 references
    Presburger arithmetic
    0 references
    decision procedure
    0 references
    quantifier elimination
    0 references
    complexity
    0 references
    program verification
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references