Journal of Logic Programming
Equational problems anddisunification
Journal of Symbolic Computation
Handbook of theoretical computer science (vol. B)
Syntacticness, cycle-syntacticness, and shallow theories
Information and Computation
Increasing model building capabilities by constraint solving on terms with integer exponents
Journal of Symbolic Computation
Complexity of nonrecursive logic programs with complex values
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A decision procedure for term algebras with queues
ACM Transactions on Computational Logic (TOCL)
Efficient CTL* model checking for analysis of rainbow designs
Proceedings of the IFIP WG 10.5 International Conference on Correct Hardware Design and Verification Methods: Advances in Hardware Design and Verification
Integrating decision procedures for temporal verification
Integrating decision procedures for temporal verification
A decision procedure for term algebras with queues
ACM Transactions on Computational Logic (TOCL)
A collapse result for constraint queries over structures of small degree
Information Processing Letters
Definable relations and first-order query languages over strings
Journal of the ACM (JACM)
Decision procedures for term algebras with integer constraints
Information and Computation - Special issue: Combining logical systems
Theory and Practice of Logic Programming
Bounds on the automata size for Presburger arithmetic
ACM Transactions on Computational Logic (TOCL)
A New Proposal Of Quasi-Solved Form For Equality Constraint Solving
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 2008 ACM symposium on Applied computing
Theory of finite or infinite trees revisited
Theory and Practice of Logic Programming
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
A Full First-Order Constraint Solver for Decomposable Theories
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
From exponential to almost linear decomposability of finite or infinite trees
Proceedings of the 2009 ACM symposium on Applied Computing
A full first-order constraint solver for decomposable theories
Annals of Mathematics and Artificial Intelligence
Decision procedures for algebraic data types with abstractions
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Upper bounds for a theory of queues
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Equational constraint solving via a restricted form of universal quantification
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
The decidability of the first-order theory of knuth-bendix order
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Decidability of term algebras extending partial algebras
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
| Hi-index | 0.00 |
In software verification it is often required to prove statements about heterogeneous domains containing elements of various sorts, such as counters, stacks, lists, trees and queues. Any domain with counters, stacks, lists, and trees (but not queues) can be easily seen a special case of the term algebra, and hence a decision procedure for term algebras can be applied to decide the first-order theory of such a domain. We present a quantifier-elimination procedure for the first-order theory of term algebra extended with queues. The complete axiomatization and decidability of this theory can be immediately derived from the procedure.