Propositional Reasoning about Saturated Conditional Probabilistic Independence

@inproceedings{Link2012PropositionalRA,
  title={Propositional Reasoning about Saturated Conditional Probabilistic Independence},
  author={Sebastian Link},
  booktitle={WoLLIC},
  year={2012}
}
  • S. Link
  • Published in WoLLIC 3 September 2012
  • Computer Science
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 subclasses. Saturated conditional independencies form an important subclass of conditional independencies… 
Approximation Logics for Subclasses of Probabilistic Conditional Independence and Hierarchical Dependence on Incomplete Data
  • S. Link
  • Computer Science
    Dependence Logic
  • 2016
TLDR
Generalized saturated conditional independence and full first-order hierarchical dependence over incomplete data are investigated as expressive subclasses of probabilistic conditional independent and first- order hierarchical dependence, respectively.
Reasoning about Saturated Conditional Independence Under Uncertainty: Axioms, Algorithms, and Levesque's Situations to the Rescue
TLDR
Equalences are shown to the implication problem of a propositional fragment under Levesque's situations, and that of Lien's class of multivalued database dependencies under null values, in the presence of missing data.
Approximate Reasoning about Generalized Conditional Independence with Complete Random Variables
TLDR
Delobel’s class of full first-order hierarchical database decompositions are generalized to the presence of controlled uncertainty, and their implication problem shown to be equivalent to that of saturated conditional independence.
LIST OF CITATIONS

References

SHOWING 1-10 OF 20 REFERENCES
On the implication problem for probabilistic conditional independency
TLDR
The present study suggests that there is no real difference between Bayesian networks and relational databases, in the sense that only solvable classes of independencies are useful in the design and implementation of these knowledge systems.
Charting the completeness frontier of inference systems for multivalued dependencies
  • S. Link
  • Computer Science
    Acta Informatica
  • 2008
TLDR
The results of this paper establish a foundation for reasoning about multivalued dependencies without the assumption of a fixed underlying universe.
Functional Dependencies in a Relational Data Base and Propositional Logic
TLDR
An equivalence is shown between functional dependency statements of a relational database and implicational statements of propositional logic, where it is shown that a dependency statement is a consequence of a set of dependency statements if the correspondingimplicational statement isA consequence of the corresponding set of implICational statements.
The implication problem of data dependencies over SQL table definitions: Axiomatic, algorithmic and logical characterizations
TLDR
Not NULL constraints are established as an effective mechanism to balance not only the certainty in database relations but also the expressiveness with the efficiency of entailment relations.
Logical and Algorithmic Properties of Conditional Independence and Graphical Models
TLDR
An axiomatic basis is developed for the relationship between conditional independence and graphical models in statistical analysis and unconditional independence relative to normal models can be axiomatized with a finite set of axioms.
Appropriate inferences of data dependencies in relational databases
  • J. Biskup, S. Link
  • Computer Science
    Annals of Mathematics and Artificial Intelligence
  • 2012
TLDR
Inference systems for the combined class of functional and full hierarchical dependencies in relational databases are identified and a finite axiomatisation for the original notion of implication is established which clarifies the role of the complementation rule in the combined setting.
Probabilistic reasoning in intelligent systems - networks of plausible inference
  • J. Pearl
  • Computer Science
    Morgan Kaufmann series in representation and reasoning
  • 1989
TLDR
The author provides a coherent explication of probability as a language for reasoning with partial belief and offers a unifying perspective on other AI approaches to uncertainty, such as the Dempster-Shafer formalism, truth maintenance systems, and nonmonotonic logic.
...
...