3758 search results - page 14 / 752 » A Complete Subsumption Algorithm |
KI
2007
Springer
14 years 1 months ago
2007
Springer
Axiom pinpointing has been introduced in description logics (DLs) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base t...
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
KR
2000
Springer
13 years 11 months ago
2000
Springer
When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to a...
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract Description Logics (DLs) are a family of class (concept) based knowledge representation formalisms. They are characterised by the use of various constructors to build comp...
LPAR
1994
Springer
13 years 11 months ago
1994
Springer
The concept of anti-link is defined, and useful equivalence-preserving operations on propositional formulas based on anti-links are introduced. These operations eliminate a potent...