Conditional independence in propositional logic

Authors:
Jé/rô/me Lang;Paolo Liberatore;Pierre Marquis
Affiliations:
IRIT-CNRS, Université/ Paul Sabatier, Toulouse, France;Università/ di Roma "La Sapienza", Rome, Italy;CRIL-CNRS/Université/ d/Artois, Lens, France
Venue:
Artificial Intelligence
Year:
2002

Citing 12
Cited 10

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
How to recognize interesting topics to provide cooperative answering

Information Systems
Symbolic causal networks

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Irrelevance reasoning in knowledge-based systems

Irrelevance reasoning in knowledge-based systems
The complexity of logic-based abduction

Journal of the ACM (JACM)
A logical notion of conditional independence: properties and applications

Artificial Intelligence - Special issue on relevance
Relevance from an epistemic perspective

Artificial Intelligence - Special issue on relevance
Two forms of dependence in propositional logic: controllability and definability

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Novelty Revisited

ISMIS '91 Proceedings of the 6th International Symposium on Methodologies for Intelligent Systems
A theory of justified reformulations

A theory of justified reformulations
Qualitative relevance and independence: a roadmap

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
A logical account of relevance

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

On propositional definability

Artificial Intelligence
Towards ACL semantics based on commitments and penalties

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Propositional independence: formula-variable independence and forgetting

Journal of Artificial Intelligence Research
New polynomial classes for logic-based abduction

Journal of Artificial Intelligence Research
A logical study of partial entailment

Journal of Artificial Intelligence Research
On logical consequence for collections of OWL documents

ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Toward formalizing usefulness in propositional language

KSEM'06 Proceedings of the First international conference on Knowledge Science, Engineering and Management
Lost in translation: language independence in propositional logic-application to belief revision and belief merging

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Propositional Update Operators Based on Formula/Literal Dependence

ACM Transactions on Computational Logic (TOCL)
Lost in translation: Language independence in propositional logic - application to belief change

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Independence-the study of what is relevant to a given problem of reasoning--is an important AI topic. In this paper, we investigate several notions of conditional independence in propositional logic: Darwiche and Pearl's conditional independence, and some more restricted forms of it. Many characterizations and properties of these independence relations are provided. We show them related to many other notions of independence pointed out so far in the literature (mainly formula-variable independence, irrelevance and novelty under various forms, separability, interactivity). We identify the computational complexity of conditional independence and of all these related independence relations.