We introduce fixpoint definitions, a rule-based reformulation of fixpoint constructs. The logic FO(FD), an extension of classical logic with fixpoint definitions, is defined. We illustrate the relation between FO(FD) and FO(ID), which is developed as an integration of two knowledge representation paradigms. The satisfiability problem for FO(FD) is investigated by first reducing FO(FD) to difference logic and then using solvers for difference logic. These reductions are evaluated in the computation of models for FO(FD) theories representing fairness conditions and we provide potential applications of FO(FD).status: publishe
FDE is a logic that captures relevant entailment between implication-free formulae and admits of an ...
In the field of knowledge representation and reasoning, many different logics are developed. Often, ...
International audienceWe look at characterizing which formulas are expressible in rich decidable log...
We introduce fixpoint definitions, a rule-based reformulation of fixpoint constructs. The logic FO(F...
Abstract. We introduce the fixpoint definitions, which is a reformula-tion of fixpoint logic constru...
AbstractThe variety of semantical approaches that have been invented for logic programs is quite bro...
The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non...
Abstract. The logic FO(ID) uses ideas from the field of logic program-ming to extend first order log...
AbstractThis paper introduces a new higher-order typed constructive predicate logic for fixpoint com...
Abstract. This paper presents a Knowledge Base project for FO(ID), an exten-sion of classical logic ...
Algebraical fixpoint theory is an invaluable instrument for studying semantics of logics. For exampl...
AbstractThis paper presents computational adequacy results for the FIX logical system introduced by ...
There are many interesting Knowledge Representation questions sur- rounding rule languages for the S...
We study the transformation of "predicate introduction" in non-monotonic logics. By this, we mean th...
© 2015 Cambridge University Press. Recent advances in knowledge compilation introduced techniques to...
FDE is a logic that captures relevant entailment between implication-free formulae and admits of an ...
In the field of knowledge representation and reasoning, many different logics are developed. Often, ...
International audienceWe look at characterizing which formulas are expressible in rich decidable log...
We introduce fixpoint definitions, a rule-based reformulation of fixpoint constructs. The logic FO(F...
Abstract. We introduce the fixpoint definitions, which is a reformula-tion of fixpoint logic constru...
AbstractThe variety of semantical approaches that have been invented for logic programs is quite bro...
The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non...
Abstract. The logic FO(ID) uses ideas from the field of logic program-ming to extend first order log...
AbstractThis paper introduces a new higher-order typed constructive predicate logic for fixpoint com...
Abstract. This paper presents a Knowledge Base project for FO(ID), an exten-sion of classical logic ...
Algebraical fixpoint theory is an invaluable instrument for studying semantics of logics. For exampl...
AbstractThis paper presents computational adequacy results for the FIX logical system introduced by ...
There are many interesting Knowledge Representation questions sur- rounding rule languages for the S...
We study the transformation of "predicate introduction" in non-monotonic logics. By this, we mean th...
© 2015 Cambridge University Press. Recent advances in knowledge compilation introduced techniques to...
FDE is a logic that captures relevant entailment between implication-free formulae and admits of an ...
In the field of knowledge representation and reasoning, many different logics are developed. Often, ...
International audienceWe look at characterizing which formulas are expressible in rich decidable log...