A decision procedure for term algebras with queues

DOI10.1145/371316.371494zbMath1171.68557OpenAlexW2181289644MaRDI QIDQ3184508

Andrei Voronkov, Tatiana Rybina

Publication date: 21 October 2009

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/371316.371494

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Decidability of theories and sets of sentences (03B25) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (9)

Decomposable theories ⋮ Solving quantified linear arithmetic by counterexample-guided instantiation ⋮ Decision procedures for term algebras with integer constraints ⋮ An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints ⋮ A collapse result for constraint queries over structures of small degree ⋮ Induction in saturation-based proof search ⋮ A full first-order constraint solver for decomposable theories ⋮ From decomposable to residual theories ⋮ A Full First-Order Constraint Solver for Decomposable Theories

This page was built for publication: A decision procedure for term algebras with queues