Succinct ordering and aggregation constraints in algebraic array theories
From MaRDI portal
Cites work
- A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT
- An application of games to the completeness problem for formalized theories
- Array Folds Logic
- Automata, Languages and Programming
- Automated Deduction – CADE-20
- Carathéodory bounds for integer cones
- Cardinality constraints for arrays (decidability results and applications)
- Combining theories with shared set operations
- Computational Complexity
- Cosmological lower bound on the circuit complexity of a small problem in logic
- Dafny: an automatic program verifier for functional correctness
- Deciding Boolean algebra with Presburger arithmetic
- Decision Procedures for Automating Termination Proofs
- Decision procedures. An algorithmic point of view
- Efficient automated reasoning about sets and multisets with cardinality constraints
- Forward and backward application of symbolic tree transducers
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 545277 (Why is no real title available?)
- scientific article; zbMATH DE number 5194318 (Why is no real title available?)
- scientific article; zbMATH DE number 3248792 (Why is no real title available?)
- Linear Arithmetic with Stars
- Logics with aggregate operators
- Minimization of symbolic tree automata
- NP satisfiability for arrays as powers
- On algebraic array theories
- On direct products of theories
- On the complexity of integer programming
- Ordered sets in the calculus of data structures
- Refinement types for Haskell
- Sets with cardinality constraints in satisfiability modulo theories
- Simplification by Cooperating Decision Procedures
- Solving \(\mathrm{LIA}^\star\) using approximations
- Symbolic automata constraint solving
- Symbolic tree automata
- The computational complexity of logical theories
- The first order properties of products of algebraic systems
- The monadic second order theory of all countable ordinals
- Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
- Tree acceptors and some of their applications
- Tree Automata over Infinite Alphabets
- Variants and satisfiability in the infinitary unification wonderland
- Verification, Model Checking, and Abstract Interpretation
- Weak Second‐Order Arithmetic and Finite Automata
Cited in
(2)
This page was built for publication: Succinct ordering and aggregation constraints in algebraic array theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561348)
