611 search results - page 6 / 123 » Index Sets of Computable Structures with Decidable Theories |
124
click to vote
FUIN
2010
14 years 11 months ago
2010
Abstract. Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phas...
155
Voted
FROCOS
2009
Springer
15 years 8 months ago
2009
Springer
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
COMSIS
2010
14 years 11 months ago
2010
Multi-Feature Index Tree (MFI-Tree), a new indexing structure, is proposed to index multiple high-dimensional features of video data for video retrieval through example. MFI-Tree e...
102
click to vote
CIE
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Let Fq be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, Fq[t], of one variable, in...
132
click to vote
CSL
2010
Springer
15 years 2 months ago
2010
Springer
By a Euclidean logic, we understand a formal language whose variables range over subsets of Euclidean space, of some fixed dimension, and whose non-logical primitives have fixed me...