3047 search results - page 2 / 610 » On the Meaning of Logical Completeness |
DLOG
2010
13 years 5 months ago
2010
In this paper, we revisit the problem of definitorial completeness, i.e., whether a given general TBox T in a description logic (DL) L can be rewritten to an acyclic TBox T in L . ...
ICDT
1990
ACM
13 years 11 months ago
1990
ACM
Ordinary logical implication is not enough for answering queries in a logic database, since especially negative information is only implicitly represented in the database state. M...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
LPNMR
1990
Springer
13 years 11 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...