109 search results - page 20 / 22 » Exploiting Conjunctive Queries in Description Logic Programs |
DLOG
2010
13 years 3 months ago
2010
Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emer...
DIMACS
1996
13 years 6 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
PADL
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. In this paper, we present our initial design and implementation of a declarative network verifier (DNV). DNV utilizes theorem proving, a well established verification tec...
SWAP
2007
13 years 6 months ago
2007
Abstract. A nearest neighbor search procedure is presented, for retrieving resources in knowledge bases expressed in OWL. The procedure exploits a semidistance for annotated resour...
DBPL
1993
Springer
13 years 9 months ago
1993
Springer
A frequent dilemma in the design of a database programming language is the choice between a language with a rich set of tailored notations for schema definitions, query expression...