24 search results - page 1 / 5 » Disjunctive Bottom Set and Its Computation |
FLAIRS
2007
13 years 7 months ago
2007
ICLP
2003
Springer
13 years 10 months ago
2003
Springer
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...
JAIR
2000
13 years 4 months ago
2000
We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled tempo...
ICLP
1994
Springer
13 years 9 months ago
1994
Springer
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
PODS
2003
ACM
14 years 5 months ago
2003
ACM
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...