AbstractWe define a logic D capable of expressing dependence of a variable on designated variables only. Thus D has similar goals to the Henkin quantifiers of [4] and the independence friendly logic of [6] that it much resembles. The logic D achieves these goals by realizing the desired dependence declarations of variables on the level of atomic formulas. By [3] and [17], ability to limit dependence relations between variables leads to existential second order expressive power. Our D avoids some difficulties arising in the original independence friendly logic from coupling the dependence declarations with existential quantifiers. As is the case with independence friendly logic, truth of D is definable inside D. We give such a definition for...
Dependence is an important concept for many tasks in artificial intelligence. A task can be executed...
AbstractWe introduce some new logics of imperfect information by adding atomic formulas correspondin...
Abstract. We consider the problem of existential quantifier elimination for Boolean formulas in Conj...
Dependence logic extends the language of first order logic by means of dependence atoms and aims to ...
Dependence logic extends the language of first order logic by means of dependence atoms and aims to ...
We present a framework for studying the concept of independence in a general context covering databa...
In this paper, we axiomatize the negatable consequences in dependence and independence logic by exte...
We study the expressive power of fragments of inclusion and independence logic defined either by re...
Independence Friendly Logic, introduced by Hintikka, is a logic in which a quantifier can be marked ...
In this article we review recent results on expressivity and complexity of first-order, modal, and p...
In this volume, different aspects of logics for dependence and independence are discussed, including...
Dependence logic is a novel logical formalism that has connections to database theory, statistics, l...
Abstract. We prove two completeness results, one for the extension of depen-dence logic by a monoton...
The originality of this thesis has been checked using the Turnitin OriginalityCheck service in accor...
We prove two completeness results, one for the extension of dependence logic by a monotone generaliz...
Dependence is an important concept for many tasks in artificial intelligence. A task can be executed...
AbstractWe introduce some new logics of imperfect information by adding atomic formulas correspondin...
Abstract. We consider the problem of existential quantifier elimination for Boolean formulas in Conj...
Dependence logic extends the language of first order logic by means of dependence atoms and aims to ...
Dependence logic extends the language of first order logic by means of dependence atoms and aims to ...
We present a framework for studying the concept of independence in a general context covering databa...
In this paper, we axiomatize the negatable consequences in dependence and independence logic by exte...
We study the expressive power of fragments of inclusion and independence logic defined either by re...
Independence Friendly Logic, introduced by Hintikka, is a logic in which a quantifier can be marked ...
In this article we review recent results on expressivity and complexity of first-order, modal, and p...
In this volume, different aspects of logics for dependence and independence are discussed, including...
Dependence logic is a novel logical formalism that has connections to database theory, statistics, l...
Abstract. We prove two completeness results, one for the extension of depen-dence logic by a monoton...
The originality of this thesis has been checked using the Turnitin OriginalityCheck service in accor...
We prove two completeness results, one for the extension of dependence logic by a monotone generaliz...
Dependence is an important concept for many tasks in artificial intelligence. A task can be executed...
AbstractWe introduce some new logics of imperfect information by adding atomic formulas correspondin...
Abstract. We consider the problem of existential quantifier elimination for Boolean formulas in Conj...