ID-logic uses ideas from the field of logic programming to extend second order logic with non-monotone inductive defintions. In this work, we reformulate the semantics of this logic in terms of approximation theory, an algebraic theory which generalizes the semantics of several non-monotonic reasoning formalisms. This allows us to apply certain abstract modularity theorems, developed within the framework of approximation theory, to ID-logic. As such, we are able to offer elegant and simple proofs of generalizations of known theorems, m well as some new results.status: publishe
We present the proof theory and the model theory of a monotonic framework for default reasoning, and...
It is well known that, under certain conditions, it is possible to split logic programs under stable...
AbstractIntegrating diverse formalisms into modular knowledge representation systems offers increase...
ID-logic uses ideas from the field of logic programming to extend second order logic with non-monoto...
Abstract. Approximation theory is a fixpoint theory of general (monotone and non-monotone) operators...
Approximation theory is a fixpoint theory of general (monotone and non-monotone) operators which gen...
ID-logic uses ideas from logic programming to extend classical logic with non-monotone inductive def...
First Order ID-Logic interprets general first order, non-monotone, inductive definability by general...
AbstractInspired by the recent work on approximations of classical logic, we present a method that a...
Inspired by the recent work on approximations of classical logic, we present a method that approxima...
Inspired by recent work on approximations of classical logic, we present a method that approximates ...
Well-known principles of induction include monotone induction and different sorts of non-monotone in...
Well-known principles of induction include monotone induction and different sorts of nonmonotone ind...
AbstractProblems in logic are well known to be hard to solve in the worst case. Two different strate...
It is well known that, under certain conditions, it is possible to split logic programs under stable...
We present the proof theory and the model theory of a monotonic framework for default reasoning, and...
It is well known that, under certain conditions, it is possible to split logic programs under stable...
AbstractIntegrating diverse formalisms into modular knowledge representation systems offers increase...
ID-logic uses ideas from the field of logic programming to extend second order logic with non-monoto...
Abstract. Approximation theory is a fixpoint theory of general (monotone and non-monotone) operators...
Approximation theory is a fixpoint theory of general (monotone and non-monotone) operators which gen...
ID-logic uses ideas from logic programming to extend classical logic with non-monotone inductive def...
First Order ID-Logic interprets general first order, non-monotone, inductive definability by general...
AbstractInspired by the recent work on approximations of classical logic, we present a method that a...
Inspired by the recent work on approximations of classical logic, we present a method that approxima...
Inspired by recent work on approximations of classical logic, we present a method that approximates ...
Well-known principles of induction include monotone induction and different sorts of non-monotone in...
Well-known principles of induction include monotone induction and different sorts of nonmonotone ind...
AbstractProblems in logic are well known to be hard to solve in the worst case. Two different strate...
It is well known that, under certain conditions, it is possible to split logic programs under stable...
We present the proof theory and the model theory of a monotonic framework for default reasoning, and...
It is well known that, under certain conditions, it is possible to split logic programs under stable...
AbstractIntegrating diverse formalisms into modular knowledge representation systems offers increase...