580 search results - page 70 / 116 » On the Foundations of Answer Set Programming |
114
click to vote
ER
2010
Springer
14 years 10 months ago
2010
Springer
Traditional information search in which queries are posed against a known and rigid schema over a structured database is shifting towards a Web scenario in which exposed schemas ar...
117
click to vote
ASP
2005
Springer
15 years 5 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...
114
click to vote
JELIA
2010
Springer
14 years 10 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
15 years 5 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 ...
183
click to vote
POPL
2008
ACM
16 years 5 days 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...