229 search results - page 35 / 46 » On Reductive Semantics of Aggregates in Answer Set Programmi... |
176
click to vote
SIGMOD
2006
ACM
15 years 11 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
100
click to vote
ICLP
2003
Springer
15 years 4 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...
213
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
AICOM
2006
14 years 11 months ago
2006
In this work we present a backjumping technique for Disjunctive Logic Programming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been p...
112
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...