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...
We show how a tableaux algorithm for SHIQ can be extended to support role boxes that include range and domain axioms, prove that the extended algorithm is still a decision procedur...
Conjunctive query answering is a key reasoning service for many ontology-based applications. In order to improve scalability, many Semantic Web query answering systems give up com...
Giorgos Stoilos, Bernardo Cuenca Grau, Ian Horrock...
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
Abstract. This paper describes a proof search procedure for propositional nonclausal resolution based on a new weighting strategy that utilizes search methods for propositional sat...