Sciweavers

7 search results - page 2 / 2
» Elimination of Quantifiers and Undecidability in Spatial Log...
Sort
View
CADE
2005
Springer
14 years 5 months ago
The Decidability of the First-Order Theory of Knuth-Bendix Order
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
Ting Zhang, Henny B. Sipma, Zohar Manna
CORR
2004
Springer
176views Education» more  CORR 2004»
13 years 5 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard