ID-logic uses ideas from logic programming to extend classical logic with non-monotone inductive definitions. Here, we study the structure of definitions expressed in this formalism. We define the fundamental concept of a dependency relation, both in an abstract, algebraic context and in the concrete setting of ID-logic. We also characterize dependency relations in a more constructive way. Our results are used to study the relation between ID-logic and known classes of inductive definitions and to show the correctness of ID-logic semantics in these cases
In this article we review recent results on expressivity and complexity of first-order, modal, and p...
Abstract. ID-Logic is a knowledge representation language that ex-tends first-order logic with non-m...
AbstractAn indexed inductive definition (IID) is a simultaneous inductive definition of an indexed f...
ID-logic uses ideas from the field of logic programming to extend second order logic with non-monoto...
Approximation theory is a fixpoint theory of general (monotone and non-monotone) operators which gen...
Well-known principles of induction include monotone induction and different sorts of nonmonotone ind...
AbstractTemporal reasoning has always been a major test case for knowledge representation formalisms...
The goal of this paper is to extend classical logic with a generalized notion of inductive definitio...
Abstract. Approximation theory is a fixpoint theory of general (monotone and non-monotone) operators...
Abstract. Many correctness criteria have been proposed since linear logic was introduced and it is n...
Real world programming languages crucially depend on the availability of computational effects to ac...
Well-known principles of induction include monotone induction and different sorts of non-monotone in...
We study the properties of a number of algorithms proposed to explore the computational space genera...
AbstractWe define a logic D capable of expressing dependence of a variable on designated variables o...
We introduce a declarative approach for a coherent composition of autonomous databases. For this we ...
In this article we review recent results on expressivity and complexity of first-order, modal, and p...
Abstract. ID-Logic is a knowledge representation language that ex-tends first-order logic with non-m...
AbstractAn indexed inductive definition (IID) is a simultaneous inductive definition of an indexed f...
ID-logic uses ideas from the field of logic programming to extend second order logic with non-monoto...
Approximation theory is a fixpoint theory of general (monotone and non-monotone) operators which gen...
Well-known principles of induction include monotone induction and different sorts of nonmonotone ind...
AbstractTemporal reasoning has always been a major test case for knowledge representation formalisms...
The goal of this paper is to extend classical logic with a generalized notion of inductive definitio...
Abstract. Approximation theory is a fixpoint theory of general (monotone and non-monotone) operators...
Abstract. Many correctness criteria have been proposed since linear logic was introduced and it is n...
Real world programming languages crucially depend on the availability of computational effects to ac...
Well-known principles of induction include monotone induction and different sorts of non-monotone in...
We study the properties of a number of algorithms proposed to explore the computational space genera...
AbstractWe define a logic D capable of expressing dependence of a variable on designated variables o...
We introduce a declarative approach for a coherent composition of autonomous databases. For this we ...
In this article we review recent results on expressivity and complexity of first-order, modal, and p...
Abstract. ID-Logic is a knowledge representation language that ex-tends first-order logic with non-m...
AbstractAn indexed inductive definition (IID) is a simultaneous inductive definition of an indexed f...