Sciweavers

15 search results - page 2 / 3
» A Complete Theory of Deterministic Event Structures
Sort
View
150
Voted
LOGCOM
2002
142views more  LOGCOM 2002»
15 years 3 months ago
Two Logical Theories of Plan Recognition
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...
Wayne Wobcke
GECCO
2010
Springer
129views Optimization» more  GECCO 2010»
15 years 8 months ago
A probabilistic functional crossover operator for genetic programming
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...
Josh C. Bongard
ICCS
2007
Springer
15 years 9 months ago
Characterizing Implications of Injective Partial Orders
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...
José L. Balcázar, Gemma C. Garriga
DLT
1993
15 years 4 months ago
Rewriting Extended Regular Expressions
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...
Valentin M. Antimirov, Peter D. Mosses
131
Voted
ESSLLI
1999
Springer
15 years 7 months ago
Towards Discontinuous Grammar
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...
Matthias T. Kromann