1193 search results - page 47 / 239 » A primer of simple theories |
LICS
2000
IEEE
15 years 4 months ago
2000
IEEE
We establish that the decidability of the first order theory of a class of finite structures ¢ is a simple and useful condition for guaranteeing that the expressive power of FO...
EACL
1989
ACL Anthology
15 years 1 months ago
1989
ACL Anthology
In this paper, we present a logic-based computational model for movement theory in Government and Binding Theory. For that purpose, we have designed a language called DISLOG. DISL...
ICPR
2004
IEEE
16 years 28 days ago
2004
IEEE
We introduce a trainable system that simultaneously filters and classifies low-level features into types specified by the user. The system operates over full colour images, and ou...
AIMS
2007
Springer
15 years 6 months ago
2007
Springer
Promise theory defines a method by which static service bindings are made in a network, but little work has been done on handling the dynamic case in which bindings must change ov...
FOSSACS
2004
Springer
15 years 5 months ago
2004
Springer
Labelled Markov processes (LMPs) are automata whose transitions are given by probability distributions. In this paper we present a ‘universal’ LMP as the spectrum of a commutat...