13 search results - page 1 / 3 » LTL over Description Logic Axioms |
DLOG
2008
13 years 7 months ago
2008
INLG
2010
Springer
13 years 3 months ago
2010
Springer
Ontologies and datasets for the Semantic Web are encoded in OWL formalisms that are not easily comprehended by people. To make ontologies accessible to human domain experts, sever...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
SEMWEB
2007
Springer
13 years 11 months ago
2007
Springer
Classical ontologies are not suitable to represent imprecise nor uncertain pieces of information. As a solution we will combine fuzzy Description Logics with a possibilistic layer....
DEXAW
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper we explore embeddings of the various kinds of RDF entailment in F-Logic. We show that the embeddings of simple, RDF, and RDFS entailment, as well as a large fragment...