9166 search results - page 1747 / 1834 » A framework for comparing models of computation |
160
click to vote
JELIA
2004
Springer
15 years 11 months ago
2004
Springer
Logical formalisation of agent behaviour is desirable, not only in order to provide a clear semantics of agent-based systems, but also to provide the foundation for sophisticated r...
289
click to vote
AGP
2010
IEEE
15 years 11 months ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
161
click to vote
EUROCOLT
1999
Springer
15 years 10 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
140
Voted
MFPS
1989
15 years 10 months ago
1989
We define a simple collection of operations for creating and manipulating record structures, where records are intended as finite associations of values to labels. A second-order ...
180
click to vote
CC
2006
Springer
15 years 10 months ago
2006
Springer
The polyhedral model is known to be a powerful framework to reason about high level loop transformations. Recent developments in optimizing compilers broke some generally accepted ...