Sciweavers

AAAI
1998

Two Forms of Dependence in Propositional Logic: Controllability and Definability

13 years 5 months ago
Two Forms of Dependence in Propositional Logic: Controllability and Definability
We investigate two forms of dependence between variables and/or formulas within a propositional knowledge base: controllability (a set of variables X controls a formula , if there is a way to fix the truth value of the variables in X in order to achieve , to have a prescribed truth value) and definability (X defines a variable y if every truth assignment of the variables in X enables us finding out the truth value of y). Several characterization results are pointed out, complexity issues are analyzed, and some applications of both notions, including decision under incomplete knowledge and/or partial observability, and hypothesis discrimination, are sketched.
Jérôme Lang, Pierre Marquis
Added 01 Nov 2010
Updated 01 Nov 2010
Type Conference
Year 1998
Where AAAI
Authors Jérôme Lang, Pierre Marquis
Comments (0)