D This paper introduces extended programs and extended goals for logic programming. A clause in an extended program can have an arbitrary first-order formula as its body. Similarly, an extended goalâ€¦ (More)

This paper continues the development of a foundation for deductive database systems begun in [6], [7], and [8]. The result of this paper is a simplification theorem for static integrity constraintâ€¦ (More)

Not all queries in relational calculus can be answered sensibly when disjunction, negation, and universal quantification are allowed. The class of relation calculus queries or formulas that haveâ€¦ (More)

We propose criteria that any rule for inferring negative information from disjunctive databases should satisfy, and examine existing rules from this viewpoint. We then present a new inference rule,â€¦ (More)

To support the reuse and combination of ontologies in Semantic Web applications, it is often necessary to obtain smaller ontologies from existing larger ontologies. In particular, applications mayâ€¦ (More)

OBJECTIVES
To examine, on empirical data, whether drinking patterns, in addition to overall alcohol consumption, contribute to differences in rates of alcohol related problems between populations.
â€¦ (More)

An interesting and difficult problem in distributed programming is that of detecting when a distributed computation has terminated. We may describe one form of this problem as follows. Suppose we areâ€¦ (More)