On the use of partially ordered decision graphs for knowledge compilation and quantified boolean formulae

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2006, Pages 42-47

  Fargier, Hélène ^a   Marquis, Pierre ^b  

^a CNRS   (France)

^b UNIVERSITÉ D'ARTOIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FORMULAE; DECISION GRAPHS; POLYTIME QUERIES;

BOOLEAN FUNCTIONS; DECISION THEORY; KNOWLEDGE ENGINEERING; QUERY LANGUAGES;

GRAPH THEORY;

EID: 33750726747     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Amilhastre, J.; Fargier, H.; and Marquis, P. 2002. Consistency restoration and explanations in dynamic CSP - application to configuration. Artificial Intelligence 135(1-2):199-234.
2. Coste-Marquis, S.; Le Berre, D.; Letombe, F.; and Marquis, P. 2005. Prepositional fragments for knowledge compilation and quantified boolean formulae. In Proceedings of AAAI-05, 288-293.
3. Coste-Marquis, S.; Fargier, H.; Lang, J.; Le Berre, D.; and Marquis, P. 2006. Representing policies for quantified boolean formulae. In Proceedings of KR-06, to appear.
4. Darwiche, A., and Marquis, P. 2001. A perspective on knowledge compilation. In Proceedings of IJCAI-01, 175-182.
5. Darwiche, A. 2001. Decomposable negation normal form. Journal of the ACM 48(4):608-647.
6. Dechter, R. 2004. And/or search spaces for graphical models. Technical report, ICS Technical Report.
7. Egly, U.; Eiter, T.; Tompits, H.; and Woltran, S. 2000. Solving advanced reasoning tasks using quantified boolean formulas. In Proceedings of AAAI-00, 417-422.
8. Faltings, B., and Weigel, R. 1999. Compiling constraint satisfaction problems. Artificial Intelligence 115(2):257-287.
9. Fargier, H., and Vilarem, M.-C. 2004. Compiling CSPs into tree-driven automata for interactive solving. Constraints 9:263-287.
10. McMillan, K. 1994. Hierarchical representation of discrete functions with application to model checking. In Proceedings of CAV-94, 41-54.
11. Pargamin, B. 2002. Vehicle sales configuration: the cluster tree approach. In Proceedings of ECAI'02 Workshop on Configuration, 35-40.
12. Rintanen, J. 1999. Constructing conditional plans by a theorem-prover. Journal of Artificial Intelligence Research 10:323-352.
13. Sieling, D., and Wegener, I. 1993. Reduction of OBDDs in linear time. Information Processing Letters 48(3):139-144.
14. Vempaty, N. 1992. Solving constraint satisfaction problems using finite state automata. In Proceedings of AAAI-92, 453-458.