We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w...
Ontologies are an increasingly important tool in knowledge representation, as they allow large amounts of data to be related in a logical fashion. Current research is concentrated...
Matthew E. Taylor, Cynthia Matuszek, Bryan Klimt, ...
We identify the complexity of (finite model) reasoning in the DL SROIQ to be N2ExpTime-complete. We also prove that (finite model) reasoning in the DL SR--a fragment of SROIQ witho...
Abstract. The paper describes HıLεX, a new ASP-based system for the extraction of information from unstructured documents. Unlike previous systems, which are mainly syntactic, H...
Massimo Ruffolo, Nicola Leone, Marco Manna, Domeni...
Abstract. The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, a...