Sciweavers

6167 search results - page 272 / 1234
» Can Refinement be Automated
Sort
View
DLOG
2008
15 years 9 months ago
Checking DL-Lite Modularity with QBF Solvers
We show how the reasoning tasks of checking various versions of conservativity for the description logic DL-Litebool can be reduced to satisfiability of quantified Boolean formulas...
Roman Kontchakov, Vladislav Ryzhikov, Frank Wolter...
184
Voted
DLOG
2004
15 years 8 months ago
From SHOQ(D) Toward E-connections
In this paper, we propose a tableau-based technique for reasoning with various distributed DL knowledge bases. This technique can be applied both to DDLs and to new and relevant s...
Bernardo Cuenca Grau, Bijan Parsia
DLOG
2004
15 years 8 months ago
Specifying the Disjoint Nature of Object Properties in DL
This paper proposes constructs that can be used to declaratively specify the disjoint nature of object properties or roles. These constructs may be a useful extension to the Descr...
Cartik R. Kothari, David J. Russomanno
DLOG
2006
15 years 8 months ago
Description logic reasoning using the PTTP approach
The goal of this paper is to present how the Prolog Technology Theorem Proving (PTTP) approach can be used for ABox-reasoning. This work presents an inference algorithm over the l...
Zsolt Nagy, Gergely Lukácsy, Péter S...
DLOG
2006
15 years 8 months ago
Static Knowledge Representation of Multi-Agent System's Specification by Description Logic
Modularity and rigor are two key elements for multi-agent technology. Hong Zhu's multi-agent system (MAS) development method provides proper language facilities supporting mo...
Haiyan Che, Jigui Sun