157 search results - page 20 / 32 » A Conjunctive Query Language for Description Logic Aboxes |
127
click to vote
FOIKS
2006
Springer
15 years 4 months ago
2006
Springer
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
132
click to vote
EDBT
2012
ACM
13 years 2 months ago
2012
ACM
In this paper we consider the problem of answering queries using views, with or without ontological constraints, which is important for data integration, query optimization, and d...
AUSAI
2008
Springer
15 years 2 months ago
2008
Springer
This paper introduces the controlled natural language PENG Light together with a language processor that is based on a bidirectional grammar. The language processor has the followi...
144
click to vote
AAAI
2007
15 years 2 months ago
2007
In probabilistic reasoning, the problems of existence and identity are important to many different queries; for example, the probability that something that fits some description...
120
click to vote
LPAR
2004
Springer
15 years 5 months ago
2004
Springer
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...