Sciweavers

229 search results - page 30 / 46
» On Reductive Semantics of Aggregates in Answer Set Programmi...
Sort
View
CASCON
2004
108views Education» more  CASCON 2004»
15 years 1 months ago
Consistent query answering under inclusion dependencies
For several reasons a database may not satisfy certain integrity constraints (ICs), for example, when it is the result of integrating several independent data sources. However, mo...
Loreto Bravo, Leopoldo E. Bertossi
COMMA
2006
15 years 1 months ago
Semi-Stable Semantics
In this paper, we examine an argument-based semantics called semi-stable semantics. Semi-stable semantics is quite close to traditional stable semantics in the sense that every st...
Martin Caminada
ASP
2005
Springer
15 years 5 months ago
Possibilistic Stable Model Computing
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...
Pascal Nicolas, Claire Lefèvre
CORR
2004
Springer
124views Education» more  CORR 2004»
14 years 11 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini
ICALP
2003
Springer
15 years 5 months ago
On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces
We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, t...
Stefan Blom, Wan Fokkink, Sumit Nain