3134 search results - page 1 / 627 » Computing full disjunctions |
PODS
2005
ACM
13 years 10 months ago
2005
ACM
The full disjunction is a variation of the join operator that maximally combines tuples from connected relations, while preserving all information in the relations. The full disju...
PODS
2003
ACM
14 years 5 months ago
2003
ACM
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
AGP
2003
IEEE
13 years 10 months ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
ADBIS
2007
Springer
13 years 8 months ago
2007
Springer
In this paper we present a new fixpoint-based approach to bottom-up state generation for stratifiable disjunctive deductive databases. To this end, a new consequence operator based...
PODS
1996
ACM
13 years 9 months ago
1996
ACM