Propositional Independence - Formula-Variable Independence and Forgetting
@article{Lang2003PropositionalI, title={Propositional Independence - Formula-Variable Independence and Forgetting}, author={J. Lang and P. Liberatore and P. Marquis}, journal={J. Artif. Intell. Res.}, year={2003}, volume={18}, pages={391-443} }
Independence - the study of what is relevant to a given problem of reasoning - has received an increasing attention from the AI community. In this paper, we consider two basic forms of independence, namely, a syntactic one and a semantic one. We show features and drawbacks of them. In particular, while the syntactic form of independence is computationally easy to check, there are cases in which things that intuitively are not relevant are not recognized as such. We also consider the problem of… CONTINUE READING
Topics from this paper
216 Citations
Projection and scope-determined circumscription
- Computer Science, Mathematics
- J. Symb. Comput.
- 2012
- 14
- Highly Influenced
- PDF
A Logical Study of Partial Entailment
- Mathematics, Computer Science
- J. Artif. Intell. Res.
- 2011
- 1
- Highly Influenced
- PDF
A Brief Survey on Forgetting from a Knowledge Representation and Reasoning Perspective
- Computer Science
- KI - Künstliche Intelligenz
- 2018
- 20
- Highly Influenced
- PDF
Dependence in Propositional Logic: Formula-Formula Dependence and Formula Forgetting - Application to Belief Update and Conservative Extension
- Computer Science
- AAAI
- 2018
- Highly Influenced
- PDF
Towards a General Framework for Kinds of Forgetting in Common-Sense Belief Management
- Computer Science
- KI - Künstliche Intelligenz
- 2018
- 8
- Highly Influenced
A Knowledge Level Account of Forgetting
- Computer Science
- J. Artif. Intell. Res.
- 2017
- 20
- Highly Influenced
- PDF
Knowledge Forgetting in Answer Set Programming
- Mathematics, Computer Science
- J. Artif. Intell. Res.
- 2014
- 24
- Highly Influenced
- PDF
References
SHOWING 1-10 OF 67 REFERENCES
Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas
- Mathematics, Computer Science
- IJCAI
- 2001
- 41
- PDF
Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae
- Computer Science
- LPAR
- 2001
- 66
Updating Epistemic States
- Computer Science
- Australian Joint Conference on Artificial Intelligence
- 2001
- 9