The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
Abstract. Since the advent of model checking it is becoming more common for languages to be given a semantics in terms of transition systems. Such semantics allow to model check pr...
Predicting the performance of a tableau reasoner for an OWL ontology is generally hard. It is even harder for users who are not familiar with the details of tableau algorithms. In ...
We present a sound and complete calculus for causal relevance that uses Pearl's functional causal models as semantics. The calculus consists of axioms and rules of inference ...
This paper proposes a novel interactive tool designed to support the graphical inspection of large semantic models. The idea is to view the iterative inspection process as a serie...