In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong c...
Following the approaches and motivations given in recent works about action languages over description logics, we propose an action formalism based on a constructive semantics for ...
We introduce the calculus of structures: it is more general than the sequent calculus and it allows for cut elimination and the subformula property. We show a simple extension of m...
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
K. Narayan Kumar, C. R. Ramakrishnan, Scott A. Smo...
The paper investigates the characterisation of vague concepts within the framework of modal logic. This work builds on the supervaluation approach of Fine and exploits the idea of...