We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theo...
The purpose of this paper is to investigate the methodology of reasoning with prioritized defaults in the language of logic programs under the answer set semantics. We present a do...
This chapter covers extensions of the basic description logics introduced in Chapter 2 by very expressive constructs that require advanced reasoning techniques. In particular, we ...
In [Sas01], it was given a cut-free sequent system for the smallest interpretability logic IL. He first gave a cut-free system for IK4, a sublogic of IL, whose -free fragment is th...
Semantic matching determines the mappings between the nodes of two graphs (e.g., ontologies) by computing logical relations (e.g., subsumption) holding among the nodes that corresp...
Fausto Giunchiglia, Pavel Shvaiko, Mikalai Yatskev...