641 search results - page 2 / 129 » Embedding Finite Sets in a Logic Programming Language |
CORR
2011
Springer
13 years 1 months ago
2011
Springer
Nonmonotonic causal logic, introduced by Norman McCain and Hudson Turner, became a basis for the semantics of several expressive action languages. McCain’s embedding of definit...
ICLP
1994
Springer
13 years 10 months ago
1994
Springer
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...
CP
2006
Springer
13 years 10 months ago
2006
Springer
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarativ...
ICALP
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.
ICLP
2009
Springer
14 years 7 months ago
2009
Springer
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...