Sciweavers

482 search results - page 64 / 97
» Expressive probabilistic description logics
Sort
View
AAAI
2010
13 years 9 months ago
Soundness Preserving Approximation for TBox Reasoning
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractab...
Yuan Ren, Jeff Z. Pan, Yuting Zhao
DLOG
2006
13 years 9 months ago
Extending the SHOIQ(D) Tableaux with DL-safe Rules: First Results
On the Semantic Web, there has been increasing demand for a ruleslike expressivity that goes beyond OWL-DL. Efforts of combining rules languages and description logics usually pro...
Vladimir Kolovski, Bijan Parsia, Evren Sirin
TPHOL
1999
IEEE
13 years 12 months ago
Three Tactic Theorem Proving
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
Don Syme
SEMWEB
2004
Springer
14 years 1 months ago
Query Answering for OWL-DL with Rules
Both OWL-DL and function-free Horn rules3 are decidable logics with interesting, yet orthogonal expressive power: from the rules perspective, OWL-DL is restricted to tree-like rule...
Boris Motik, Ulrike Sattler, Rudi Studer
WWW
2004
ACM
14 years 8 months ago
A possible simplification of the semantic web architecture
In the semantic web architecture, Web ontology languages are built on top of RDF(S). However, serious difficulties have arisen when trying to layer expressive ontology languages, ...
Bernardo Cuenca Grau