6167 search results - page 274 / 1234 » Can Refinement be Automated |
223
click to vote
DLOG
2011
14 years 11 months ago
2011
We show that, although conjunctive queries over OWL 2 QL ontologies are reducible to database queries, no algorithm can construct such a reduction in polynomial time without changi...
217
click to vote
DLOG
2011
14 years 11 months ago
2011
We propose a method for controlling the quality of (semi-)automatically acquired axioms. We combine the manual inspection of axioms with automatic evaluation decisions and propose ...
212
click to vote
DLOG
2011
14 years 11 months ago
2011
We present an optimized query rewriting algorithm for OWL 2 QL that computes the rewriting set of a user query by avoiding unnecessary inferences and extended clause subsumption ch...
230
click to vote
DLOG
2011
14 years 11 months ago
2011
We show that deciding conjunctive query inseparability for OWL 2 QL ontologies is PSpace-hard and in ExpTime. We give polynomial-time (incomplete) algorithms and demonstrate by exp...
285
click to vote
LPNMR
2011
Springer
14 years 10 months ago
2011
Springer
We present an approach to integrating rules and ontologies on the basis of the first-order stable model semantics defined by Ferraris, Lee and Lifschitz. We show that a few exist...