R.E. Axiomatization of Conditional Independence
نویسندگان
چکیده
The paper investigates properties of the conditional independence relation between pieces of information. This relation is also known in the database theory as embedded multivalued dependency. In 1980, Parker and Parsaye-Ghomi established that the properties of this relation can not be described by a finite system of inference rules. In 1995, Herrmann proved that the propositional theory of this relation is undecidable. The main result of this paper is a complete recursively enumerable axiomatization of this theory.
منابع مشابه
A Finite Axiomatization of Conditional Independence and Inclusion Dependencies
We present a complete finite axiomatization of the unrestricted implication problem for inclusion and conditional independence atoms in the context of dependence logic. For databases, our result implies a finite axiomatization of the unrestricted implication problem for inclusion, functional, and embedded multivalued dependencies in the unirelational case.
متن کاملOn Axiomatization of Probabilistic Conditional Independencies
This paper studies the connection between probabilistic conditional independence in un certain reasoning and data dependency in re lational databases. As a demonstration of the usefulness of this preliminary investigation, an alternate proof is presented for refuting the conjecture suggested by Pearl and Paz that probabilistic conditional independencies have a complete axiomatization.
متن کاملProperties of Weak Conditional Independence
Object-oriented Bayesian networks (OOBNs) facilitate the design of large Bayesian networks by allowing Bayesian networks to be nested inside of one another. Weak conditional independence has been shown to be a necessary and sufficient condition for ensuring consistency in OOBNs. Since weak conditional independence plays such an important role in OOBNs, in this paper we establish two useful resu...
متن کاملProbabilistic Conditional Independence under Schema Certainty and Uncertainty
Conditional independence provides an essential framework to deal with knowledge and uncertainty in Artificial Intelligence, and is fundamental in probability and multivariate statistics. Its associated implication problem is paramount for building Bayesian networks. Saturated conditional independencies form an important subclass of conditional independencies. Under schema certainty, the implica...
متن کاملPropositional Reasoning about Saturated Conditional Probabilistic Independence
Conditional independence provides an essential framework to deal with knowledge and uncertainty in Artificial Intelligence, and is fundamental in probability and multivariate statistics. Its associated implication problem is paramount for building Bayesian networks. Unfortunately, the problem does not enjoy a finite ground axiomatization and is already coNP-complete to decide for restricted sub...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1310.6430 شماره
صفحات -
تاریخ انتشار 2013