583 search results - page 73 / 117 » Preferences in Answer Set Programming |
168
click to vote
FQAS
2009
Springer
15 years 9 months ago
2009
Springer
This paper concerns the design of a workflow which permits to feed and query a data warehouse opened on the Web, driven by a domain ontology. This data warehouse has been built to...
173
click to vote
ASP
2005
Springer
15 years 10 months ago
2005
Springer
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
183
click to vote
JELIA
2010
Springer
15 years 3 months ago
2010
Springer
In previous work, the so-called Temporal Equilibrium Logic (TEL) was introduced. This formalism provides an extension of the Answer Set semantics for logic programs to arbirary the...
132
click to vote
GECCO
2003
Springer
15 years 10 months ago
2003
Springer
Many evolutionary computation search spaces require fitness assessment through the sampling of and generalization over a large set of possible cases as input. Such spaces seem par...
142
click to vote
ASP
2003
Springer
15 years 10 months ago
2003
Springer
In this paper we define the notion of a compatibility relation so as to have a common framework for three nonmonotonic reasoning systems: normal logic programming, extended logic ...