A survey on guarded negation
Abstract
We consider a logical framework building on existential positive formulas and then adding guarded negations and guarded fixpoints, where the guards are atomic formulas containing all free variables. The resulting first-order and fixpoint logics turn out to have nice algorithmic properties and nice expressive power. We survey some of them.
Domains
Computation and Language [cs.CL]
Origin : Files produced by the author(s)
Loading...