Abstract. The Description Logics underpinning OWL impose a well-known syntactic restriction in order to preserve decidability: they do not allow to use nonsimple roles—that is, t...
We propose to design and study new techniques for description logic (DL) reasoning based on a prominent data structure that has been applied very successfully in various domains in...
In this paper we describe a stochastic local search (SLS) procedure for finding models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on the features...
Duc Nghia Pham, John Thornton, Charles Gretton, Ab...
The evolution of Description Logics (DLs) and Propositional Dynamic Logics produced a hierar chy of decidable logics with multiple maximal el ements. It would be desirable to ...
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...