We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by...
The model-checking problem for a logic L on a class C of structures asks whether a given L-sentence holds in a given structure in C. In this paper, we give super-exponential lower...
We revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding proof structures is NLcomple...
We provide a novel model to formalize a well-known algorithm, by Chandra and Toueg, that solves Consensus among asynchronous distributed processes in the presence of a particular ...
Abstract. Inconsistency handling is of growing importance in Knowledge Representation since inconsistencies may frequently occur in an open world. Paraconsistent (or inconsistency-...