611 search results - page 18 / 123 » Index Sets of Computable Structures with Decidable Theories |
181
click to vote
AGP
1999
IEEE
15 years 10 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
155
click to vote
KI
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. In Distributed Problem-solving (DPS) systems a group of purposefully designed computational agents interact and co-ordinate their activities so as to jointly achieve a gl...
139
click to vote
CIE
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. We prove that the homomorphic quasiorder of finite k-labeled forests has undecidable elementary theory for k 3, in contrast to the known decidability result for k = 2. W...
169
click to vote
KRMED
2004
15 years 7 months ago
2004
The symbolic representation of the physical structure of living organisms needs an ontologically well-founded and logically sound approach so that formal reasoning can adequately ...
183
click to vote
CADE
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...