Add to ORKGInternational audienceWe 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
International audienceGuardedness restrictions are one of the principal means to obtain decidable lo...
We consider restrictions of first-order logic and of fixpoint logic in which all occurrences of nega...
Aiming to pinpoint the reasons behind the decidability of some complex extensions of modal logic, we...
International audienceWe consider a logical framework building on existential positive formulas and ...
International audienceWe consider restrictions of first-order logic and of fixpoint logic in which a...
International audienceWe study fragments of first-order logic and of least fixed point logic that al...
International audienceGuardedness restrictions are one of the principal means to obtain decidable lo...
We study fragments of first-order logic and of least fixed point logic that allow only unary negatio...
Abstract. We consider restrictions of first-order logic and of fixpoint logic in which all occurrenc...
International audienceWe look at characterizing which formulas are expressible in rich decidable log...
The Guarded Negation Fragment (GNFO) is a fragment of first-order logic that contains all positive e...
For many practical applications of logic-based methods there is a requirement to balance expressive ...
We look at characterizing which formulas are expressible in rich decidable logics such as guarded fi...
We consider restrictions of first-order logic and of fixpoint logic in which all occurrences of nega...
Guardedness restrictions are one of the principal means to obtain decidable logics — operators such ...
International audienceGuardedness restrictions are one of the principal means to obtain decidable lo...
We consider restrictions of first-order logic and of fixpoint logic in which all occurrences of nega...
Aiming to pinpoint the reasons behind the decidability of some complex extensions of modal logic, we...
International audienceWe consider a logical framework building on existential positive formulas and ...
International audienceWe consider restrictions of first-order logic and of fixpoint logic in which a...
International audienceWe study fragments of first-order logic and of least fixed point logic that al...
International audienceGuardedness restrictions are one of the principal means to obtain decidable lo...
We study fragments of first-order logic and of least fixed point logic that allow only unary negatio...
Abstract. We consider restrictions of first-order logic and of fixpoint logic in which all occurrenc...
International audienceWe look at characterizing which formulas are expressible in rich decidable log...
The Guarded Negation Fragment (GNFO) is a fragment of first-order logic that contains all positive e...
For many practical applications of logic-based methods there is a requirement to balance expressive ...
We look at characterizing which formulas are expressible in rich decidable logics such as guarded fi...
We consider restrictions of first-order logic and of fixpoint logic in which all occurrences of nega...
Guardedness restrictions are one of the principal means to obtain decidable logics — operators such ...
International audienceGuardedness restrictions are one of the principal means to obtain decidable lo...
We consider restrictions of first-order logic and of fixpoint logic in which all occurrences of nega...
Aiming to pinpoint the reasons behind the decidability of some complex extensions of modal logic, we...