Frames in the space of situations (research note)
Artificial Intelligence
Reducing BDD size by exploiting functional dependencies
DAC '93 Proceedings of the 30th international Design Automation Conference
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
The complexity of logic-based abduction
Journal of the ACM (JACM)
The independent choice logic for modelling multiple agents under uncertainty
Artificial Intelligence - Special issue on economic principles of multi-agent systems
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
A Formal Framework for Clausal Modeling and Argumentation
FAPR '96 Proceedings of the International Conference on Formal and Applied Practical Reasoning
A logical account of relevance
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Probabilistic propositional planning: representations and complexity
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Mixed constraint satisfaction: a framework for decision problems under incomplete knowledge
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Conditional independence in propositional logic
Artificial Intelligence
Compact preference representation and Boolean games
Autonomous Agents and Multi-Agent Systems
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
Propositional Update Operators Based on Formula/Literal Dependence
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
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.