314 search results - page 29 / 63 » Compactness Properties for Stable Semantics of Logic Program... |
JELIA
2004
Springer
15 years 2 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...
AI
2006
Springer
14 years 9 months ago
2006
Springer
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
ICLP
1991
Springer
15 years 1 months ago
1991
Springer
Well Founded Semantics is adequate to capture nonmonotonic reasoning if we interpret the Well Founded model of a program P as a (possibly incomplete) view of the world. Thus the W...
LICS
2005
IEEE
15 years 3 months ago
2005
IEEE
Three-valued models, in which properties of a system are either true, false or unknown, have recently been advocated as a better representation for reactive program abstractions g...