Sciweavers

5 search results - page 1 / 1
» Finding Maximally Satisfiable Terminologies for the Descript...
Sort
View
AAAI
2006
13 years 6 months ago
Finding Maximally Satisfiable Terminologies for the Description Logic ALC
For ontologies represented as Description Logic Tboxes, optimised DL reasoners are able to detect logical errors, but there is comparatively limited support for resolving such pro...
Thomas Andreas Meyer, Kevin Lee, Richard Booth, Je...
DLOG
2008
13 years 7 months ago
Distributed Resolution for ALC
The use of Description Logic as the basis for Semantic Web Languages has led to new requirements with respect to scalable and nonstandard reasoning. In this paper, we address the p...
Anne Schlicht, Heiner Stuckenschmidt
DLOG
2006
13 years 6 months ago
Model checking the basic modalities of CTL with Description Logic
Abstract. Model checking is a fully automated technique for determining whether the behaviour of a finite-state reactive system satisfies a temporal logic specification. Despite th...
Shoham Ben-David, Richard J. Trefler, Grant E. Wed...
IANDC
2008
122views more  IANDC 2008»
13 years 5 months ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza
TABLEAUX
2000
Springer
13 years 8 months ago
Benchmark Analysis with FaCT
FaCT (Fast Classification of Terminologies) is a Description Logic (DL) classifier that can also be used for modal logic satisfiability testing. The FaCT system includes two reason...
Ian Horrocks