A relevance restriction strategy for automated deduction
Artificial Intelligence
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
On the Properties of Metamodeling in OWL1
Journal of Logic and Computation
The TPTP Problem Library and Associated Infrastructure
Journal of Automated Reasoning
Reasoning support for expressive ontology languages using a theorem prover
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Utility and feasibility of reasoning beyond decidability in semantic technologies
ICCS'11 Proceedings of the 19th international conference on Conceptual structures for discovering knowledge
PsyDis: Towards a diagnosis support system for psychological disorders
Expert Systems with Applications: An International Journal
The CADE-23 Automated Theorem Proving System Competition - CASC-23
AI Communications
Bringing relational databases into the Semantic Web: A survey
Semantic Web - On real-time and ubiquitous social semantics
| Hi-index | 0.00 |
OWL 2 has been standardized by the World Wide Web Consortium (W3C) as a family of ontology languages for the Semantic Web. The most expressive of these languages is OWL 2 Full, but to date no reasoner has been implemented for this language. Consistency and entailment checking are known to be undecidable for OWL 2 Full. We have translated a large fragment of the OWL 2 Full semantics into firstorder logic, and used automated theorem proving systems to do reasoning based on this theory. The results are promising, and indicate that this approach can be applied in practice for effective OWL reasoning, beyond the capabilities of current Semantic Web reasoners.