641 search results - page 38 / 129 » Embedding Finite Sets in a Logic Programming Language |
CP
2004
Springer
14 years 1 months ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
CLIMA
2006
13 years 9 months ago
2006
It is recognised that institutions are potentially powerful means for making agent interactions effective and efficient, but institutions will only really be useful when, as in oth...
LOGCOM
2010
13 years 6 months ago
2010
In this paper, we propose an extension of Answer Set Programming (ASP) to support declarative reasoning on consumption and production of resources. We call the proposed extension ...
MEMBRANE
2004
Springer
14 years 1 months ago
2004
Springer
LMNtal (pronounced “elemental”) is a simple language model based on graph rewriting that uses logical variables to represent links and membranes to represent hierarchies. The ...
ICLP
2003
Springer
14 years 1 months ago
2003
Springer
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...