![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 3 | Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis: Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages. JSAT 1(1): 61-88 (2006) | |
| 2 | Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis: Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae. AAAI 2005: 288-293 |
Selection of 2 from 6 records - Florian Letombe has 10 coauthors
Copyright © 2009-12-24 by Michael Ley (ley@uni-trier.de)