443 search results - page 61 / 89 » SAT-Based Answer Set Programming |
ASP
2005
Springer
14 years 1 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...
JELIA
2010
Springer
13 years 6 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...
ASP
2003
Springer
14 years 1 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 ...
POPL
2008
ACM
14 years 8 months ago
2008
ACM
This paper presents a demand-driven, flow-insensitive analysis algorithm for answering may-alias queries. We formulate the computation of alias queries as a CFL-reachability probl...
FROCOS
2009
Springer
14 years 2 months ago
2009
Springer
The developments in information technology during the last decade have been rapidly changing the possibilities for data and knowledge access. To respect this, several declarative k...