15 search results - page 2 / 3 » A Complete Theory of Deterministic Event Structures |
136
click to vote
LOGCOM
2002
15 years 1 months ago
2002
We present a logical approach to plan recognition that builds on Kautz's theory of keyhole plan recognition, defined as the problem of inferring descriptions of high-level pl...
135
click to vote
GECCO
2010
Springer
15 years 6 months ago
2010
Springer
The original mechanism by which evolutionary algorithms were to solve problems was to allow for the gradual discovery of sub-solutions to sub-problems, and the automated combinati...
135
Voted
ICCS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...
124
Voted
DLT
1993
15 years 3 months ago
1993
We concider an extened algebra of regular events (languages) with intersection besides the usual operations. This algebra has the structure of a distributive lattice with monotoni...
118
click to vote
ESSLLI
1999
Springer
15 years 6 months ago
1999
Springer
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...