Add to ORKGThe unification problem in a logical system L can be defined in the following way: given a formula φ(x1,..., xα), determine whether there exists formulas ψ1,..., ψα such that φ(ψ1,..., ψα) is in L. The research on unification for modal logics was originally motivated by the admissibility problem for rules of inference: given a rul
International audienceThe λΠ-calculus modulo theory is a logical framework in which many logical sys...
Epistemic logics are essential to the design of logical systems that capture elements of reasoning a...
International audienceIn this paper, we show that every KD45-unifiable formula has a projective unif...
ALT1 is the least modal logic containing the formula characterizing deterministic frames. The unific...
International audienceUnification in propositional logics is an active research area. In this paper,...
AbstractWe show that some common varieties of modal K4-algebras have finitary unification type, thus...
We show that the unification problem “is there a substitution instance of a given formula that is pr...
AbstractWe prove that the unification type of Łukasiewicz (infinite-valued propositional) logic and ...
The notion of theory split from the notion of logics in the late 1920's when Hilbert and Ackermann d...
International audienceThe problem of unification in a normal modal logic L can be defined as follows...
In this paper, we give a new presentation of the fundamental results of the theory of Logic Programm...
International audienceThe unification problem in a propositional logic is to determine, given a form...
The unification problem in a normal modal logic is to determine, given a formula φ, whether there ex...
In this paper we consider modal team logic, a generalization of classical modal logic in which it is...
AbstractAn equational formula is a first-order formula over an alphabet F of function symbols and th...
International audienceThe λΠ-calculus modulo theory is a logical framework in which many logical sys...
Epistemic logics are essential to the design of logical systems that capture elements of reasoning a...
International audienceIn this paper, we show that every KD45-unifiable formula has a projective unif...
ALT1 is the least modal logic containing the formula characterizing deterministic frames. The unific...
International audienceUnification in propositional logics is an active research area. In this paper,...
AbstractWe show that some common varieties of modal K4-algebras have finitary unification type, thus...
We show that the unification problem “is there a substitution instance of a given formula that is pr...
AbstractWe prove that the unification type of Łukasiewicz (infinite-valued propositional) logic and ...
The notion of theory split from the notion of logics in the late 1920's when Hilbert and Ackermann d...
International audienceThe problem of unification in a normal modal logic L can be defined as follows...
In this paper, we give a new presentation of the fundamental results of the theory of Logic Programm...
International audienceThe unification problem in a propositional logic is to determine, given a form...
The unification problem in a normal modal logic is to determine, given a formula φ, whether there ex...
In this paper we consider modal team logic, a generalization of classical modal logic in which it is...
AbstractAn equational formula is a first-order formula over an alphabet F of function symbols and th...
International audienceThe λΠ-calculus modulo theory is a logical framework in which many logical sys...
Epistemic logics are essential to the design of logical systems that capture elements of reasoning a...
International audienceIn this paper, we show that every KD45-unifiable formula has a projective unif...