@inproceedings{DBLP:conf/ijcai/Ignatiev20,
  author    = {A. Ignatiev},
  title     = {Towards Trustable Explainable {AI}},
  booktitle = {Proc. of IJCAI'20},
  pages     = {5154--5158},
  year      = {2020},
  url       = {https://doi.org/10.24963/ijcai.2020/726},
  doi       = {10.24963/ijcai.2020/726},
  timestamp = {Fri, 25 Dec 2020 01:15:13 +0100},
  biburl    = {https://dblp.org/rec/conf/ijcai/Ignatiev20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{shi2020tractable,
  author    = {W. Shi and A. Shih and A. Darwiche and A. Choi},
  title     = {On Tractable Representations of Binary Neural Networks},
  booktitle = {Proc. of KR'20},
  year      = {2020},
  pages = {882-892},
}

@inproceedings{TrustworthyJoa,
  title={Delivering Trustworthy AI through Formal XAI},
  author={Joao Marques-Silva and Alexey Ignatiev},
  booktitle={AAAI Conference on Artificial Intelligence},
  year={2022},
}

@book{sayed2022inference,
  title={Inférence et apprentissage à partir des données: Les fondements, tome 1},
  author={Sayed, Ali H.},
  year={2022},
  publisher={Cambridge University Press},
  isbn={9781009218122}
}

@article{SVM,
  title={Support-vector networks},
  author={Cortes, Corinna and Vapnik, Vladimir},
  journal={Machine Learning},
  volume={20},
  number={3},
  pages={273--297},
  year={1995},
  publisher={Springer}
}

@INPROCEEDINGS{Kumar2019,
  author={Kumar, M. Suresh and Soundarya, V. and Kavitha, S. and Keerthika, E.S. and Aswini, E.},
  booktitle={2019 3rd International Conference on Computing and Communications Technologies (ICCCT)}, 
  title={Credit Card Fraud Detection Using Random Forest Algorithm}, 
  year={2019},
  doi={10.1109/ICCCT2.2019.8824930}}

@article{AlamRF,
title = {A Random Forest based predictor for medical data classification using feature ranking},
journal = {Informatics in Medicine Unlocked},
volume = {15},
year = {2019},
doi = {https://doi.org/10.1016/j.imu.2019.100180},
author = {Md. Zahangir Alam and M. Saifur Rahman and M. Sohel Rahman},
keywords = {Medical data classification, Feature ranking, Random forest, Disease predictors},
}

@article{arenas2022computing,
  title={On computing probabilistic explanations for decision trees},
  author={Arenas, Marcelo and Barcel{\'o}, Pablo and Romero Orth, Miguel and Subercaseaux, Bernardo},
  journal={Advances in Neural Information Processing Systems},
  volume={35},
  pages={28695--28707},
  year={2022}
}

@article{Vizing64,
author = {Vizing, V.},
year = {1964},
month = {01},
pages = {},
title = {On an estimate of the chromatic class of a p-graph (In Russian)},
volume = {3},
journal = {(Russian) Diskret Analiz}
}

@article{Graham66,
author = {Graham, R.},
year = {1966},
month = {11},
pages = {},
title = {Bounds for Certain Multiprocessing Anomalies},
volume = {45},
journal = {Siam Journal on Applied Mathematics - SIAMAM},
doi = {10.1002/j.1538-7305.1966.tb01709.x}
}

@inproceedings{Feige1996ATO,
  title={A threshold of ln n for approximating set cover (preliminary version)},
  author={Uriel Feige},
  booktitle={Symposium on the Theory of Computing},
  year={1996}
}

@inproceedings{Brayton1984LogicMA,
  title={Logic Minimization Algorithms for VLSI Synthesis},
  author={Robert K. Brayton and Gary D. Hachtel and Curtis T. McMullen and Alberto L. Sangiovanni-Vincentelli},
  booktitle={The Kluwer International Series in Engineering and Computer Science},
  year={1984},
  url={https://api.semanticscholar.org/CorpusID:58816532}
}

@article{Fujishige2005,
author = {Fujishige Satoru.},
year = {2005},
title = {Submodular functions and optimization},
volume = {58},
journal = {Annals of Discrete Mathematics},
}

@misc{shalev2014understanding,
  title={Understanding Machine Learning: From Theory to Algorithms},
  author={Shalev-Shwartz, Shai and Ben-David, Shai},
  year={2014},
  publisher={Cambridge University Press}
}

@article{Nemhauser78,
author = {Nemhauser, George and Wolsey, Laurence and Fisher, M.},
year = {1978},
month = {12},
pages = {265-294},
title = {An Analysis of Approximations for Maximizing Submodular Set Functions—I},
volume = {14},
journal = {Mathematical Programming},
doi = {10.1007/BF01588971}
}

@article{AudemardPyXAI,
  author = {Gilles Audemard and Steve Bellart and Louenas Bounia and Jean-Marie Lagniez and Pierre Marquis and Nicolas Szczepanski},
  title     = {PyXAI : calculer des explications pour des modèles d'apprentissage supervisé},
  volume = {EGC},
  year      = {2023}
}

@article{Nemhauser1978BestAF,
  title={Best Algorithms for Approximating the Maximum of a Submodular Set Function},
  author={George L. Nemhauser and Laurence A. Wolsey},
  journal={Math. Oper. Res.},
  year={1978},
  volume={3},
  pages={177-188}
}

@InProceedings{Foster15,
  title = 	 {Variable Selection is Hard},
  author = 	 {Foster, Dean and Karloff, Howard and Thaler, Justin},
  booktitle = 	 {Proceedings of The 28th Conference on Learning Theory},
  pages = 	 {696--709},
  year = 	 {2015},
  editor = 	 {Grünwald, Peter and Hazan, Elad and Kale, Satyen},
  volume = 	 {40},
  series = 	 {Proceedings of Machine Learning Research},
  address = 	 {Paris, France},
  month = 	 {03--06 Jul},
  publisher =    {PMLR},
  pdf = 	 {http://proceedings.mlr.press/v40/Foster15.pdf},
  url = 	 {https://proceedings.mlr.press/v40/Foster15.html},
}

@inproceedings{Vondrk2010,
  title={Submodularity and Curvature : The Optimal Algorithm (Combinatorial Optimization and Discrete Algorithms)},
  author={Jan Vondr{\'a}k},
  year={2010}
}

@inproceedings{Kawahara09,
 author = {Kawahara, Yoshinobu and Nagano, Kiyohito and Tsuda, Koji and Bilmes, Jeff A},
 booktitle = {Advances in Neural Information Processing Systems},
 editor = {Y. Bengio and D. Schuurmans and J. Lafferty and C. Williams and A. Culotta},
 publisher = {Curran Associates, Inc.},
 title = {Submodularity Cuts and Applications},
 url = {https://proceedings.neurips.cc/paper_files/paper/2009/file/9ad6aaed513b73148b7d49f70afcfb32-Paper.pdf},
 volume = {22},
 year = {2009}
}

@article{Goldengorin99,
  title={The Data Correcting Algorithm for the Minimization of Supermodular Functions},
  author={Boris Goldengorin and Gerard Sierksma and Gert A. Tijssen and Michael Tso},
  journal={Management Science},
  year={1999},
  volume={45},
  pages={1539-1551}
}

@book{Schrijver2003,
author = {Schrijver, Alexander},
year = {2003},
month = {01},
pages = {},
title = {Combinatorial Optimization: Polyhedra and Efficiency},
volume = {B},
journal = {Journal of Computer and System Sciences - JCSS}
}

@phdthesis{DBLP:phd/hal/Tlilane14,
  author       = {Lydia Tlilane},
  title        = {Les matro{\"{\i}}des et leur implication dans l'allocation de
                  ressources indivisibles : algorithmes d'approximation avec garantie
                  de performance. (Matroids and their implication in the allocation
                  of indivisible resources : approximation algorithms with guaranteed
                  performance)},
  school       = {Paris Dauphine University, France},
  year         = {2014},
  url          = {https://tel.archives-ouvertes.fr/tel-01134377},
  timestamp    = {Tue, 21 Jul 2020 00:40:35 +0200},
  biburl       = {https://dblp.org/rec/phd/hal/Tlilane14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}


@article{Garey72,
author = {Garey, R., Graham, R., et Ullman, J. D.},
year = {1972},
pages = {},
title = {An analysis of some
packing algorithms. In Combinatorial Algorithms},
volume = {39–47},
}

@article{Leader,
  author={Clark, Andrew and Bushnell, Linda and Poovendran, Radha},
  journal={IEEE Transactions on Automatic Control}, 
  title={A Supermodular Optimization Framework for Leader Selection Under Link Noise in Linear Multi-Agent Systems}, 
  year={2014},
  volume={59},
  number={2},
  pages={283-296},
  doi={10.1109/TAC.2013.2281473}}

@article{ErrorLeader,
  author={Clark, Andrew and Alomair, Basel and Bushnell, Linda and Poovendran, Radha},
  journal={IEEE Transactions on Automatic Control}, 
  title={Minimizing Convergence Error in Multi-Agent Systems Via Leader Selection: A Supermodular Optimization Approach}, 
  year={2014},
  volume={59},
  number={6},
  pages={1480-1494},
  doi={10.1109/TAC.2014.2303236}}

@article{greedy_descent,
title = {An approximation guarantee of the greedy descent algorithm for minimizing a supermodular set function},
journal = {Discrete Applied Mathematics},
volume = {114},
number = {1},
pages = {131-146},
year = {2001},
note = {discrete analysis & operations research},
issn = {0166-218X},
doi = {https://doi.org/10.1016/S0166-218X(00)00366-8},
url = {https://www.sciencedirect.com/science/article/pii/S0166218X00003668},
author = {Victor P. Il'ev},
keywords = {Approximation algorithm, Greedy heuristic, Supermodular set function},
abstract = {We consider the problem of minimizing a supermodular set function whose special case is the well-known NP-hard p-median problem. The main result of the paper is a tight bound on the approximation ratio of a greedy heuristic (discrete analog of the steepest descent algorithm) for this problem.}
}

@inproceedings{Vondrak2008,
author = {Vondrak, Jan},
title = {Optimal Approximation for the Submodular Welfare Problem in the Value Oracle Model},
year = {2008},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1374376.1374389},
doi = {10.1145/1374376.1374389},
booktitle = {Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing},
pages = {67–74},
numpages = {8},
keywords = {matroids, submodular functions, combinatorial auctions},
location = {Victoria, British Columbia, Canada},
series = {STOC '08}
}

@article{Conforti84,
  title={Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem},
  author={Michele Conforti and G{\'e}rard Cornu{\'e}jols},
  journal={Discret. Appl. Math.},
  year={1984},
  volume={7},
  pages={251-274}
}

@article{ILEV2001,
title = {An approximation guarantee of the greedy descent algorithm for minimizing a supermodular set function},
journal = {Discrete Applied Mathematics},
volume = {114},
number = {1},
pages = {131-146},
year = {2001},
note = {discrete analysis & operations research},
issn = {0166-218X},
doi = {https://doi.org/10.1016/S0166-218X(00)00366-8},
url = {https://www.sciencedirect.com/science/article/pii/S0166218X00003668},
author = {Victor P. Il'ev},
keywords = {Approximation algorithm, Greedy heuristic, Supermodular set function},
abstract = {We consider the problem of minimizing a supermodular set function whose special case is the well-known NP-hard p-median problem. The main result of the paper is a tight bound on the approximation ratio of a greedy heuristic (discrete analog of the steepest descent algorithm) for this problem.}
}

@inproceedings{SubmodularFM,
  title={Submodular Function Maximization},
  author={Andreas Krause and Daniel Golovin},
  booktitle={Tractability},
  year={2014}
}

@article{dke,
title = {On the explanatory power of Boolean decision trees},
journal = {Data & Knowledge Engineering},
volume = {142},
year = {2022},
author = {Gilles Audemard and Steve Bellart and Louenas Bounia and Frédéric Koriche and Jean-Marie Lagniez and Pierre Marquis},
keywords = {eXplainable AI, Decision trees},
}

@article{CleverHans,
author = {Samhita, Laasya and Gross, Hans},
year = {2013},
month = {11},
pages = {e27122},
title = {The “Clever Hans Phenomenon” revisited},
volume = {6},
journal = {Communicative & integrative biology},
doi = {10.4161/cib.27122}
}

@article{Frosst2017DistillingAN,
  title={Distilling a Neural Network Into a Soft Decision Tree},
  author={Nicholas Frosst and Geoffrey E. Hinton},
  journal={ArXiv},
  year={2017},
  volume={abs/1711.09784},
  url={https://api.semanticscholar.org/CorpusID:3976789}
}

@article{Mittal13,
author = {Mittal, Shashi and Schulz, Andreas},
year = {2013},
month = {01},
title = {An FPTAS for optimizing a class of low-rank functions over a polytope},
volume = {141},
journal = {Mathematical Programming},
doi = {10.1007/s10107-011-0511-x}
}

@book{vazirani2013approximation,
  title={Approximation Algorithms},
  author={Vazirani, V.V.},
  isbn={9783662045664},
  url={https://books.google.fr/books?id=RpUAswEACAAJ},
  year={2013},
  publisher={Springer Berlin Heidelberg}
}

@book{williamson2011design,
  title={The Design of Approximation Algorithms},
  author={Williamson, D.P. and Shmoys, D.B.},
  isbn={9781139077750},
  url={https://books.google.fr/books?id=O2iToAEACAAJ},
  year={2011},
  publisher={Cambridge University Press}
}


@inproceedings{bnn,
 author = {Hubara, Itay and Courbariaux, Matthieu and Soudry, Daniel and El-Yaniv, Ran and Bengio, Yoshua},
 booktitle = {Advances in Neural Information Processing Systems},
 editor = {D. Lee and M. Sugiyama and U. Luxburg and I. Guyon and R. Garnett},
 pages = {},
 publisher = {Curran Associates, Inc.},
 title = {Binarized Neural Networks},
 url = {https://proceedings.neurips.cc/paper_files/paper/2016/file/d8330f857a17c53d217014ee776bfd50-Paper.pdf},
 volume = {29},
 year = {2016}
}

@inproceedings{Zhao2019,
  author    = {F. Xu and
               H. Uszkoreit and
               Y. Du and
               W. Fan and
               D. Zhao and J. Zhu},
  OPTeditor    = {Jie Tang and
               Min{-}Yen Kan and
               Dongyan Zhao and
               Sujian Li and
               Hongying Zan},
  title     = {Explainable {AI:} {A} Brief Survey on History, Research Areas, Approaches
               and Challenges},
  booktitle = {Proc. of NLPCC'19},
  OPTseries    = {Lecture Notes in Computer Science},
  OPTvolume    = {11839},
  pages     = {563--574},
  OPTpublisher = {Springer},
  year      = {2019},
}


@inproceedings{Lundberg17,
  author    = {Lundberg, S. and Lee, S-I.},
  booktitle = {Proc. of NIPS'17},
  OPTeditor    = {I. Guyon and U. V. Luxburg and S. Bengio and H. Wallach and R. Fergus and S. Vishwanathan and R. Garnett},
  pages     = {4765--4774},
  title     = {A Unified Approach to Interpreting M(IJCAIodel Predictions},
  OPTvolume   = {30},
  year      = {2017}
}

@book{shapley,

author={Shapley, Lloyd S},
title={Notes on the n-Person Game -- II: The Value of an n-Person Game},
year={1951},
}

@article{Amgoud23,
  author       = {Leila Amgoud},
  title        = {Explaining black-box classifiers: Properties and functions},
  journal      = {Int. J. Approx. Reason.},
  volume       = {155},
  pages        = {40--65},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.ijar.2023.01.004},
  doi          = {10.1016/j.ijar.2023.01.004},
  timestamp    = {Sat, 25 Mar 2023 16:32:13 +0100},
  biburl       = {https://dblp.org/rec/journals/ijar/Amgoud23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{Lundberg2018,
  title={Consistent Individualized Feature Attribution for Tree Ensembles},
  author={Scott M. Lundberg and Gabriel G. Erion and Su-In Lee},
  journal={ArXiv},
  year={2018},
  volume={abs/1802.03888}
}

@article{Datta2016AlgorithmicTV,
  title={Algorithmic Transparency via Quantitative Input Influence: Theory and Experiments with Learning Systems},
  author={Anupam Datta and Shayak Sen and Yair Zick},
  journal={2016 IEEE Symposium on Security and Privacy (SP)},
  year={2016},
  pages={598-617}
}

@article{Shapelyapprox,
  title={Explaining prediction models and individual predictions with feature contributions},
  author={Erik {\vS}trumbelj and Igor Kononenko},
  journal={Knowledge and Information Systems},
  year={2014},
  volume={41},
  pages={647-665}
}


@article{DBLP:journals/natmi/LundbergECDPNKH20,
  author    = {S. M. Lundberg and
               G. G. Erion and
               H. Chen and
               A. J. DeGrave and
               J. M. Prutkin and
               B. Nair and
               R. Katz and
               J. Himmelfarb and
               N. Bansal and
               S. Lee},
  title     = {From local explanations to global understanding with explainable {AI}
               for trees},
  journal   = {Nat. Mach. Intell.},
  volume    = {2},
  number    = {1},
  pages     = {56--67},
  year      = {2020},
}

@ARTICLE{Adadi.IEEE.2018,
  author={Adadi, A. and Berrada, M.},
  journal={IEEE Access}, 
  title={Peeking Inside the Black-Box: A Survey on Explainable Artificial Intelligence {(XAI)}}, 
  year={2018},
  volume={6},
  pages={52138-52160},
}

@book{Samek.BOOK.2019,
  title={Explainable AI: Interpreting, Explaining and Visualizing Deep Learning},
  author={Samek, W. and Montavon, G. and Vedaldi, A. and Hansen, L.K. and M{\"u}ller, K.R.},
  year={2019},
  publisher={Springer}
}

@book{Molnar.BOOK.2020,
  title={Interpretable Machine Learning},
  author={Molnar, C.},
  year={2020},
  publisher={Leanpub}
}

@article{RC2AE,
  title={RC2: an Efficient MaxSAT Solver},
  author={Alexey Ignatiev},
  journal={J. Satisf. Boolean Model. Comput.},
  year={2019},
}

@inproceedings{MartinsML14,
  author={R. Martins and
               V. M. Manquinho and
               I. Lynce},
  OPTeditor={Carsten Sinz and
               Uwe Egly},
  title={{Open-WBO}: {A} Modular {MaxSAT} Solver},
  booktitle={Proc. of SAT'14},
  OPTseries    = {Lecture Notes in Computer Science},
  OPTvolume    = {8561},
  pages     = {438--445},
  OPTpublisher = {Springer},
  year      = {2014},
}


@inproceedings{DBLP:conf/cp/CooperM21,
  author    = {M. C. Cooper and
               J. Marques{-}Silva},
  OPTeditor    = {Laurent D. Michel},
  title     = {On the Tractability of Explaining Decisions of Classifiers},
  booktitle = {Proc. of CP'21},
  OPTseries    = {LIPIcs},
  OPTvolume    = {210},
  pages     = {21:1--21:18},
  OPTpublisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2021},
}

@inproceedings{D4Lagniez,
  author    = {J.-M. Lagniez and P. Marquis},
  title     = {{An Improved Decision-DNNF Compiler}},
  booktitle = {Proc. of IJCAI'17},
  pages     = {667-673},
  year      = {2017},
}


@inproceedings{DBLP:conf/icml/0001GCIN21,
  author    = {Jo{\~{a}}o Marques{-}Silva and
               Thomas Gerspacher and
               Martin C. Cooper and
               Alexey Ignatiev and
               Nina Narodytska},
  OPTeditor    = {Marina Meila and
               Tong Zhang},
  title     = {Explanations for Monotonic Classifiers},
  booktitle = {Proc. of ICML'21},
  OPTseries    = {Proceedings of Machine Learning Research},
  OPTvolume    = {139},
  pages     = {7469--7479},
  OPTpublisher = {{PMLR}},
  year      = {2021},
}

@inproceedings{Bouniaipmu,
  TITLE = {{Enhancing the Intelligibility of Boolean Decision Trees with Concise and Reliable Probabilistic Explanations}},
  AUTHOR = {Louenas, Bounia},
  BOOKTITLE = {{IPMU 2024}},
  ADDRESS = {Lisbao, Portugal},
  YEAR = {2024},
}

@phdthesis{bounia2023these,
  author       = {Louenas Bounia},
  title        = {Modèles formels pour l’IA explicable : des explications pour les arbres de décision},
  school       = {Université d'Artois},
  year         = {2023},
  type         = {Thèse de doctorat},
}


@article{Izzaprobabilistic,
  title={Locally-Minimal Probabilistic Explanations},
  author={Yacine Izza and Kuldeep S. Meel and Jo{\~a}o Marques-Silva},
  journal={ArXiv},
  year={2024},
}

@inproceedings{Narodytska2018,
  title={Formal Analysis of Deep Binarized Neural Networks},
  author={Nina Narodytska},
  booktitle={International Joint Conference on Artificial Intelligence},
  year={2018},
  url={https://api.semanticscholar.org/CorpusID:51607851}
}

@inproceedings{AudemardKR21,
  author    = {Gilles Audemard and
               Steve Bellart and
               Louenas Bounia and
               Fr{\'{e}}d{\'{e}}ric Koriche and
               Jean{-}Marie Lagniez and
               Pierre Marquis},
  OPTeditor    = {Meghyn Bienvenu and
               Gerhard Lakemeyer and
               Esra Erdem},
  title     = {On the Computational Intelligibility of Boolean Classifiers},
  booktitle = {Proc. of KR'21},
  pages     = {74--86},
  year      = {2021},
}

@article{DBLP:journals/corr/abs-2107-01654,
  author    = {X. Huang and
               Y. Izza and
               A. Ignatiev and
               M. C. Cooper and
               N. Asher and
               J. Marques{-}Silva},
  title     = {Efficient Explanations for Knowledge Compilation Languages},
  journal   = {CoRR},
  volume    = {abs/2107.01654},
  year      = {2021},
  url       = {https://arxiv.org/abs/2107.01654},
  eprinttype = {arXiv},
  eprint    = {2107.01654},
  timestamp = {Wed, 07 Jul 2021 15:23:11 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2107-01654.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@book{BraytonHMS84,
  author    = {R. K. Brayton and
               G. D. Hachtel and
               C. T. McMullen and
               A. L. Sangiovanni{-}Vincentelli},
  title     = {Logic Minimization Algorithms for {VLSI} Synthesis},
  series    = {The Kluwer International Series in Engineering and Computer Science},
  volume    = {2},
  publisher = {Springer},
  year      = {1984},
}

@inproceedings{Audemardetal22,
  author    = {G. Audemard and S. Bellart and L. Bounia and F. Koriche and J-M. Lagniez and P. Marquis},
  title     = {Trading Complexity for Sparsity in Random Forest Explanations},
  booktitle = {Proc. of AAAI'22},
  year      = {2022}
}

@article{DBLP:journals/corr/Doshi-VelezK17,
  author    = {F. Doshi{-}Velez and
               B. Kim},
  title     = {A Roadmap for a Rigorous Science of Interpretability},
  year      = {2017},
  eprinttype = {arXiv},
  eprint    = {1702.08608},
  timestamp = {Mon, 13 Aug 2018 16:47:09 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/Doshi-VelezK17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{Freund2002,
author = {Freund, Yoav and Schapire, Robert},
year = {2002},
month = {01},
pages = {},
title = {A decision - theoretic general - ization of on - line learning and an application t o boosting},
journal = {Journal of Computer and System Sciences - JCSS}
}

@inproceedings{DBLP:conf/eurocolt/FreundS95,
  author    = {Yoav Freund and
               Robert E. Schapire},
  editor    = {Paul M. B. Vit{\'{a}}nyi},
  title     = {A decision-theoretic generalization of on-line learning and an application
               to boosting},
  booktitle = {Computational Learning Theory, Second European Conference, EuroCOLT
               '95, Barcelona, Spain, March 13-15, 1995, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {904},
  pages     = {23--37},
  publisher = {Springer},
  year      = {1995},
}



@Book{SF2012,
  Title                    = {Boosting: Foundations and Algorithms},
  Author                   = {R.E. Schapire and Y. Freund},
  Publisher                = {MIT Press},
  Year                     = {2012},
}

@book{Schapire2014boosting,
  title={Boosting: Foundations and Algorithms},
  author={Schapire, R.E. and Freund, Y.},
  year={2014},
  publisher={MIT Press}
}

@inproceedings{DBLP:conf/ijcai/BacchusHJS18,
  author    = {Fahiem Bacchus and
               Antti Hyttinen and
               Matti J{\"{a}}rvisalo and
               Paul Saikko},
  editor    = {J{\'{e}}r{\^{o}}me Lang},
  title     = {Reduced Cost Fixing for Maximum Satisfiability},
  booktitle = {Proceedings of the Twenty-Seventh International Joint Conference on
               Artificial Intelligence, {IJCAI} 2018, July 13-19, 2018, Stockholm,
               Sweden},
  pages     = {5209--5213},
  publisher = {ijcai.org},
  year      = {2018},
  url       = {https://doi.org/10.24963/ijcai.2018/723},
  doi       = {10.24963/ijcai.2018/723},
  timestamp = {Tue, 20 Aug 2019 16:19:08 +0200},
  biburl    = {https://dblp.org/rec/conf/ijcai/BacchusHJS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{RibeiroSG18,
  author    = {M-T. Ribeiro and
               S. Singh and
               C. Guestrin},
  editor    = {Sheila A. McIlraith and
               Kilian Q. Weinberger},
  title     = {Anchors: High-Precision Model-Agnostic Explanations},
  booktitle = {Proceedings of the 32nd {AAAI} Conference on Artificial Intelligence},
  pages     = {1527--1535},
  year      = {2018}
}

@inproceedings{NarodytskaB14,
  author    = {N. Narodytska and
               F. Bacchus},
  title     = {Maximum Satisfiability Using Core-Guided {MaxSAT} Resolution},
  booktitle = {Proceedings of the 28th {AAAI} Conference on Artificial Intelligence},
  pages     = {2717--2723},
  year      = {2014}
}

@inproceedings{SaikkoBJ16,
  author    = {P. Saikko and
               J. Berg and
               M. J{\"{a}}rvisalo},
  title     = {{LMHS:} {A} {SAT-IP} Hybrid {MaxSAT} Solver},
  booktitle = {Proceedings of the 19th International Conference of Theory and Applications of Satisfiability Testing ({SAT}'16)},
  pages     = {539--546},
  year      = {2016}
}

@article{muser,
  author    = {Anton Belov and
               Jo{\~{a}}o Marques{-}Silva},
  title     = {MUSer2: An Efficient {MUS} Extractor},
  journal   = {J. Satisf. Boolean Model. Comput.},
  volume    = {8},
  number    = {3/4},
  pages     = {123--128},
  year      = {2012},
}

@article{Darwiche2021OnQL,
  title={On Quantifying Literals in Boolean Logic and Its Applications to Explainable AI},
  author={Adnan Darwiche and Pierre Marquis},
  journal={J. Artif. Intell. Res.},
  year={2021},
  volume={72},
  pages={285-328},
  url={https://api.semanticscholar.org/CorpusID:237266858}
}

@article{Barcelo2020ModelIT,
  title={Model Interpretability through the Lens of Computational Complexity},
  author={Pablo Barcelo and Mika{\"e}l Monet and Jorge A. Perez and Bernardo Subercaseaux},
  year={2020},
  volume={abs/2010.12265},
}

@article{scikit-learn,
  title   = {Scikit-learn: Machine Learning in {P}ython},
  author  = {Pedregosa, F. and Varoquaux, G. and Gramfort, A. and Michel, V.
         and Thirion, B. and Grisel, O. and Blondel, M. and Prettenhofer, P.
         and Weiss, R. and Dubourg, V. and Vanderplas, J. and Passos, A. and
         Cournapeau, D. and Brucher, M. and Perrot, M. and Duchesnay, E.},
  journal = {Journal of Machine Learning Research},
  volume  = {12},
  pages   = {2825--2830},
  year    = {2011}
}


@inproceedings{IgnatievMM18,
  author    = {A. Ignatiev and
               A. Morgado and
               J. Marques{-}Silva},
  title     = {{PySAT:} {A} Python Toolkit for Prototyping with {SAT} Oracles},
  booktitle = {Proceedings of the 21st
               International Conference on Theory and Applications of Satisfiability Testing ({SAT}'2018)},
  pages     = {428--437},
  year      = {2018},
 }

@inproceedings{Choi2020,
  author    = {A. Choi and A. Shih and A. Goyanka and A. Darwiche},
  title     = {On Symbolically Encoding the Behavior of Random Forests},
  year      = {2020},
  booktitle= {Proceedings of the 3rd Workshop on Formal Methods for ML-Enabled Autonomous Systems (FoMLAS)}
}


@inproceedings{Benard2021,
  author    = {C. B{\'{e}}nard and
               G. Biau and
               S. Da~Veiga and
               E. Scornet},
  title     = {Interpretable Random Forests via Rule Extraction},
  booktitle = {Proceedings of the 24th International Conference on Artificial Intelligence and Statistics,
               {AISTATS}'21},
  OPTseries    = {Proceedings of Machine Learning Research},
  OPTvolume    = {130},
  pages     = {937--945},
  OPTpublisher = {{PMLR}},
  year      = {2021}, 
}

@article{Alves2018,
  title    = {Crime prediction through urban metrics and statistical learning},
  journal  = {Physica A: Statistical Mechanics and its Applications},
  volume   = {505},
  pages    = {435-443},
  year     = {2018},
  author   = {L. Alves and H. Ribeiro and F. Rodrigues},
}

@misc{alvarezmelis2018,
      title={On the Robustness of Interpretability Methods}, 
      author={David Alvarez-Melis and Tommi S. Jaakkola},
      year={2018},
      eprint={1806.08049},
      archivePrefix={arXiv},
      primaryClass={cs.LG},
      url={https://arxiv.org/abs/1806.08049}, 
}

@article{Azar2014,
title = {A random forest classifier for lymph diseases},
journal = {Computer Methods and Programs in Biomedicine},
volume = {113},
year = {2014},
author = {A.~T. Azar and H.~I. Elshazly and A.~E. Hassanien and A.~M. Elkorany}
}

@inproceedings{Xuan2018,
  author    = {Xuan, S. and Liu, G. and Li, Z. and Zheng, L. and Wang, S. and Jiang, C.},
  booktitle = {Proceedings of IEEE 15th International Conference on Networking, Sensing and Control (ICNSC)},
  title     = {Random forest for credit card fraud detection},
  year      = {2018},
  pages     = {1-6},
}
@book{Criminisi2013,
  title     = {Decision Forests for Computer Vision and Medical Image Analysis},
  author    = {Criminisi, A. and Shotton, J.},
  series    = {Advances in Computer Vision and Pattern Recognition},
  year      = {2013},
  publisher = {Springer}
}

@Article{XCM,
AUTHOR = {Fauvel, Kevin and Lin, Tao and Masson, Véronique and Fromont, Élisa and Termier, Alexandre},
TITLE = {XCM: An Explainable Convolutional Neural Network for Multivariate Time Series Classification},
JOURNAL = {Mathematics},
VOLUME = {9},
YEAR = {2021},
NUMBER = {23},
ARTICLE-NUMBER = {3137},
}

@article{JoaSHAP,
  title={On the failings of Shapley values for explainability},
  author={Xuanxiang Huang and Jo{\~a}o Marques-Silva},
  journal={Int. J. Approx. Reason.},
  year={2024},
  volume={171},
  pages={109112},
}

@article{DBLP:journals/corr/SelvarajuDVCPB16,
  author       = {Ramprasaath R. Selvaraju and
                  Abhishek Das and
                  Ramakrishna Vedantam and
                  Michael Cogswell and
                  Devi Parikh and
                  Dhruv Batra},
  title        = {Grad-CAM: Why did you say that? Visual Explanations from Deep Networks
                  via Gradient-based Localization},
  journal      = {CoRR},
  volume       = {abs/1610.02391},
  year         = {2016},
  url          = {http://arxiv.org/abs/1610.02391},
  eprinttype    = {arXiv},
  eprint       = {1610.02391},
  timestamp    = {Mon, 13 Aug 2018 16:46:58 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/SelvarajuDVCPB16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{Danilevsky2020ASO,
  title={A Survey of the State of Explainable AI for Natural Language Processing},
  author={Marina Danilevsky and Kun Qian and Ranit Aharonov and Yannis Katsis and Ban Kawas and Prithviraj Sen},
  booktitle={AACL},
  year={2020}
}

@article{JoaNeurips,
  title={Explaining Naive Bayes and Other Linear Classifiers with Polynomial Time and Delay},
  author={Joao Marques-Silva and Thomas Gerspacher and Martin C. Cooper and Alexey Ignatiev and Nina Narodytska},
  journal={ArXiv},
  year={2020},
  volume={abs/2008.05803},
}

@article{JoaoLogicXAI,
  title={Logic-Based Explainability in Machine Learning},
  author={Joao Marques-Silva},
  journal={ArXiv},
  year={2023},
  volume={abs/2211.00541}
}

@inproceedings{Robnik2018,
  title={Perturbation-Based Explanations of Prediction Models},
  author={M. Robnik-Sikonja and Marko Bohanec},
  booktitle={Human and Machine Learning},
  year={2018}
}

@article{Preece2018,
  title={Stakeholders in Explainable AI},
  author={Alun David Preece and Daniel Harborne and Dave Braines and Richard J. Tomsett and Supriyo Chakraborty},
  journal={ArXiv},
  year={2018},
  volume={abs/1810.00184}
}

@article{Hstad2001SomeOI,
  title={Some optimal inapproximability results},
  author={Johan H{\aa}stad},
  journal={Electron. Colloquium Comput. Complex.},
  year={2001},
  volume={TR97},
  url={https://api.semanticscholar.org/CorpusID:5120748}
}

@article{Rudin2018PleaseSE,
  title={Please Stop Explaining Black Box Models for High Stakes Decisions},
  author={Cynthia Rudin},
  journal={ArXiv},
  year={2018},
  volume={abs/1811.10154},
  url={https://api.semanticscholar.org/CorpusID:53747370}
}

@article{Letham2015InterpretableCU,
  title={Interpretable classifiers using rules and Bayesian analysis: Building a better stroke prediction model},
  author={Benjamin Letham and Cynthia Rudin and Tyler H. McCormick and David Madigan},
  journal={ArXiv},
  year={2015},
  volume={abs/1511.01644},
  url={https://api.semanticscholar.org/CorpusID:17699665}
}

@article{DiLeo2020StatisticalSP,
  title={Statistical significance: p value, 0.05 threshold, and applications to radiomics—reasons for a conservative approach},
  author={Giovanni Di Leo and Francesco Sardanelli},
  journal={European Radiology Experimental},
  year={2020},
  volume={4},
  url={https://api.semanticscholar.org/CorpusID:212655143}
}

@book{Biere2021,
  author    = {Armin Biere and Hans van Maaren},
  title     = {Handbook of Satisfiability},
  edition   = {Second},
  year      = {2021},
  publisher = {IOS Press},
}

@inproceedings{Iyer2013SubmodularOW,
  title={Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints},
  author={Rishabh K. Iyer and Jeff A. Bilmes},
  booktitle = {Proc. of NeurIPS'13},
  year={2013},
}

@article{Wolsey1982,
  author = {L. A. Wolsey},
  title = {An analysis of the greedy algorithm for the submodular set covering problem},
  journal = {Combinatorica},
  volume = {2},
  number = {4},
  pages = {385--393},
  year = {1982}
}


@phdthesis{bousmar2018conception,
  author = {Khadija Bousmar},
  title = {Conception d'un solveur matériel spécifique pour la résolution rapide du problème SAT appliqué à l'évaluation du risque en génie industriel},
  year = {2018},
  school = {Université de Lorraine},
  address = {Metz, France},
  type = {Thèse de doctorat},
}

@inproceedings{GreedyGood,
  title={Greed is Still Good: Maximizing Monotone Submodular+Supermodular Functions},
  author={Wenruo Bai and Jeff A. Bilmes},
  booktitle={International Conference on Machine Learning},
  year={2018},
}

@book{cormen2009introduction,
  author    = {Thomas H. Cormen and Charles E. Leiserson and Ronald L. Rivest and Clifford Stein},
  title     = {Introduction to Algorithms},
  edition   = {3rd},
  year      = {2009},
  publisher = {MIT Press}
}

@book{masinde2024emerging,
  title     = {Emerging Technologies for Developing Countries},
  author    = {Muthoni Masinde and Sabine Möbs and Antoine Bagula},
  editor    = {Muthoni Masinde and Sabine Möbs and Antoine Bagula},
  year      = {2024},
  publisher = {Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering},
  volume    = {520},
  series    = {LNICST},
  note      = {6th EAI International Conference, AFRICATEK 2023, Arusha, Tanzania, December 11–13, 2023},
}

@inproceedings{hu2022optimizing,
  title={Optimizing Binary Decision Diagrams with MaxSAT for Classification},
  author={Hu, Hao and Huguet, Marie-José and Siala, Mohamed},
  booktitle={Proceedings of the AAAI Conference on Artificial Intelligence},
  volume={36},
  number={4},
  pages={AAAI Technical Track on Constraint Satisfaction and Optimization},
  year={2022},
  doi={10.1609/aaai.v36i4.20291}
}

@book{nemhauser1988integer,
  title={Integer and Combinatorial Optimization},
  author={Nemhauser, George and Wolsey, Laurence},
  year={1988},
  series={Wiley-Interscience Series in Discrete Mathematics and Optimization},
  publisher={John Wiley \& Sons, Inc.},
  address={New York},
}


@article{Ignatiev2020OnR,
  title={On Relating 'Why?' and 'Why Not?' Explanations},
  author={Alexey Ignatiev and Nina Narodytska and Nicholas Asher and Joao Marques-Silva},
  journal={ArXiv},
  year={2020},
  volume={abs/2012.11067}
}

@inproceedings{huang2022tractable,
  title={Tractable explanations for d-DNNF classifiers},
  author={Huang, Xuanxiang and Izza, Yacine and Ignatiev, Alexey and Cooper, Martin and Asher, Nicholas and Marques-Silva, João},
  booktitle={Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI)},
  pages={5719--5728},
  year={2022}
}

@article{Nauta2022FromAE,
  title={From Anecdotal Evidence to Quantitative Evaluation Methods: A Systematic Review on Evaluating Explainable AI},
  author={Meike Nauta and Jan Trienes and Shreyasi Pathak and Elisa Nguyen and Michelle Peters and Yasmin Schmitt and J{\"o}rg Schl{\"o}tterer and Maurice van Keulen and Christin Seifert},
  journal={ACM Computing Surveys},
  year={2022}
}

@article{Chattopadhyay2017GradCAMGG,
  title={Grad-CAM++: Generalized Gradient-Based Visual Explanations for Deep Convolutional Networks},
  author={Aditya Chattopadhyay and Anirban Sarkar and Prantik Howlader and Vineeth N. Balasubramanian},
  journal={2018 IEEE Winter Conference on Applications of Computer Vision (WACV)},
  year={2017},
  pages={839-847}
}



@book{PapadimitriouS82,
  author       = {Christos H. Papadimitriou and
                  Kenneth Steiglitz},
  title        = {Combinatorial Optimization: Algorithms and Complexity},
  publisher    = {Prentice-Hall},
  year         = {1982},
  isbn         = {0-13-152462-3},
  timestamp    = {Thu, 03 Jan 2002 11:51:41 +0100},
  biburl       = {https://dblp.org/rec/books/ph/PapadimitriouS82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@book{Creignou2001,
author = {Creignou, Nadia and Khanna, Sanjeev and Sudan, Madhu},
title = {Complexity Classifications of Boolean Constraint Satisfaction Problems},
publisher = {Society for Industrial and Applied Mathematics},
year = {2001},
doi = {10.1137/1.9780898718546},
address = {},
edition   = {},
URL = {https://epubs.siam.org/doi/abs/10.1137/1.9780898718546},
eprint = {https://epubs.siam.org/doi/pdf/10.1137/1.9780898718546}
}

@article{JoaoGame,
  author    = {Joao Marques-Silva and Xuanxiang Huang},
  title     = {Explainability Is Not a Game},
  journal   = {Communications of the ACM},
  year      = {2024},
}

@inproceedings{Dhurandhar2018,
  title={Explanations based on the Missing: Towards Contrastive Explanations with Pertinent Negatives},
  author={Amit Dhurandhar and Pin-Yu Chen and Ronny Luss and Chun-Chen Tu and Pai-Shun Ting and Karthikeyan Shanmugam and Payel Das},
  booktitle={Neural Information Processing Systems},
  year={2018}
}

@article{Chen2012,
  title    = {Random forests for genomic data analysis},
  journal  = {Genomics},
  volume   = {99},
  number   = {6},
  pages    = {323-329},
  year     = {2012},
  author   = {X. Chen and H. Ishwaran},
}

@article{Cutleretal2007,
  author   = {Cutler, R. and Thomas, C.~E.~Jr. and Beard, K.~H. and Cutler, A. and Hess, K.~T. and Gibson, J. and Lawler, J.~J.},
  title    = {Random Forests for Classification in Ecology},
  journal  = {Ecology},
  volume   = {88},
  number   = {11},
  pages    = {2783-2792},
  year     = {2007}
}

@inproceedings{BooleanF,
  title={Boolean Functions - Theory, Algorithms, and Applications},
  author={Yves Crama and Peter L. Hammer},
  booktitle={Encyclopedia of mathematics and its applications},
  year={2011}
}

@inproceedings{Bogomolov2014,
  author    = {A. Bogomolov and
               B. Lepri and
               J. Staiano and
               N. Oliver and
               F. Pianesi and
               A. Pentland},
  title     = {Once Upon a Crime: Towards Crime Prediction from Demographics and
               Mobile Data},
  booktitle = {Proceedings of the 16th International Conference on Multimodal Interaction,
               {ICMI}'14},
  pages     = {427--434},
  publisher = {{ACM}},
  year      = {2014},
}

@article{Ozcift2011,
  title    = {Random forests ensemble classifier trained with data resampling strategy to improve cardiac arrhythmia diagnosis},
  journal  = {Computers in Biology and Medicine},
  volume   = {41},
  number   = {5},
  pages    = {265-271},
  year     = {2011},
  author   = {Akin \"Ozcift},
}

@article{Biau12,
  author    = {G. Biau},
  title     = {Analysis of a Random Forests Model},
  journal   = {Journal of Machine Learning Research},
  volume    = {13},
  pages     = {1063--1095},
  year      = {2012},
}

@article{Scornet16,
  author    = {E. Scornet},
  title     = {On the asymptotics of random forests},
  journal   = {J. Multivar. Anal.},
  volume    = {146},
  pages     = {72--83},
  year      = {2016},
}

@inproceedings{TangGL18,
  author    = {C. Tang and
               D. Garreau and
               U. von~Luxburg},
  title     = {When do random forests fail?},
  booktitle = {Advances in Neural Information Processing Systems 31: Annual Conference
               on Neural Information Processing Systems},
  pages     = {2987--2997},
  year      = {2018},
}

@article{DoshiVelezK17,
  author        = {F. Doshi{-}Velez and
               B. Kim},
  title         = {A Roadmap for a Rigorous Science of Interpretability},
  journal       = {CoRR},
  volume        = {abs/1702.08608},
  year          = {2017},
  url           = {http://arxiv.org/abs/1702.08608},
  archiveprefix = {arXiv},
}

@inproceedings{DBLP:conf/ijcai/AnsoteguiDG15,
  author    = {C. Ans{\'{o}}tegui and
               F. Didier and
               J. Gab{\`{a}}s},
  title     = {Exploiting the Structure of Unsatisfiable Cores in {MaxSAT}},
  booktitle = {Proceedings of the 24th International Joint Conference on
               Artificial Intelligence ({IJCAI}'15)}, 
  pages     = {283--289},
  publisher = {{AAAI} Press},
  year      = {2015},
}

@article{AnsoteguiBL13,
  author    = {C. Ans{\'{o}}tegui and
               M.~L. Bonet and
               J. Levy},
  title     = {{SAT}-based {MaxSAT} algorithms},
  journal   = {Artificial Intelligence},
  volume    = {196},
  pages     = {77--105},
  year      = {2013},
}

@inproceedings{AudemardLS13,
  author    = {G. Audemard and
               J-M. Lagniez and
               L. Simon},
  title     = {Improving Glucose for Incremental {SAT} Solving with Assumptions:
               Application to {MUS} Extraction},
  booktitle = {Proceedings of the 16th International Conference on Theory and Applications of Satisfiability Testing ({SAT}'13)},
  pages     = {309--317},
  year      = {2013},
}

@article{MorgadoIM14,
  author    = {A. Morgado and
               A. Ignatiev and
               J. Marques{-}Silva},
  title     = {{MSCG:} Robust Core-Guided {MaxSAT} Solving},
  journal   = {J. Satisf. Boolean Model. Comput.},
  volume    = {9},
  number    = {1},
  pages     = {129--134},
  year      = {2014},
}

@inproceedings{IgnatievPLM15,
  author    = {A. Ignatiev and
               A. Previti and
               M. Liffiton and
               J. Marques{-}Silva},
  title     = {Smallest {MUS} Extraction with Minimal Hitting Set Dualization},
  booktitle = {Proceedings of the 21st International Conference on Principles and Practice of Constraint Programming ({CP}'15)},
  pages     = {173--182},
  year      = {2015},
}

@article{LiffitonPMM16,
  author    = {M. Liffiton and
               A. Previti and
               A. Malik and
               J. Marques{-}Silva},
  title     = {Fast, flexible {MUS} enumeration},
  journal   = {Constraints An Int. J.},
  volume    = {21},
  number    = {2},
  pages     = {223--250},
  year      = {2016},
}

@article{MarquesSilvaJM17,
  author    = {J. Marques{-}Silva and
               M. Janota and
               C. Menc{\'{\i}}a},
  title     = {Minimal sets on propositional formulae. {P}roblems and reductions},
  journal   = {Artificial Intelligence},
  volume    = {252},
  pages     = {22--50},
  year      = {2017},
}

@inproceedings{IzzaRF,
  author    = {Y. Izza and J. Marques-Silva},
  title     = {On Explaining Random Forests with {SAT}},
  booktitle = {Proc. of IJCAI'21},
  year      = {2021},
}

@article{DBLP:journals/ai/Liberatore05,
  author    = {P. Liberatore},
  title     = {Redundancy in logic {I:} {CNF} propositional formulae},
  journal   = {Artificial Intelligence},
  volume    = {163},
  number    = {2},
  pages     = {203--232},
  year      = {2005},
}

@inproceedings{Audemardexample,
  author       = {Gilles Audemard and
                  Jean{-}Marie Lagniez and
                  Pierre Marquis and
                  Nicolas Szczepanski},
  title        = {On the Computation of Example-Based Abductive Explanations for Random
                  Forests},
  booktitle    = {Proceedings of the Thirty-Third International Joint Conference on
                  Artificial Intelligence, {IJCAI} 2024, Jeju, South Korea, August 3-9,
                  2024},
  year         = {2024},
}


@article{Goldsmith2008,
  title    = {Complexity of {DNF} minimization and isomorphism testing for monotone formulas},
  journal  = {Information and Computation},
  volume   = {206},
  number   = {6},
  pages    = {760 - 775},
  year     = {2008},
  author   = {J. Goldsmith and M. Hagen and M. Mundhenk},
}

@article{Umans2001,
  author    = {Christopher Umans},
  title     = {The Minimum Equivalent {DNF} Problem and Shortest Implicants},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {63},
  number    = {4},
  pages     = {597--611},
  year      = {2001},
 }
 
@article{Umans2006,
  author  = {C. {Umans} and T. {Villa} and A. L. {Sangiovanni-Vincentelli}},
  journal = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
  title   = {Complexity of two-level logic minimization},
  year    = {2006},
  volume  = {25},
  number  = {7},
  pages   = {1230-1246},
}

@article{Lipton18,
  author    = {Z. C. Lipton},
  title     = {The mythos of model interpretability},
  journal   = {ACM},
  volume    = {61},
  number    = {10},
  pages     = {36--43},
  year      = {2018},
}

@inproceedings{DBLP:conf/ijcai/0002C20,
  author    = {R. Srinivasan and
               A. Chander},
  title     = {Explanation Perspectives from the Cognitive Sciences - {A} Survey},
  booktitle = {Proc. of IJCAI'20},
  pages     = {4812--4818},
  year      = {2020},
}

@article{DBLP:journals/corr/abs-1802-00682,
  author    = {M. Narayanan and
               E. Chen and
               J. He and
               B. Kim and
               S. Gershman and
               F. Doshi{-}Velez},
  title     = {How do Humans Understand Explanations from Machine Learning Systems?
               An Evaluation of the Human-Interpretability of Explanation},
  journal   = {CoRR},
  volume    = {abs/1802.00682},
  year      = {2018},
  url       = {http://arxiv.org/abs/1802.00682},
  archivePrefix = {arXiv},
}

@article{DBLP:journals/ai/AnsoteguiG17,
  author    = {C. Ans{\'{o}}tegui and
               J. Gab{\`{a}}s},
  title     = {{WPM3:} An (in)complete algorithm for weighted partial {MaxSAT}},
  journal   = {Artificial Intelligence},
  volume    = {250},
  pages     = {37--57},
  year      = {2017},
}

@String{uai94 = {Proc. of the $10^{th}$ Conference on Uncertainty
                  in Artificial Intelligence (UAI'94)}}
  
                  @article{WALDCHEN2020,
                  author    = {S. W{\"{a}}ldchen and
                               J. MacDonald and
                               S. Hauch and
                               G. Kutyniok},
                  title     = {The Computational Complexity of Understanding Network Decisions},
                  journal   = {CoRR},
                  volume    = {abs/1905.09163},
                  year      = {2019},
                  url       = {http://arxiv.org/abs/1905.09163}
                } 
                  
@article{SLAVIK1997,
  title    = {A Tight Analysis of the Greedy Algorithm for Set Cover},
  journal  = {Journal of Algorithms},
  volume   = {25},
  number   = {2},
  pages    = {237 - 254},
  year     = {1997},
  author   = {P. Slav\'ik},
}

@article{OKUN2005,
  title    = {On approximation of the vertex cover problem in hypergraphs},
  journal  = {Discrete Optimization},
  volume   = {2},
  number   = {1},
  pages    = {101 - 111},
  year     = {2005},
  author   = {M. Okun},
}                  

 @InBook{Oswaldetal04,
  author = 	 {M.E. Oswald and S. Grosjean},
  title = 	 {Confirmation bias},
  series = 	 {Cognitive illusions: A handbook on fallacies and biases in thinking, judgement and memory},
  publisher = 	 {Psychology Press},
  year = 	 {2004},
  pages = 	 {79–96},
}   

@article{audemard2022pouvoir,
  title={Sur le pouvoir explicatif des arbres de d{\'e}cision},
  author={Audemard, Gilles and Bellart, Steve and Bounia, Louenas and Koriche, Fr{\'e}d{\'e}ric and Lagniez, Jean-Marie and Marquis, Pierre},
  journal={EGC'2022},
  volume={38},
  year={2022},
  publisher={BoD-Books on Demand}
}

@article{diversité,
  title={Gestion de la diversité et enjeux de GRH},
  author={Garner-Moyer, Hélène},
  journal={EGC'2022},
  volume={7},
  year={2006},
  publisher={Management & Avenir}
}

@misc{doshivelez2017rigorous,
      title={Towards A Rigorous Science of Interpretable Machine Learning}, 
      author={F. Doshi-Velez and B. Kim},
      year={2017},
      eprint={1702.08608},
      archivePrefix={arXiv},
      primaryClass={stat.ML}
}
               
  @inproceedings{shi2020tractable,
  author    = {W. Shi and A. Shih and A. Darwiche and A. Choi},
  title     = {On Tractable Representations of Binary Neural Networks},
  booktitle = {Proc. of KR'20},
  year      = {2020},
  pages = {882-892},
}
 
 @inproceedings{Audemardetal20,
  author    = {G. Audemard and
               F. Koriche and
               P. Marquis},
  title     = {On Tractable {XAI} Queries based on Compiled Representations},
  booktitle = {Proc. of KR'20},
  year      = {2020},
  pages = {838-849},
}

 @inproceedings{CosteMarquis20,
  author    = {S. Coste-Marquis and P. Marquis},
  title     = {From Explanations to Intelligible Explanations},
  booktitle = {Proc. of XLoKR'20, workshop at KR'20},
  year      = {2020},
  url = {https://lat.inf.tu-dresden.de/XLoKR20/},
}
 
 @inproceedings{Choietal20,
  author    = {A. Choi and
               A. Shih and A. Goyanka and
               A. Darwiche},
  title     = {On Symbolically Encoding the Behavior of Random Forests},
  booktitle = {Proc. of FoMLAS'20, 3rd Workshop on Formal Methods for ML-Enabled Autonomous Systems, Workshop at CAV'20},
  year      = {2020},
  OPTpages = {},
}

@article{Miller56,
  author    = {G. A. Miller},
  title     = {The Magical Number Seven, Plus or Minus Two: Some Limits On Our Capacity For Processing Information},
  journal   = {The Psychological Review},
  volume    = {63},
  year      = {1956},
}
           
@article{Quinlan86,
  author    = {J. R. Quinlan},
  title     = {Induction of Decision Trees},
  journal   = {Machine Learning},
  volume    = {1},
  number    = {1},
  pages     = {81--106},
  year      = {1986},
}

@book{DBLP:books/wa/BreimanFOS84,
  author    = {L. Breiman and
               J. H. Friedman and
               R. A. Olshen and
               C. J. Stone},
  title     = {Classification and Regression Trees},
  publisher = {Wadsworth},
  year      = {1984},
}

@article{DBLP:journals/ml/Breiman96b,
  author    = {L. Breiman},
  title     = {Bagging Predictors},
  journal   = {Machine Learning},
  volume    = {24},
  number    = {2},
  pages     = {123--140},
  year      = {1996},
}

@article{Breiman01,
  author    = {L. Breiman},
  title     = {Random Forests},
  journal   = {Machine Learning},
  volume    = {45},
  number    = {1},
  pages     = {5--32},
  year      = {2001},
}

@article{DBLP:journals/pami/Ho98,
  author    = {T. Kam Ho},
  title     = {The Random Subspace Method for Constructing Decision Forests},
  journal   = {{IEEE} Transactions on Pattern Analysis and Machine Intelligence},
  volume    = {20},
  number    = {8},
  pages     = {832--844},
  year      = {1998},
}
                  
@Book{Molnar19,
  author = 	 {Ch. Molnar},
  title = 	 {Interpretable Machine Learning - A Guide for Making Black Box Models Explainable},
  year = 	 {2019},
}
                  
@inproceedings{Goldsmithetal05,
  author    = {Judy Goldsmith and
               Matthias Hagen and
               Martin Mundhenk},
  title     = {Complexity of {DNF} and Isomorphism of Monotone Formulas},
  booktitle = {Proc. of MFCS'05},
  pages     = {410--421},
  year      = {2005},
}
                
@inproceedings{DBLP:conf/sat/NarodytskaSMIM19,
  author    = {N. Narodytska and
               A. Shrotri and
               K. Meel and
               A. Ignatiev and
               J. Marques{-}Silva},
  title     = {Assessing Heuristic Machine Learning Explanations with Model Counting},
  booktitle = {Proceedings of 22nd International Conference on the Theory and Applications of Satisfiability Testing ({SAT}'19)},
  pages     = {267--278},
  year      = {2019},
}

@inproceedings{deKleer89,
  author    = {J. de Kleer},
  title     = {A Comparison of {ATMS} and {CSP} Techniques},
  booktitle = {Proc. of  IJCAI'89},
  pages     = {290--296},
  year      = {1989},
}

@article{Cooper23,
title = {Tractability of explaining classifier decisions},
journal = {Artificial Intelligence},
year = {2023},
doi = {https://doi.org/10.1016/j.artint.2022.103841},
author = {Martin C. Cooper and João Marques-Silva},
}

@article{Wldchen2021TheCC,
  title={The Computational Complexity of Understanding Binary Classifier Decisions},
  author={Stephan W{\"a}ldchen and Jan Macdonald and Sascha Hauch and Gitta Kutyniok},
  journal={J. Artif. Intell. Res.},
  year={2021},
  volume={70},
  pages={351-387},
  url={https://api.semanticscholar.org/CorpusID:231731967}
}

@inproceedings{Ignatievmaxst,
  title={Using MaxSAT for Efficient Explanations of Tree Ensembles},
  author={Alexey Ignatiev and Yacine Izza and Peter J. Stuckey and Joao Marques-Silva},
  booktitle={AAAI Conference on Artificial Intelligence},
  year={2022},
  url={https://api.semanticscholar.org/CorpusID:250298105}
}

@phdthesis{Mosaadthesis,
author = {Mosaad, Hagar},
year = {2017},
month = {08},
pages = {},
title = {ARRIVAL: A zero-player graph game}
}

@inproceedings{Narodytska2018DT,
  title={Learning Optimal Decision Trees with SAT},
  author={Nina Narodytska and Alexey Ignatiev and Filipe Pereira and Joao Marques-Silva},
  booktitle={International Joint Conference on Artificial Intelligence},
  year={2018},
}

@inproceedings{Hu2022,
  title={Optimizing Binary Decision Diagrams with MaxSAT for classification},
  author={Hao Hu and Marie-Jos{\'e} Huguet and M. Siala},
  booktitle={AAAI Conference on Artificial Intelligence},
  year={2022},
}

@inproceedings{blanc2021provably,
title={Provably efficient, succinct, and precise explanations},
author={Guy Blanc and Jane Lange and Li-Yang Tan},
booktitle={Advances in Neural Information Processing Systems},
editor={A. Beygelzimer and Y. Dauphin and P. Liang and J. Wortman Vaughan},
year={2021},
url={https://openreview.net/forum?id=9UjRw5bqURS}
}

@inproceedings{Walsh00,
  author    = {T. Walsh},
  title     = {{SAT} v {CSP}},
  booktitle = {Proc. of CP'00},
  pages     = {441--456},
  year      = {2000},
 }           
                
@inproceedings{Lime16,
  author    = {M. T. Ribeiro and
               S. Singh and
               C. Guestrin},
  title     = {"Why Should {I} Trust You?": Explaining the Predictions of Any Classifier},
  booktitle = {Proc. of SIGKDD'16},
  pages     = {1135--1144},
  OPTpublisher = {{ACM}},
  year      = {2016},
}

@inproceedings{Anchor18,
  author    = {M. T. Ribeiro and
               S. Singh and
               C. Guestrin},
  title     = {Anchors: High-Precision Model-Agnostic Explanations},
  booktitle = {Proc. of AAAI'18},
  pages     = {1527--1535},
  year      = {2018},
}
                  
@inproceedings{ChanDarwiche03,
  author    = {Hei Chan and
               Adnan Darwiche},
  title     = {Reasoning about Bayesian Network Classifiers},
  booktitle = {Proc. of UAI'03},
  pages     = {107--115},
  year      = {2003},
}
                  
@article{Lagniezetal20,
  author    = {Jean{-}Marie Lagniez and
               Emmanuel Lonca and
               Pierre Marquis},
  title     = {Definability for model counting},
  journal   = {Artificial Intelligence},
  volume    = {281},
  pages     = {103229},
  year      = {2020},
}

@article{IzzaDT,
  title={On Explaining Decision Trees},
  author={Yacine Izza and Alexey Ignatiev and Joao Marques-Silva},
  journal={ArXiv},
  year={2020},
  volume={abs/2010.11034},
  url={https://api.semanticscholar.org/CorpusID:224814214}
}

@inproceedings{DarwicheH20,
  author    = {A. Darwiche and
               A. Hirth},
  title     = {On the Reasons Behind Decisions},
  booktitle = {Proc. of {ECAI}'20},
  year      = {2020},
}

@article{bounia2024enhancing,
  title     = {Enhancing the intelligibility of decision trees with concise and reliable probabilistic explanations},
  author    = {Louenas Bounia and Insaf Setitra},
  journal   = {Data \& Knowledge Engineering},
  year      = {2024},
  publisher = {North-Holland},
}

@article{LLM03,
  author    = {J. Lang and
               P. Liberatore and
               P. Marquis},
  title     = {Propositional Independence: Formula-Variable Independence and Forgetting},
  journal   = {Journal of Artificial Intelligence Research},
  volume    = {18},
  pages     = {391--443},
  year      = {2003},
}

@inbook{Coffman96,
author = {Coffman, Ed and Garey, M.R. and Johnson, David},
year = {1996},
month = {01},
pages = {46-93},
title = {Approximation Algorithms for NP-Hard Problems}
}

@inbook{Turing91,
author = {Alan TURING et Jean-Yves G IRARD},
year = {1991},
title = {La machine de Turing}
}

                  
@article{GuidottiMRTGP19,
  author  = {R. Guidotti and
               A. Monreale and
               S. Ruggieri and
               F. Turini and
               F. Giannotti and
               D. Pedreschi},
  title     = {A Survey of Methods for Explaining Black Box Models},
  journal   = {{ACM} Computing Surveys},
  volume    = {51},
  number    = {5},
  pages     = {93:1--93:42},
  year      = {2019},
}

@article{STOCKMEYER19761,
title = {The polynomial-time hierarchy},
journal = {Theoretical Computer Science},
volume = {3},
number = {1},
pages = {1-22},
year = {1976},
issn = {0304-3975},
doi = {https://doi.org/10.1016/0304-3975(76)90061-X},
url = {https://www.sciencedirect.com/science/article/pii/030439757690061X},
author = {Larry J. Stockmeyer},
}

@inproceedings{Leskovec2007CosteffectiveOD,
  title={Cost-effective outbreak detection in networks},
  author={Jure Leskovec and Andreas Krause and Carlos Guestrin and Christos Faloutsos and Jeanne M. Vanbriesen and Natalie S. Glance},
  booktitle={Knowledge Discovery and Data Mining},
  year={2007}
}

@article{Rivest1987,
author = {Rivest, Ronald L.},
title = {Learning Decision Lists},
year = {1987},
volume = {2},
journal = {Mach. Learn.},
pages = {229–246},
}

@article{Bagging1996,
  title={Bagging predictors},
  author={L. Breiman},
  journal={Machine Learning},
  year={1996},
  volume={24},
  pages={123-140}
}

@article{friedman2000,
author = {Friedman, Jerome and Hastie, Trevor and Tibshirani, Robert},
year = {2000},
month = {04},
pages = {337-407},
title = {Additive Logistic Regression: A Statistical View of Boosting},
volume = {28},
journal = {The Annals of Statistics},
doi = {10.1214/aos/1016218223}
}

@inproceedings{XGBoost,
author = {Chen, Tianqi and Guestrin, Carlos},
title = {XGBoost: A Scalable Tree Boosting System},
year = {2016},
isbn = {9781450342322},
address = {New York, NY, USA},
booktitle = {Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining},
pages = {785–794},
numpages = {10},
}



@article{friedmanBoosting,
author = {Friedman, Jerome},
year = {2000},
month = {11},
pages = {},
title = {Greedy Function Approximation: A Gradient Boosting Machine},
volume = {29},
journal = {The Annals of Statistics},
doi = {10.1214/aos/1013203451}
}

@book{Ensemble2,
author = {Zhou, Zhi-Hua},
year = {2012},
month = {06},
pages = {},
title = {Ensemble Methods: Foundations and Algorithms},
volume = {14},
isbn = {9781439830031},
journal = {Ensemble Methods: Foundations and Algorithms},
doi = {10.1201/b12207}
}

@inproceedings{Ensemble1,
author={Dietterich, Thomas G.},
title={Ensemble Methods in Machine Learning},
year={2000},
pages={1-15},
}


@article{OneR,
  title={Very Simple Classification Rules Perform Well on Most Commonly Used Datasets},
  author={Robert C. Holte},
  journal={Machine Learning},
  year={1993},
  volume={11},
  pages={63-90}
}

@inproceedings{KrauseNips2010,
 author = {Stobbe, Peter and Krause, Andreas},
 booktitle = {Advances in Neural Information Processing Systems},
 editor = {J. Lafferty and C. Williams and J. Shawe-Taylor and R. Zemel and A. Culotta},
 pages = {},
 publisher = {Curran Associates, Inc.},
 title = {Efficient Minimization of Decomposable Submodular Functions},
 url = {https://proceedings.neurips.cc/paper_files/paper/2010/file/6ea2ef7311b482724a9b7b0bc0dd85c6-Paper.pdf},
 volume = {23},
 year = {2010}
}

@inproceedings{Lecun1995,
author = {Lecun, Yann and Bengio, Y.},
year = {1995},
month = {01},
pages = {},
title = {Convolutional Networks for Images, Speech, and Time-Series},
journal = {The Handbook of Brain Theory and Neural Networks}
}

@article{LLM,
  title={Cramming: Training a Language Model on a Single GPU in One Day},
  author={Jonas Geiping and Tom Goldstein},
  journal={ArXiv},
  year={2022},
  volume={abs/2212.14034}
}

@inproceedings{DeepForest,
author = {Zhou, Zhi-Hua and Feng, Ji},
title = {Deep Forest: Towards an Alternative to Deep Neural Networks},
year = {2017},
isbn = {9780999241103},
publisher = {AAAI Press},
booktitle = {Proceedings of the 26th International Joint Conference on Artificial Intelligence},
pages = {3553–3559},
numpages = {7},
location = {Melbourne, Australia},
series = {IJCAI'17}
}

@inproceedings{LightGBM,
author = {Ke, Guolin and Meng, Qi and Finley, Thomas and Wang, Taifeng and Chen, Wei and Ma, Weidong and Ye, Qiwei and Liu, Tie-Yan},
title = {LightGBM: A Highly Efficient Gradient Boosting Decision Tree},
year = {2017},
isbn = {9781510860964},
publisher = {Curran Associates Inc.},
address = {Red Hook, NY, USA},
booktitle = {Proceedings of the 31st International Conference on Neural Information Processing Systems},
pages = {3149–3157},
numpages = {9},
location = {Long Beach, California, USA},
series = {NIPS'17}
}


Categories
Journals
Magazines
Books
Proceedings
SIGs
Conferences
Collections
People
About
About ACM Digital Library
ACM Digital Library B

@article{bert,
  title={BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding},
  author={Jacob Devlin and Ming-Wei Chang and Kenton Lee and Kristina Toutanova},
  journal={ArXiv},
  year={2019},
  volume={abs/1810.04805}
}

@article{lecun1990,
  title={Imagenet classification with deep convolutional neural networks},
  author={LeCun, Yann and Denker, J and Henderson, D and Howard, R and Hubbard, W and Jacke, L},
  journal={Advances in neural information processing systems},
  year={1990}
}

@inproceedings{Krause2007,
author = {Krause, Andreas and Guestrin, Carlos},
year = {2007},
month = {01},
pages = {1650-1654},
title = {Near-optimal Observation Selection using Submodular Functions.}
}

@inproceedings{Goodfellow2014,
 author = {Goodfellow, Ian and Pouget-Abadie, Jean and Mirza, Mehdi and Xu, Bing and Warde-Farley, David and Ozair, Sherjil and Courville, Aaron and Bengio, Yoshua},
 booktitle = {Advances in Neural Information Processing Systems},
 editor = {Z. Ghahramani and M. Welling and C. Cortes and N. Lawrence and K.Q. Weinberger},
 pages = {},
 publisher = {Curran Associates, Inc.},
 title = {Generative Adversarial Nets},
 volume = {27},
 year = {2014}
}

@inproceedings{Golovin2008,
 author = {Streeter, Matthew and Golovin, Daniel},
 booktitle = {Advances in Neural Information Processing Systems},
 editor = {D. Koller and D. Schuurmans and Y. Bengio and L. Bottou},
 pages = {},
 publisher = {Curran Associates, Inc.},
 title = {An Online Algorithm for Maximizing Submodular Functions},
 url = {https://proceedings.neurips.cc/paper_files/paper/2008/file/5751ec3e9a4feab575962e78e006250d-Paper.pdf},
 volume = {21},
 year = {2008}
}

@inproceedings{Lin2011,
    title = "A Class of Submodular Functions for Document Summarization",
    author = "Lin, Hui  and
      Bilmes, Jeff",
    booktitle = "Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies",
    month = jun,
    year = "2011",
    address = "Portland, Oregon, USA",
    publisher = "Association for Computational Linguistics",
    url = "https://aclanthology.org/P11-1052",
    pages = "510--520",
}

@article{Anthony2001,
author = {Anthony, Martin},
year = {2001},
month = {01},
pages = {},
title = {Discrete mathematics of neural networks: selected topics},
doi = {10.1137/1.9780898718539}
}

@article{Kohli2009,
author = {Kohli, Pushmeet and Kumar, M and Torr, Philip},
year = {2009},
month = {10},
pages = {1645-56},
title = {P³ & Beyond: Move Making Algorithms for Solving Higher Order Functions},
volume = {31},
journal = {IEEE transactions on pattern analysis and machine intelligence},
doi = {10.1109/TPAMI.2008.217}
}

@article{Kempe2003,
author = {Kempe, David and Kleinberg, Jon and Tardos, Éva},
year = {2003},
month = {07},
pages = {},
title = {Maximizing the Spread of Influence through a Social Network},
volume = {137-146},
journal = {Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining},
doi = {10.1145/956750.956769}
}

@article{COOK71,
  author    = {Stephen A. COOK},
  title     = {The complexity of theorem-proving procedures},
  journal   = {Third annual ACM symposium on Theory of computing},
  volume    = {267},
  pages     = {151–158},
  year      = {1971},
}

@article{Whitney1935OnTA,
  title={On the Abstract Properties of Linear Dependence},
  author={Hassler Whitney},
  journal={American Journal of Mathematics},
  year={1935},
  volume={57},
  pages={63-87}
}

@article{Colnet2022,
  title={On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits},
  author={Alexis de Colnet and Pierre Marquis},
  journal={ArXiv},
  year={2022},
  volume={abs/2301.13328},
  url={https://api.semanticscholar.org/CorpusID:247110969}
}


@article{Miller19,
  author    = {T. Miller},
  title     = {Explanation in artificial intelligence: Insights from the social sciences},
  journal   = {Artificial Intelligence},
  volume    = {267},
  year      = {2019},
}

@inproceedings{DBLP:conf/ecai/WangWTZ10,
  author    = {Z. Wang and
               K. Wang and
               R. W. Topor and
               X. Zhang},
  title     = {Tableau-based Forgetting in [Ascr ][Lscr ][Cscr {]} Ontologies},
  booktitle = {Proc. of ECAI'10},
  pages     = {47--52},
  year      = {2010},
}

@InProceedings{Marquis95,
  author = 	 {P. Marquis},
  title = 	 {Knowledge compilation using theory prime implicates},
  booktitle = 	 {Proc. of IJCAI'95},
  year = 	 {1995},
  pages = 	 {837--843}
}

@InProceedings{MarquisSadaoui96,
  author = 	 {P. Marquis and S. Sadaoui},
  title = 	 {A new algorithm for computing theory prime
		  implicates compilations},
  booktitle = 	 {Proc. of AAAI'96},
  year = 	 {1996},
  pages = 	 {504--509}
}

@book{Grice,
  author    = {P. H. Grice},
  title     = {Studies in the Way of Words},
  publisher = {Harvard University Press},
  year      = {1989},
}

@inproceedings{DBLP:conf/aaai/ErdemF07,
  author    = {E. Erdem and
               P. Ferraris},
  title     = {Forgetting Actions in Domain Descriptions},
  booktitle = {Proc. of AAAI'07},
  pages     = {409--414},
  year      = {2007},
}

@article{DBLP:journals/synthese/DitmarschHLM09,
  author    = {H. van Ditmarsch and
               A. Herzig and
               J. Lang and
               P. Marquis},
  title     = {Introspective forgetting},
  journal   = {Synthese},
  volume    = {169},
  number    = {2},
  pages     = {405--423},
  year      = {2009},
}

@article{DBLP:journals/ai/EiterW08,
  author    = {Th. Eiter and
               K. Wang},
  title     = {Semantic forgetting in answer set programming},
  journal   = {Artificial Intelligence},
  volume    = {172},
  number    = {14},
  pages     = {1644--1672},
  year      = {2008},
}

@inproceedings{DBLP:conf/lpar/AntoniouEW12,
  author    = {G. Antoniou and
               Th. Eiter and
               K. Wang},
  title     = {Forgetting for Defeasible Logic},
  booktitle = {Proc. of LPAR'18},
  pages     = {77--91},
  year      = {2012},
}

@inproceedings{DBLP:conf/aaai/ZhouZ11,
  author    = {Y. Zhou and
               Y. Zhang},
  title     = {Bounded Forgetting},
  booktitle = {Proc. of AAAI'11},
  year      = {2011},
  }

@inproceedings{DBLP:conf/kr/ZhangZ10a,
  author    = {Y. Zhang and
               Y. Zhou},
  title     = {Forgetting Revisited},
  booktitle = {Proc. of KR'10},
  year      = {2010},
}

@article{DBLP:journals/ai/ZhangZ09,
  author    = {Y. Zhang and
               Y. Zhou},
  title     = {Knowledge forgetting: Properties and applications},
  journal   = {Artificial Intelligence},
  volume    = {173},
  number    = {16-17},
  pages     = {1525--1537},
  year      = {2009},
}

@article{DBLP:journals/jair/WangZZZ14,
  author    = {Y. Wang and
               Y. Zhang and
               Y. Zhou and
               M. Zhang},
  title     = {Knowledge Forgetting in Answer Set Programming},
  journal   = {Journal of Artificial Intelligence Research},
  volume    = {50},
  pages     = {31--70},
  year      = {2014},
}

@inproceedings{DBLP:conf/tableaux/Wernhard09,
  author    = {Ch. Wernhard},
  title     = {Tableaux for Projection Computation and Knowledge Compilation},
  booktitle = {Proc. of  TABLEAUX'09},
  pages     = {325--340},
  year      = {2009},
}

@inproceedings{DBLP:conf/jelia/Wernhard08,
  author    = {Ch. Wernhard},
  title     = {Literal Projection for First-Order Logic},
  booktitle = {Proc. of  JELIA'08},
  pages     = {389--402},
  year      = {2008},
}

@article{DBLP:journals/jair/Delgrande17,
  author    = {J. P. Delgrande},
  title     = {A Knowledge Level Account of Forgetting},
  journal   = {Journal of Artificial Intelligence Research},
  volume    = {60},
  pages     = {1165--1213},
  year      = {2017},
}

@inproceedings{DBLP:conf/cade/ZhaoS19,
  author    = {Y. Zhao and
               R. A. Schmidt},
  title     = {{FAME(Q):} An Automated Tool for Forgetting in Description Logics
               with Qualified Number Restrictions},
  booktitle = {Proc. of CADE'19},
  pages     = {568--579},
  year      = {2019},
}

@inproceedings{DBLP:conf/aaai/ZhaoASFSJK19,
  author    = {Y. Zhao and
               G. Alghamdi and
               R. A. Schmidt and
               H. Feng and
               G. Stoilos and
               D. Juric and
               M. Khodadadi},
  title     = {Tracking Logical Difference in Large-Scale Ontologies: {A} Forgetting-Based
               Approach},
  booktitle = {Proc. of AAAI'19},
  pages     = {3116--3124},
  year      = {2019},
}

@inproceedings{DBLP:conf/ijcai/LutzW11,
  author    = {C. Lutz and
               F. Wolter},
  title     = {Foundations for Uniform Interpolation and Forgetting in Expressive
               Description Logics},
  booktitle = {Proc. of IJCAI'11},
  pages     = {Proc. of 989--995},
  year      = {2011},
}

@Article{Bryant86,
author = {R. E. Bryant},
title = {Graph-based algorithms for {B}oolean function manipulation},
journal = {IEEE Transactions on Computers},
year = {1986},
volume = {C-35},
number = {8},
pages = {677--692}
}

@inproceedings{DBLP:conf/ijcai/BoothMS19,
  author    = {S. Booth and
               Ch. Muise and
               J. Shah},
  title     = {Evaluating the Interpretability of the Knowledge Compilation Map:
               Communicating Logical Statements Effectively},
  booktitle = {Proc. of IJCAI'19},
  pages     = {5801--5807},
  year      = {2019},
}

@InProceedings{LinReiter94,
 author = {F. Lin and R. Reiter},
 title = {Forget it!},
 booktitle = {Proc. of AAAI Fall Symposium on Relevance},
 year = {1994},
 pages = {154--159},
}

@article{DBLP:journals/ai/BylanderATJ91,
  author    = {T. Bylander and
               D. Allemang and
               M. C. Tanner and
               J. R. Josephson},
  title     = {The Computational Complexity of Abduction},
  journal   = {Artificial Intelligence},
  volume    = {49},
  number    = {1-3},
  pages     = {25--60},
  year      = {1991},
}

@Article{DeKleeretal92,
 author = {John de Kleer and Alan K. Mackworth and Ray Reiter},
 title = {Characterizing diagnoses and systems},
 journal = {Artificial Intelligence},
 year = {1992},
 volume = {56},
 pages = {197--222}
}

@Article{Reiter87,
  author = 	 {Ray Reiter},
  title = 	 {A theory of diagnosis from first principles},
  journal = 	 {Artificial Intelligence},
  year = 	 {1987},
  volume = 	 {32},
  pages = 	 {57--95}
}

@article{DBLP:journals/jacm/EiterG95,
  author    = {Th. Eiter and
               G. Gottlob},
  title     = {The Complexity of Logic-Based Abduction},
  journal   = {Journal of the {ACM}},
  volume    = {42},
  number    = {1},
  pages     = {3--42},
  year      = {1995},
}

@article{DBLP:journals/ai/NordhZ08,
  author    = {Gustav Nordh and
               Bruno Zanuttini},
  title     = {What makes propositional abduction tractable},
  journal   = {Artificial Intelligence},
  volume    = {172},
  number    = {10},
  pages     = {1245--1284},
  year      = {2008},
}

@inproceedings{DBLP:conf/aaai/FellowsPRR12,
  author    = {Michael R. Fellows and
               Andreas Pfandler and
               Frances A. Rosamond and
               Stefan R{\"{u}}mmele},
  title     = {The Parameterized Complexity of Abduction},
  booktitle = {Proc. of  AAAI'12},
  year      = {2012},
}

@inproceedings{DBLP:conf/sat/HeuleKM16,
  author    = {Marijn J. H. Heule and
               Oliver Kullmann and
               Victor W. Marek},
  title     = {Solving and Verifying the {B}oolean {P}ythagorean Triples Problem via
               Cube-and-Conquer},
  booktitle = {Proc. of  SAT'16},
  pages     = {228--245},
  year      = {2016},
}

@article{Chen2019,
  title={Robustness Verification of Tree-based Models},
  author={Hongge Chen and Huan Zhang and Si Si and Yang Li and Duane S. Boning and Cho-Jui Hsieh},
  journal={ArXiv},
  year={2019},
  volume={abs/1906.03849},
  url={https://api.semanticscholar.org/CorpusID:182953140}
}

@inproceedings{DBLP:conf/date/ChengDHHN0RT18,
  author    = {C.{-}H. Cheng and
               F. Diehl and
               G. Hinz and
               Y. Hamza and
               G. N{\"{u}}hrenberg and
               M. Rickert and
               H. Ruess and
               M. Truong{-}Le},
  title     = {Neural networks for safety-critical applications - Challenges, experiments
               and perspectives},
  booktitle = {Proc. of  DATE'18},
  pages     = {1005--1006},
  year      = {2018},
}

@article{Huang2021OnEE,
  title={On Efficiently Explaining Graph-Based Classifiers},
  author={Xuanxiang Huang and Yacine Izza and Alexey Ignatiev and Joao Marques-Silva},
  year={2021},
  volume={abs/2106.01350},
  url={https://api.semanticscholar.org/CorpusID:235294189}
}



@inproceedings{DBLP:conf/cvpr/EykholtEF0RXPKS18,
  author    = {K. Eykholt and
               I. Evtimov and
               E. Fernandes and
               B. Li and
               A. Rahmati and
               C. Xiao and
               A. Prakash and
               T. Kohno and
               D. Song},
  title     = {Robust Physical-World Attacks on Deep Learning Visual Classification},
  booktitle = {Proc. of  CVPR'18},
  pages     = {1625--1634},
  year      = {2018},
}

@inproceedings{DBLP:conf/cav/KatzHIJLLSTWZDK19,
  author    = {G. Katz and
               D. A. Huang and
               D. Ibeling and
               K. Julian and
               Ch. Lazarus and
               R. Lim and
               P. Shah and
               S. Thakoor and
               H. Wu and
               A. Zeljic and
               D. L. Dill and
               M. J. Kochenderfer and
               C. W. Barrett},
  title     = {The Marabou Framework for Verification and Analysis of Deep Neural
               Networks},
  booktitle = {Proc. of  CAV'19},
  pages     = {443--452},
  year      = {2019},
}

@inproceedings{IgnatievNM19,
  author    = {A. Ignatiev and
               N. Narodytska and
               J. Marques{-}Silva},
  title     = {Abduction-Based Explanations for Machine Learning Models},
  booktitle = {Proc. of AAAI'19},
  pages     = {1511--1519},
  year      = {2019},
}

@article{Coecke2020,
  title={Artificial Intelligence, Responsibility Attribution, and a Relational Justification of Explainability},
  author={Mark Coeckelbergh},
  journal={Science and Engineering Ethics},
  year={2019},
  volume={26},
  pages={2051 - 2068}
}

@article{Turing1950,
  title={Computing Machinery and Intelligence},
  author={Alan M. Turing},
  journal={Mind},
  year={1950},
  volume={LIX},
  pages={433-460}
}

@inproceedings{Ignatiev2019OnRE,
  title={On Relating Explanations and Adversarial Examples},
  author={Alexey Ignatiev and Nina Narodytska and Joao Marques-Silva},
  booktitle={Neural Information Processing Systems},
  year={2019}
}

@inproceedings{Ignatiev2020FromCT,
  title={From Contrastive to Abductive Explanations and Back Again},
  author={Alexey Ignatiev and Nina Narodytska and Nicholas Asher and Joao Marques-Silva},
  booktitle={International Conference of the Italian Association for Artificial Intelligence},
  year={2020}
}

@inproceedings{Bunel18,
  author    = {R. Bunel and
               I. Turkaslan and
               Ph. H. S. Torr and
               P. Kohli and
               P. Kumar Mudigonda},
  title     = {A Unified View of Piecewise Linear Neural Network Verification},
  booktitle = {Proc. of  NeurIPS'18},
  pages     = {4795--4804},
  year      = {2018},
}

@article{DBLP:journals/corr/abs-1805-09938,
  author    = {F. Leofante and
               N. Narodytska and
               L. Pulina and
               A. Tacchella},
  title     = {Automated Verification of Neural Networks: Advances, Challenges and
               Perspectives},
  journal   = {CoRR},
  volume    = {abs/1805.09938},
  year      = {2018},
}

@article{DBLP:journals/jossw/MolnarCB18,
  author    = {Ch. Molnar and
               G. Casalicchio and
               B. Bischl},
  title     = {iml: An {R} package for Interpretable Machine Learning},
  journal   = {Journal of Open Source Software},
  volume    = {3},
  number    = {26},
  pages     = {786},
  year      = {2018},
}

@inproceedings{DBLP:conf/ijcai/RossHD17,
  author    = {A. Slavin Ross and
               M. C. Hughes and
               F. Doshi{-}Velez},
  title     = {Right for the Right Reasons: Training Differentiable Models by Constraining
               their Explanations},
  booktitle = {Proc. of IJCAI'17},
  pages     = {2662--2670},
  year      = {2017},
}

@inproceedings{DBLP:conf/sat/ShihDC19,
  author    = {A. Shih and
               A. Darwiche and
               A. Choi},
  title     = {Verifying Binarized Neural Networks by {A}ngluin-Style Learning},
  booktitle = {Proc. of SAT'19},
  pages     = {354--370},
  year      = {2019},
}

@article{Goodman17,
  author    = {B. Goodman and
               S. R. Flaxman},
  title     = {European Union Regulations on Algorithmic Decision-Making and a "Right
               to Explanation"},
  journal   = {{AI} Magazine},
  volume    = {38},
  number    = {3},
  pages     = {50--57},
  year      = {2017},
}
                  
@inproceedings{NarodytskaKRSW18,
  author    = {N. Narodytska and
               S. Prasad Kasiviswanathan and
               L. Ryzhyk and
               M. Sagiv and
               T. Walsh},
  title     = {Verifying Properties of Binarized Deep Neural Networks},
  booktitle = {Proc. of AAAI'18},
  pages     = {6615--6624}, 
  year      = {2018},
}
                  
@inproceedings{LagniezMarquis19,
 author = {J.-M. Lagniez and P. Marquis},
 title = {A Recursive Algorithm for Projected Model Counting},
 booktitle = {Proc. of AAAI'19},
   pages     = {1536-1543}, 
 year = {2019}
} 

@inproceedings{ShihChoiDarwiche19,
 author = {A. Shih and A. Choi and A. Darwiche},
 title = {Compiling {B}ayesian Networks into Decision Graphs},
 booktitle = {Proc. of AAAI'19},
   pages     = {7966-7974}, 
 year = {2019}
}

@inproceedings{ShihChoiDarwiche18b,
author = {A. Shih and A. Choi and A. Darwiche},
title = {Formal Verification of {B}ayesian Network Classifiers},
booktitle = {Proc. of PGM'18},
  pages     = {427-438}, 
year = {2018}
}

@PROCEEDINGS{AAAI00,
  KEY = {AAAI00},
  TITLE = {Proc. of the Seventeenth National Conference in Artificial Intelligence},
  BOOKTITLE = {Proc. of the Seventeenth National Conference in Artificial Intelligence},
  ADDRESS = {Austin, Texas, USA},
  MONTH = {July 30--August 3},
  YEAR = 2000,
  URL = {http://www.aaai.org/Conferences/National/2000/aaai00.html}
}

@PROCEEDINGS{AAAI02,
  KEY = {AAAI02},
  TITLE = {Proc. of the Eighteenth National Conference in Artificial Intelligence},
  BOOKTITLE = {Proc. of the Eighteenth National Conference in Artificial Intelligence},
  ADDRESS = {Edmonton, Alberta, Canada},
  MONTH = {July 28--August 1},
  YEAR = 2002,
  URL = {http://www.aaai.org/Conferences/National/2002/aaai02.html}
}

@PROCEEDINGS{AAAI98,
  KEY = {AAAI98},
  TITLE = {Proc. of the Fifteenth National Conference in Artificial Intelligence},
  BOOKTITLE = {Proc. of the Fifteenth National Conference in Artificial Intelligence},
  ADDRESS = {Madison, Wisconsin, USA},
  MONTH = {July 26-30},
  YEAR = 1998,
  URL = {http://www.aaai.org/Conferences/National/1998/aaai98.html}
}

@Proceedings{Aagaard2002,
  title     = {Formal Methods in Computer-Aided Design, 4th International Conference, FMCAD 2002, Portland, OR, USA, November 6-8, 2002, Proc.},
  year      = {2002},
  editor    = {Mark Aagaard and John W. O'Leary},
  volume    = {2517},
  series    = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn      = {3-540-00116-6},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  booktitle = {FMCAD},
}

@Article{Akers1978,
  author  = {S.B. Akers},
  title   = {Binary decision diagrams},
  journal = {IEEE Transactions on Computers},
  year    = {1978},
  volume  = {C-27},
  number  = {6},
  pages   = {509--516},
}

@Article{Akers1978a,
  author  = {S.B. Akers},
  title   = {Binary decision diagrams},
  journal = {IEEE Transactions on Computers},
  year    = {1978},
  volume  = {C-27},
  number  = {6},
  pages   = {509--516},
}

@Article{Akers78,
  author = 	 {S.B. Akers},
  title = 	 {Binary decision diagrams},
  journal = 	 {IEEE Transactions on Computers},
  year = 	 {1978},
  volume = 	 {C-27},
  number = 	 {6},
  pages = 	 {509--516}
}

@PhdThesis{Allis1994,
  author =   {L. V. Allis},
  title =    {Searching for Solutions in Games and Artificial Intelligence},
  school =   {University of Limburg},
  year =     1994,
  address =      {Maastricht},
  month =    {July}
}

@InProceedings{Aloul2003,
  author =    {F. A. Aloul and I. L. Markov, K. A. Sakallah},
  title =     {{FORCE: A Fast and Easy-To-Implement Variable-Ordering Heuristic}},
  booktitle = {Great Lakes Symposium on VLSI},
  pages =     {116-119},
  month =     {April},
  year =      {2003}
}

@inproceedings{AmarilliMS18,
  author    = {A. Amarilli and
               M. Monet and
               P. Senellart},
  title     = {Connecting Width and Structure in Knowledge Compilation},
  booktitle = {21st International Conference on Database Theory, {ICDT} 2018, March
               26-29, 2018, Vienna, Austria},
  pages     = {6:1--6:17},
  year      = {2018},
}

@Article{Amilhastre2014,
  author  = {J. Amilhastre and H. Fargier and A. Niveau and C. Pralet},
  title   = {Compiling {CSP}s: {A} Complexity Map of (Non-Deterministic) Multivalued Decision Diagrams},
  journal = {International Journal on Artificial Intelligence Tools},
  year    = {2014},
  volume  = {23},
  number  = {4},
}

@article{Amilhastreetal02,
  author    = {J. Amilhastre and
               H. Fargier and
               P. Marquis},
  title     = {Consistency restoration and explanations in dynamic {CSP}s
               Application to configuration},
  journal   = {Artificial Intelligence},
  volume    = {135},
  number    = {1-2},
  year      = {2002},
  pages     = {199-234}
}

@inproceedings{Amilhastreetal12,
  author    = {J. Amilhastre and
               H. Fargier and
               A. Niveau and
               C. Pralet},
  title     = {Compiling CSPs: {A} Complexity Map of (Non-Deterministic) Multivalued
               Decision Diagrams},
  booktitle = {{IEEE} 24th International Conference on Tools with Artificial Intelligence,
               {ICTAI} 2012, Athens, Greece, November 7-9, 2012},
  pages     = {1--8},
  year      = {2012},
}

@inproceedings{Armstrong74,
  author    = {W.W. Armstrong},
  title     = {Dependency structures of database relationships},
  booktitle = {Proc. of IFIP'74},
  year      = {1974},
  pages     = {580--583}
}

@InProceedings{Arvind1987,
  author =   {V. Arvind and S. Biswas},
  title =    {{An $O(n^{2})$ algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all Horn sentences}},
  booktitle =    {Information Processing Letters},
  pages =    {67--69},
  year =     1987,
  volume =   24
}

@Article{Aspvall1979,
  author  = {B. Aspvall and M. Plass and R. Tarjan},
  title   = {A linear-time algorithm for testing the truth of certain quantified {B}oolean formulas},
  journal = {Information Processing Letters},
  year    = {1979},
  volume  = {8},
  pages   = {121--123},
  note    = {Erratum: Information Processing Letters 14(4): 195 (1982)},
}

@Article{Aspvall1980,
  author  = {B. Aspvall},
  title   = {Recognizing disguised {NR}(1) instances of the satisfiability problem},
  journal = {Journal of Algorithms},
  year    = {1980},
  volume  = {1},
  number  = {1},
  pages   = {97--103},
}

@Article{Aspvall80,
  author =       {B. Aspvall},
  title =        {Recognizing disguised {NR}(1) instances of the satisfiability problem},
  journal =      {Journal of Algorithms},
  year =         1980,
  volume =       1,
  number =       1,
  pages =        {97--103}
}

@Article{Aspvalletal79,
  author =  {B. Aspvall and M. Plass and R. Tarjan},
  title =   {A linear-time algorithm for testing the truth of certain quantified boolean formulas},
  journal = {Information Processing Letters},
  year =    1979,
  volume =  8,
  pages =   {121--123},
  note =    {Erratum: Information Processing Letters 14(4): 195 (1982)}
}

@inproceedings{Astesanaetal10,
  author    = {J.-M. Astesana and
               L. Cosserat and
               H. Fargier},
  title     = {Constraint-based Vehicle Configuration: A Case Study},
  booktitle = {ICTAI (1)},
  year      = {2010},
  pages     = {68-75},
  OPTee        = {http://dx.doi.org/10.1109/ICTAI.2010.19},
  OPTcrossref  = {DBLP:conf/ictai/2010-1},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

   @inproceedings{Audemardetal13,
  author    = {G. Audemard and
               J.-M. Lagniez and
               L. Simon},
  title     = {Just-In-Time Compilation of Knowledge Bases},
  booktitle = {{IJCAI} 2013, Proceedings of the 23rd International Joint Conference
               on Artificial Intelligence, Beijing, China, August 3-9, 2013},
  pages     = {447--453},
  year      = {2013},
}

@inproceedings{AyachiABH10,
  author    = {R. Ayachi and
               N. Ben Amor and
               S. Benferhat and
               R. Haenni},
  title     = {Compiling Possibilistic Networks: Alternative Approaches to Possibilistic
               Inference},
  booktitle = {{UAI} 2010, Proceedings of the Twenty-Sixth Conference on Uncertainty
               in Artificial Intelligence, Catalina Island, CA, USA, July 8-11, 2010},
  pages     = {40--47},
  year      = {2010},
}

@Misc{Ayari02,
  author =   {A. Ayari},
  title =    {{QBF-Formulae in Quantified Clausal Form}},
  year =     2002,
  note =     {\\http://www.informatik.uni-freiburg.de/\~{}ayari/QBF-BENCHMARKS}
}

@InProceedings{Ayari2002a,
  author   = {A. Ayari and D. A. Basin},
  title    = {{QUBOS: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers}},
  pages    = {187-201},
  crossref = {Aagaard2002},
}

@InBook{BaaderNutt03,
  author =	 {F. Baader and W. Nutt},
  title =	 {Basic Description Logics},
  publisher =	 {Cambridge University Press},
  year =	 {2003},
  series =	 {The Description Logic Handbook: Theory, Implementation and Applications},
  OPTpages =	 {43--95},
}

@InProceedings{Baaz2001,
  author =   {M. Baaz and A. Ciabattoni and N. Preining and and H. Veith},
  title =    {A guide to quantified propositional Gˆdel logic},
  booktitle =    {{SAT} 2001: Workshop on Theory and Applications of Satisfiability Testing},
  pages =    {11--20},
  year =     2001,
  month =    {June},
  organization = {QBF'01}
}

@article{Babkaetal13,
  author    = {M. Babka and
               T. Balyo and
               O. Cepek and
               S. Gursk{\'{y}} and
               P. Kucera and
               V{\'{a}}clav Vlcek},
  title     = {Complexity issues related to propagation completeness},
  journal   = {Artificial Intelligence},
  year      = {2013},
  volume    = {203},
  pages     = {19--34},
  OPTurl       = {http://dx.doi.org/10.1016/j.artint.2013.07.006},
  OPTdoi       = {10.1016/j.artint.2013.07.006},
  OPTtimestamp = {Sun, 05 Oct 2014 16:08:55 +0200},
  OPTbiburl    = {http://dblp.uni-trier.de/rec/bib/journals/ai/BabkaBCGKV13},
  OPTbibsource = {dblp computer science bibliography, http://dblp.org}
}

@inproceedings{Bacchusetal03,
  author    = {F. Bacchus and
               S. Dalmao and
               T. Pitassi},
  title     = {Algorithms and Complexity Results for \#{SAT} and Bayesian
               Inference},
  booktitle = {Proc. of FOCS'03},
  year      = {2003},
  pages     = {340-351},
  OPTee        = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2003.1238208},
  OPTcrossref  = {DBLP:conf/focs/2003},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@InProceedings{Bailleux2003,
  author    = {Bailleux, Olivier and Boufkhad, Yacine},
  title     = {Efficient CNF encoding of {B}oolean cardinality constraints},
  booktitle = {Proc. of the 9th International Conference on Principles and Practice of Constraint Programming, CP 2003, LNCS 2833},
  year      = {2003},
  pages     = {108-122},
  publisher = {Springer Verlag},
}

@Article{Balsiger2000,
  author =   {P. Balsiger and A. Heuerding and S. Schwendimann},
  title =    {{A benchmark method for the propositional modal logics K, KT, S4}},
  journal =      {Journal of Automated Reasoning},
  volume =   24,
  number =       3,
  pages =        {297--317},
  year =     2000
}


@inproceedings{Barrett04,
  author    = {A. Barrett},
  title     = {From Hybrid Systems to Universal Plans via Domain Compilation},
  booktitle = {Proc. of ICAPS'04},
  pages     = {44--51},
  year      = {2004},
}


@inproceedings{Barrett05,
  author    = {A. Barrett},
  title     = {Model Compilation for Real-Time Planning and Diagnosis with Feedback},
  booktitle = {Proc. of IJCAI'05},
  pages     = {1195--1200},
  year      = {2005},
}


@inproceedings{Bartetal14,
  author    = {A. Bart and
               F. Koriche and
               J.-M. Lagniez and
               P. Marquis},
  title     = {Symmetry-Driven Decision Diagrams for Knowledge Compilation},
  booktitle = {Proc. of ECAI'14},
  pages     = {51--56},
  year      = {2014},
}
       
 @inproceedings{Bartetal16,
  author    = {A. Bart and
               F. Koriche and
               J.-M. Lagniez and
               P. Marquis},
  title     = {An Improved {CNF} Encoding Scheme for Probabilistic Inference},
  booktitle = {{ECAI} 2016 - 22nd European Conference on Artificial Intelligence,
               29 August-2 September 2016, The Hague, The Netherlands - Including
               Prestigious Applications of Artificial Intelligence {(PAIS} 2016)},
  pages     = {613--621},
  year      = {2016},
}
      
@inproceedings{Beameetal13,
  author    = {P. Beame and
               J. Li and
               S. Roy and
               D. Suciu},
  title     = {Lower Bounds for Exact Model Counting and Applications in Probabilistic
               Databases},
  booktitle = {Proc. of UAI'13},
  year      = {2013},
  pages = {52-61},
  OPTcrossref  = {DBLP:conf/uai/2013},
  OPTurl       = {https://dslpitt.org/uai/displayArticleDetails.jsp?mmnu=1&smnu=2&article_id=2366&proceeding_id=29},
  OPTtimestamp = {Sun, 16 Nov 2014 17:19:26 +0100},
  OPTbiburl    = {http://dblp.uni-trier.de/rec/bib/conf/uai/BeameLRS13},
  OPTbibsource = {dblp computer science bibliography, http://dblp.org}
}

@inproceedings{Bekkeretal15,
  author    = {J. Bekker and
               J. Davis and
               A. Choi and
               A. Darwiche and
               G. Van den Broeck},
  title     = {Tractable Learning for Complex Probability Queries},
  booktitle = {Advances in Neural Information Processing Systems 28: Annual Conference
               on Neural Information Processing Systems 2015, December 7-12, 2015,
               Montreal, Quebec, Canada},
  pages     = {2242--2250},
  year      = {2015},
}

   @inproceedings{BelovIMM12,
     author    = {A. Belov and
                  A. Ivrii and
                  A. Matsliah and
                  J. Marques{-}Silva},
     title     = {On Efficient Computation of Variable MUSes},
     booktitle = {Proc. of SAT'12},
     pages     = {298--311},
     year      = {2012},
   }

                 
@Article{BenEliyahuDechter96,
 author = {R. Ben-Eliyahu and R. Dechter},
 title = {Default reasoning using classical logic},
 journal = {Artificial Intelligence},
 year = {1996},
 volume = {84},
 pages = {113--150}
}

@TechReport{Benedetti04,
  author =   {M. Benedetti},
  title =    {sKizzo: a QBF Decision Procedure based on Propositional Skolemization and Symbolic Reasoning},
  institution =  {ITC-Irst, Institute for Scientific and Technological Research},
  year =     {2004},
  number =   {04-11-03},
  address =      {Trento (Italy)}
}

@InProceedings{Benferhatetal01,
  author =       {S. Benferhat and S. Kaci and D. Le Berre and M.-A. Williams},
  title =        {Weakening conflicting information for iterated revision and knowledge integration},
  booktitle =    {Proc. of IJCAI'01},
  pages =        {109--115},
  year =         {2001},
  OPTaddress =      {Seattle (WA)}
}

@InProceedings{Benferhatetal07,
  author =       {S. Benferhat and S. Yahi and H. Drias},
  title =        {On the Compilation of Stratified Belief Bases under Linear and Possibilistic Logic Policies},
  booktitle =    {Proc. of IJCAI'07},
  pages =        {2425-2430},
  year =         {2007},
  note = {(poster)},
  OPTaddress =      {Seattle (WA)}
}

@article{Benferhatetal10,
  author    = {S. Benferhat and
               S. Yahi and
               H. Drias},
  title     = {A New Default Theories Compilation for MSP-Entailment},
  journal   = {J. Autom. Reasoning},
  volume    = {45},
  number    = {1},
  pages     = {39--59},
  year      = {2010},
}

@InProceedings{Benferhatetal93,
  author =   {S. Benferhat and C. Cayrol and D. Dubois and J. Lang and H. Prade},
  title =    {Inconsistency management and prioritized syntax-based entailment},
  booktitle = {Proc. of IJCAI'93},
  pages =    {640--645},
  year =     {1993},
  OPTaddress =      {Chamb\'ery}
}

@InProceedings{Benferhatetal95,
  author =   {S. Benferhat and D. Dubois and H. Prade},
  title =    {How to infer from inconsistent beliefs without revising},
  booktitle =  {Proc. of IJCAI'95},
  pages =    {1449-1455},
  year =     {1995},
  OPTaddress =      {Montreal}
}

@InProceedings{Benhamou94,
 author = {B. Benhamou and L. Sa\"{\i}s and P. Siegel},
 title = {Two Proof Procedures for a Cardinality Based Langage in Propositional Calculus},
 booktitle = {Proc. of STACS'94},
 pages = {71--84},
 address = {Caen},
 year = {1994}
}
   
   
@TechReport{Benoist1999,
  author =   {E. Benoist and J. J. H\'ebrard},
  title =    {Ordered Formulas},
  institution =  {Les cahiers du GREYC},
  year =     1999,
  number =   14,
  address =      {Universit\'e de Caen},
  url =      {www.hta-bi.bfh.ch/\~{}bie/biblio/ordered.ps}
}


@PhdThesis{Benoist2000,
  author =   {E. Benoist},
  title =    {G\'en\'eration \`a d\'elai polynomial pour le probl\`eme {SAT}},
  school =   {Universit\'e de Caen},
  year =     2000,
  month =    {Janvier}
}

@Article{Benoist2003,
  author =   {E. Benoist and J. J. H\'ebrard},
  title =    {{Recognition of Simple Enlarged Horn Formulas and Simple Extended Horn Formulas}},
  journal =      {Annals of Mathematics and Artificial Intelligence},
  year =     2003,
  volume =   37,
  pages =    {251--272}
}

@Article{Berge1972,
  author =   {C. Berge},
  title =    {{Balanced Matrices}},
  journal =      {Mathematical Programming},
  year =     1972,
  volume =   2,
  pages =    {19--31}
}

@Article{Berge1972a,
  author  = {C. Berge},
  title   = {{Balanced Matrices}},
  journal = {Mathematical Programming},
  year    = {1972},
  volume  = {2},
  pages   = {19--31},
}

@InProceedings{Berre2003,
  author   = {D. Le Berre and L. Simon and A. Tacchella},
  title    = {{Challenges in the QBF Arena: the SAT'03 evaluation of QBF solvers}},
  pages    = {468--485},
  crossref = {Giunchiglia2003b},
}

@InProceedings{Besnard2002,
  author =   {P. Besnard and T. Schaub and H. Tompits and S. Woltran},
  title =    {{Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems}},
  booktitle =    {JELIA'02},
  pages =    {320-331},
  year =     2002,
  address =  {Roskilde, Denmark}
}

@Book{Besnard89,
  author = 	 {Ph. Besnard},
  title = 	 {Default logic},
  publisher = 	 {Springer-Verlag},
  year = 	 {1989},
    series = 	 {Symbolic Computation},
  address = 	 {Berlin}
}

@InBook{BesnardSiegel88,
  author = 	 {Ph. Besnard and P. Siegel},
  title = 	 {The preferential-models approach to non-monotonic logics},
  chapter = 	 {Non-Standard Logics for Automated Reasoning},
  publisher = 	 {Academic Press},
  year = 	 {1988},
  address = 	 {London},
  pages = 	 {137--161}
}

@Article{Beth53,
  author = 	 {E.W. Beth},
  title = 	 {On {P}adoa's method in the theory of definition},
  journal = 	 {Indagationes mathematicae},
  year = 	 {1953},
  volume = 	 {15},
  pages = 	 {330-339}
}

@Article{Bibel81,
  author = 	 {W. Bibel},
  title = 	 {On matrices with connections},
  journal = 	 {Journal of the Association for Computing Machinery},
  year = 	 {1981},
  volume = 	 {28},
  number = 	 {4},
  pages = 	 {633--645}
}

@Article{Bibel82,
  author = 	 {W. Bibel},
  title = 	 {A comparative study of several proof procedures},
  journal = 	 {Artificial Intelligence},
  year = 	 {1982},
  volume = 	 {18},
  pages = 	 {269--293}
}

@inproceedings{Bienvenuetal10,
  author    = {M. Bienvenu and
               H. Fargier and
               P. Marquis},
  title     = {Knowledge Compilation in the Modal Logic {S5}},
  booktitle = {Proc. of AAAI'10},
  year      = {2010},
  pages ={261-266},
  OPTcrossref  = {DBLP:conf/aaai/2010},
  OPTurl       = {http://www.aaai.org/ocs/index.php/AAAI/AAAI10/paper/view/1696},
  OPTtimestamp = {Wed, 24 Sep 2014 14:21:15 +0200},
  OPTbiburl    = {http://dblp.uni-trier.de/rec/bib/conf/aaai/BienvenuFM10},
  OPTbibsource = {dblp computer science bibliography, http://dblp.org}
}

@InProceedings{Biere2004a,
  author   = {A. Biere},
  title    = {{Resove and Expand}},
  crossref = {Giunchiglia2004e},
}
   
@PhdThesis{Blake1937,
  author  = {A. Blake},
  title   = {Canonical expressions in {B}oolean algebra},
  school  = {University of Chicago},
  year    = {1937},
  address = {Chicago (IL)},
}

@PhdThesis{Blake1937a,
  author  = {A. Blake},
  title   = {Canonical expressions in boolean algebra},
  school  = {University of Chicago},
  year    = {1937},
  address = {Chicago (IL)},
}
   
@PhdThesis{Blake37,
  author = 	 {A. Blake},
  title = 	 {Canonical expressions in boolean algebra},
  school = 	 {University of Chicago},
  year = 	 {1937},
  address = 	 {Chicago (IL)}
}

@InProceedings{BlochLang00,
 author = {I. Bloch and J. Lang},
 title = {Towards mathematical morphologics},
 booktitle = {Proc. of the $8^{th}$ International Conference on Information Processing and Management of
Uncertainty in Knowledge-Based Systems (IPMU'00)},
 year = {2000},
 address = {Madrid},
 pages = {1405--1412}
}

@article{BogaertsBroeck15,
  author    = {B. Bogaerts and
               G. Van den Broeck},
  title     = {Knowledge compilation of logic programs using approximation fixpoint
               theory},
  journal   = {{TPLP}},
  volume    = {15},
  number    = {4-5},
  pages     = {464--480},
  year      = {2015},
}

@Article{Bohm96,
  author =       {M. B\"ohm and E. Speckenmeyer},
  title =        {A fast parallel {SAT}--solver --- efficient workload balancing},
  journal =      {Annals of Mathematics and Artificial Intelligence},
  year =         1996,
  volume =       17,
  pages =        {381-- 400}
}

@Article{Boietal92,
  author = 	 {J.-M. Bo\"{\i} and E. Innocente and A. Rauzy and P. Siegel},
  title = 	 {Production fields: a new approach to deduction
		  problems and two algorithms for propositional calculus},
  journal = 	 {Revue d'intelligence artificielle},
  year = 	 {1992},
  volume = 	 {6},
  number = 	 {3},
  pages = 	 {235--253}
}


@inproceedings{BonetGeffner06,
  author    = {B. Bonet and H. Geffner},
  title     = {Heuristics for Planning with Penalties and Rewards using Compiled Knowledge},
  booktitle = {Proc. of KR'06},
  year      = {2006},
  pages     = {452-462}
}

@Book{Boole1854,
  title     = {An investigation of the laws of thought},
  publisher = {Walton and Maberley},
  year      = {1854},
  author    = {G. Boole},
  address   = {London},
}

@Book{Boole54,
 author = {G. Boole},
 title = {An investigation of the laws of thought},
 publisher = {Walton and Maberley},
 year = {1854},
 address = {London}
}

@incollection{BoppanaSipser90,
  author    = {R. B. Boppana and
               M. Sipser},
  title     = {The Complexity of Finite Functions.},
  booktitle = {Handbook of Theoretical Computer Science, Volume A: Algorithms
               and Complexity (A)},
  year      = {1990},
  pages     = {757-804},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de},
}

@InProceedings{Bordeaux2002,
  author =   {L. Bordeaux and E. Monfroy},
  title =    {{Beyond NP: Arc-Consistency for Quantified Constraints}},
  crossref =     cp02,
  pages =    {371--386},
  year =     2002
}

@InProceedings{Bordeaux2002a,
  author =   {L. Bordeaux},
  title =    {A constraint-propagation approach to quantified constraints},
  booktitle    = {Student sessions at CP 2002},
  crossref =     cp02,
  pages =    {371--386},
  year =     2002
}

@inproceedings{Bordeauxetal12,
  author    = {L. Bordeaux and
               M. Janota and
               J. P. Marques Silva and
               P. Marquis},
  title     = {On Unit-Refutation Complete Formulae with Existentially
               Quantified Variables},
  booktitle = {Proc. of KR'12},
  year      = {2012},
  OPTee        = {http://www.aaai.org/ocs/index.php/KR/KR12/paper/view/4534},
  OPTcrossref  = {DBLP:conf/kr/2012},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@TechReport{Borner2002,
  author =   {F. Borner and A. Krokhin and A. Bulatov and Peter Jeavons},
  title =    {Quantified constraints and surjective polymorphisms},
  institution =  {Oxford University Computing Laboratory},
  year =     2002
}

@inproceedings{Jia2020,
 author = {Jia, Kai and Rinard, Martin},
 booktitle = {Advances in Neural Information Processing Systems},
 editor = {H. Larochelle and M. Ranzato and R. Hadsell and M.F. Balcan and H. Lin},
 pages = {1782--1795},
 publisher = {Curran Associates, Inc.},
 title = {Efficient Exact Verification of Binarized Neural Networks},
 url = {https://proceedings.neurips.cc/paper_files/paper/2020/file/1385974ed5904a438616ff7bdb3f7439-Paper.pdf},
 volume = {33},
 year = {2020}
}

@article{Haussler1992,
  title={Decision Theoretic Generalizations of the PAC Model for Neural Net and Other Learning Applications},
  author={David Haussler},
  journal={Inf. Comput.},
  year={1992},
  volume={100},
  pages={78-150},
  url={https://api.semanticscholar.org/CorpusID:14921581}
}

@inproceedings{Valiant1984,
  title={A theory of the learnable},
  author={Leslie G. Valiant},
  booktitle={Symposium on the Theory of Computing},
  year={1984},
  url={https://api.semanticscholar.org/CorpusID:59712}
}

@article{Shalev2010,
  title={Learnability, Stability and Uniform Convergence},
  author={Shai Shalev-Shwartz and Ohad Shamir and Nathan Srebro and Karthik Sridharan},
  journal={J. Mach. Learn. Res.},
  year={2010},
  volume={11},
  pages={2635-2670},
  url={https://api.semanticscholar.org/CorpusID:5988929}
}

@inproceedings{Charles2018,
  title={Stability and Generalization of Learning Algorithms that Converge to Global Optima},
  author={Zachary B. Charles and Dimitris Papailiopoulos},
  booktitle={International Conference on Machine Learning},
  year={2018},
}

@inproceedings{Crabbe2020,
 author = {Crabbe, Jonathan and Zhang, Yao and Zame, William and van der Schaar, Mihaela},
 booktitle = {Advances in Neural Information Processing Systems},
 editor = {H. Larochelle and M. Ranzato and R. Hadsell and M.F. Balcan and H. Lin},
 pages = {17838--17849},
 publisher = {Curran Associates, Inc.},
 title = {Learning outside the Black-Box: The pursuit of interpretable models},
 url = {https://proceedings.neurips.cc/paper_files/paper/2020/file/ce758408f6ef98d7c7a7b786eca7b3a8-Paper.pdf},
 volume = {33},
 year = {2020}
}

@Article{Borosetal90,
  author = 	 {E. Boros and Y. Crama and P.L. Hammer},
  title = 	 {Polynomial-time inference of all valid implications
		  for Horn and related formulae},
  journal = 	 {Annals of Mathematics and Artificial Intelligence},
  year = 	 {1990},
  volume = 	 {1},
  pages = 	 {21--32}
}

@Article{Borosetal94,
  author = 	 {E. Boros and P.L. Hammer and X. Sun},
  title = 	 {Recognition of q-{H}orn formulae in linear time},  
  journal = 	 {Discrete Applied Mathematics},
  year = 	 {1994},
  volume = 	 {55},
  pages = 	 {1--13}
}

@Article{BossuSiegel85,
  author = 	 {G. Bossu and P. Siegel},
  title = 	 {Saturation, nonmonotonic reasoning and the closed-world assumption},
  journal = 	 {Artificial Intelligence},
  year = 	 {1985},
  volume = 	 {25},
  pages = 	 {23--67}
}

@InProceedings{Boufkhad98,
  author = 	 {Y. Boufkhad},
  title = 	 {Algorithms for propositional {KB} approximation},
  booktitle = 	 {Proc. of AAAI'98},
  year = 	 {1998},
  address = 	 {Madison (WI)},
  pages = 	 {280--285}
}

@InProceedings{Boufkhadetal97,
  author = 	 {Y. Boufkhad and E. Gr\'egoire and P. Marquis and
		  B. Mazure and L. Sais},
  title = 	 {Tractable cover compilations},
  booktitle = 	 {Proc. of IJCAI'97},
  year = 	 {1997},
  address = 	 {Nagoya},
  pages = 	 {122--127}
}

@InProceedings{Boutilier94,
  author = 	 {C. Boutilier},
  title = 	 {Toward a logic for qualitative decision theory},
  booktitle = 	 {Proc. of KR'94},
  year = 	 {1994},
  address = 	 {Bonn},
  pages = 	 {75--86}
}

@InProceedings{BoutilierDeanHanks95,
 author = 	 {C. Boutilier and T. Dean and S. Hanks},
  title = 	 {Planning under uncertainty: structural assumptions
and computational leverage},
  booktitle = 	 {Proc. of EWSP'95},
  year = 	 {1995},
  pages = 	 {}
}

@InProceedings{BoutilierPoole96,
  author = 	 {C. Boutilier and D. Poole},
  title = 	 {Computing optimal policies for partially observable
		  decision processes using compact representations},
  booktitle = 	 {Proc. of AAAI'96},
  year = 	 {1996},
  address = 	 {Portland (OR)},
  pages = 	 {1168--1175}
}

@InProceedings{Boutilieretal95,
  author = 	 {C. Boutilier and R. Dearden and M. Goldszmidt},
  title = 	 {Exploting structure in policy construction},
  booktitle = 	 {Proc. of IJCAI'95},
  year = 	 {1995},
  address = 	 {Montreal},
  pages = 	 {1104--1111}
}

@inproceedings{Bova16,
  author    = {S. Bova},
  title     = {SDDs Are Exponentially More Succinct than OBDDs},
  booktitle = {Proceedings of the Thirtieth {AAAI} Conference on Artificial Intelligence,
               February 12-17, 2016, Phoenix, Arizona, {USA.}},
  pages     = {929--935},
  year      = {2016},
}

@article{BovaS17,
  author    = {S. Bova and
               F. Slivovsky},
  title     = {On Compiling Structured CNFs to OBDDs},
  journal   = {Theory Comput. Syst.},
  volume    = {61},
  number    = {2},
  pages     = {637--655},
  year      = {2017},
}

@TechReport{Bovaetal14,
  author =   {S. Bova and F. Capelli and S. Mengel and F. Slivovsky},
  title =    {{Expander CNFs have Exponential DNNF Size}},
  institution =  {Cornell University Library},
  year =     2014,
  number =   {arXiv:1411.1995},
  month =    {November}
}

@inproceedings{Bovaetal15,
  author    = {S. Bova and
               F. Capelli and
               S. Mengel and
               F. Slivovsky},
  title     = {On Compiling {CNFs} into Structured Deterministic {DNNFs}},
  booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2015 - 18th
               International Conference, Austin, TX, USA, September 24-27, 2015,
               Proceedings},
  pages     = {199--214},
  year      = {2015},
}

@inproceedings{Bovaetal16,
  author    = {S. Bova and
               F. Capelli and
               S. Mengel and
               F. Slivovsky},
  title     = {Knowledge Compilation Meets Communication Complexity},
  booktitle = {Proc. of IJCAI'16},
  pages     = {1008--1014},
  year      = {2016},
}

@InProceedings{Brewka89,
  author = 	 {G. Brewka},
  title = 	 {Preferred subtheories: an extended logical framework
		  for default reasoning},
  booktitle = 	 {Proc. of IJCAI'89},
  year = 	 {1989},
  OPTaddress = 	 {Detroit (MI)},
  pages = 	 {1043--1048}
}

@Misc{Brglez1989,
  author = {Franc Brglez and David Bryan and Krzysztof Kozminski},
  title  = {{ISCAS'89 Benchmarks}},
  month  = {October},
  year   = {1989},
  note   = {\\http://www.cbl.ncsu.edu/CBL\_Docs/iscas89.html},
}

@inproceedings{Broeck11,
  author    = {G. {Van den Broeck}},
  title     = {On the Completeness of First-Order Knowledge Compilation for Lifted
               Probabilistic Inference},
  booktitle = {Proc. of NIPS'11},
  year      = {2011},
  pages     = {1386--1394},
  OPTcrossref  = {DBLP:conf/nips/2011},
  OPTurl       = {http://books.nips.cc/papers/files/nips24/NIPS2011_0805.pdf},
  OPTtimestamp = {Wed, 24 Sep 2014 14:43:17 +0200},
  OPTbiburl    = {http://dblp.uni-trier.de/rec/bib/conf/nips/Broeck11},
  OPTbibsource = {dblp computer science bibliography, http://dblp.org}
}

@inproceedings{BroeckD15,
  author    = {G. {Van den Broeck} and
               A. Darwiche},
  title     = {On the Role of Canonicity in Knowledge Compilation},
  booktitle = {Proc. of AAAI'15},
  pages     = {1641--1648},
  year      = {2015},
}

@inproceedings{BroeckDarwiche13,
  author    = {G. Van den Broeck and
               A. Darwiche},
  title     = {On the Complexity and Approximation of Binary Evidence in Lifted Inference},
  booktitle = {Advances in Neural Information Processing Systems 26: 27th Annual
               Conference on Neural Information Processing Systems 2013. Proceedings
               of a meeting held December 5-8, 2013, Lake Tahoe, Nevada, United States.},
  pages     = {2868--2876},
  year      = {2013},
}

@inproceedings{BroeckDarwiche15,
  author    = {G. Van den Broeck and
               A. Darwiche},
  title     = {On the Role of Canonicity in Knowledge Compilation},
  booktitle = {Proceedings of the Twenty-Ninth {AAAI} Conference on Artificial Intelligence,
               January 25-30, 2015, Austin, Texas, {USA.}},
  pages     = {1641--1648},
  year      = {2015},
}

@Article{Brown1968,
  author  = {F.M. Brown},
  title   = {The origin of the method of iterated consensus},
  journal = {IEEE Transactions on Computers},
  year    = {1968},
  volume  = {C-17},
  pages   = {802},
}

@Article{Brown1968a,
  author  = {F.M. Brown},
  title   = {The origin of the method of iterated consensus},
  journal = {IEEE Transactions on Computers},
  year    = {1968},
  volume  = {C-17},
  pages   = {802},
}

@Article{Brown68,
  author = 	 {F.M. Brown},
  title = 	 {The origin of the method of iterated consensus},
  journal = 	 {IEEE Transactions on Computers},
  year = 	 {1968},
  volume = 	 {C-17},
  pages = 	 {802}
}

@Article{Bryant1986,
  author  = {R.E. Bryant},
  title   = {Graph-based algorithms for {B}oolean function manipulation},
  journal = {IEEE Transactions on Computers},
  year    = {1986},
  volume  = {C-35},
  number  = {8},
  pages   = {677--692},
}

@article{BubeckBuning08,
  author    = {U. Bubeck and
               H. Kleine B{\"u}ning},
  title     = {Models and quantifier elimination for quantified Horn formulas},
  journal   = {Discrete Applied Mathematics},
  volume    = {156},
  number    = {10},
  year      = {2008},
  pages     = {1606-1622},
  OPTee        = {http://dx.doi.org/10.1016/j.dam.2007.10.005},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@TechReport{Buro1992,
  author =   {M. Buro and H. Kleine-B\"uning},
  title =    {{Report on a SAT competition}},
  institution =  {University of Paderborn},
  year =     1992,
  number =   {Technical Report 110},
  address =  {Germany},
  month =    {November}
}

@PROCEEDINGS{CP04,
  editor    = {Mark Wallace},
  title     = {Principles and Practice of Constraint Programming - CP 2004,
               10th International Conference, CP 2004, Toronto, Canada, September
               27- October 1, 2004, Proc.},
  booktitle = {CP},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {3258},
  year      = {2004},
  isbn      = {3-540-23241-9},
}

@InProceedings{Cadoli1997,
  Author         = {M. Cadoli and A. Giovanardi and M. Schaerf},
  Title          = {Experimental analysis of the Computational cost of Evaluating Quantified Boolean Formulae},
  BookTitle      = {5 Congresso dell'Associazione Italiana per l'Intelligenza Artificiale},
  Address        = {Roma (Italy)},
  year           = 1997,
  url            = {http://www.qbflib.org/97-aiiaCadGioSch.ps.gz}
}

@Proceedings{Cadoli1998b,
  title     = {An algorithm to Evaluate Quantified Boolean Formulae and its Experimental Evaluation},
  year      = {1998},
  note      = {Extension of paper \cite{Cadoli1998a}},
  author    = {M. Cadoli and A. Giovanardi and M. Schaerf and M. Giovanardi},
  booktitle = aaai98,
  url       = {http://www.dis.uniroma1.it/pub/AI/papers/cado-etal-99-b.ps.gz},
}

@Misc{Cadoli1998e,
  author = {M. Cadoli and A. Giovanardi and M. Schaerf},
  title  = {Evaluate},
  year   = {1998},
  note   = {\\http://www.dis.uniroma1.it/\~{}cadoli/projects/QBF},
}

@InProceedings{Cadoli2000,
  author =   {M. Cadoli and M. Schaerf and M. Giovanardi},
  title =    {{Evaluation of quantified boolean formulae on $\Sigma^p_k-$ and PSPACE-complete instances}},
  booktitle =    {AI*IA Notizie},
  pages =    {41--43},
  year =     2000,
  volume =   13,
  number =   1,
  month =    {March}
}

@InProceedings{Cadoli2001,
  author =   {M. Cadoli and A. Schaerf},
  title =    {{Compiling Problem Specifications into SAT}},
  booktitle =    {{SAT} 2001: Workshop on Theory and Applications of Satisfiability Testing},
  pages =    {11--20},
  year =     2001,
  month =    {June},
  organization = {QBF'01}
} 

@Article{Cadoli2002,
  Author         = {M. Cadoli and A. Giovanardi and M. Schaerf and M. Giovanardi},
  Title          = {An algorithm to Evaluate Quantified Boolean Formulae and its Experimental Evaluation},
  Journal        = {Journal of Automated Reasoning},
  volume         = 28,
  number         = 2,
  pages          = {101-142},
  year           = 2002,
  url            = {http://www.dis.uniroma1.it/pub/AI/papers/cado-etal-99-b.ps.gz},
  OPTnote =  {Extension of paper \cite{Cadoli1998a}}
}

@InProceedings{Cadoli93,
  author = 	 {M. Cadoli},
  title = 	 {Semantical and computational aspects of Horn approxomation},
  booktitle = 	 {Proc. of the $13^{th}$ International Joint
		  Conference on Artificial Intelligence (IJCAI'93)},
  year = 	 {1993},
  address = 	 {Chamb\'ery},
  pages = 	 {39--44}
}
    
@Article{CadoliDonini97,
 author = {M. Cadoli and F.M. Donini},
 title = {A survey on knowledge compilation},
 journal = {AI Communications},
 volume = {10},
 number = {3--4},
 pages = {137--150},
 year = {1998}
}

@Article{CadoliLenzerini94,
  author = 	 {M. Cadoli and M. Lenzerini},
  title = 	 {The complexity of propositional closed world reasoning and circumscription},
  journal = 	 {Journal of Computer and System Sciences},
  year = 	 {1994},
  volume = 	 {48},
  pages = 	 {255--310}
}

@Article{Cadolietal00,
  author =       {M. Cadoli and F.M. Donini and P. Liberatore and M. Schaerf},
  title =        {Space efficiency of propositional knowledge representation formalisms},
  journal =      {Journal of Artificial Intelligence Research},
  year =         {2000},
  volume =       {13},
  pages =        {1--31}
}



@Article{Cadolietal02,
  author =       {M. Cadoli and F.M. Donini and P. Liberatore and M. Schaerf},
  title =        {Preprocessing of intractable problems},
  journal =      {Information and Computation},
  year =         {2002},
  volume =       {176},
  number =       {2},
  pages =        {89--120}
}

@Article{Cadolietal92,
  author = 	 {M. Cadoli and Th. Eiter and G. Gottlob},
  title = 	 {An efficient method for eliminating varying predicates from a circumscription},
  journal = 	 {Artificial Intelligence},
  year = 	 {1992},
  volume = 	 {54},
  pages = 	 {397--410}
}

@InProceedings{Cadolietal94,
  author = 	 {M. Cadoli and F.M. Donini and M. Schaerf},
  title = 	 {Is intractability of non monotonic reasoning a real drawback?},
  booktitle = 	 {Proc. of the $12^{th}$ National Conference on
		  Artificial Intelligence (AAAI'94)},
  year = 	 {1994},
  address = 	 {Austin (TX)},
  pages = 	 {946--951}
}

@Article{Cadolietal96,
  author = 	 {M. Cadoli and F.M. Donini and M. Schaerf},
  title = 	 {Is intractability of non-monotonic reasoning a real drawback?},
  journal = 	 {Artificial Intelligence},
  year = 	 {1996},
  volume = 	 {88},
  pages = 	 {215--251}
}

@Article{Cadolietal97,
  author = 	 {M. Cadoli and F.M. Donini and M. Schaerf and R. Silvestri},
  title = 	 {On compact representations of propositional circumscription},
  journal = 	 {Theoretical Computer Science},
  year = 	 {1997},
  volume = 	 {182},
  pages = 	 {183--202}
}

@TechReport{Cadolietal97b,
  author = 	 {M. Cadoli and F.M. Donini and P. Liberatore and M. Schaerf},
  title = 	 {Preprocessing of intractable problems},
  institution =  {Dipartimento di Informatica e Sistemistica,
		  Universit\`a di Roma "La Sapienza"},
  year = 	 {1997},
  number = 	 {DIS 24-97}
}

@InProceedings{Cadolietal98,
  author = 	 {M. Cadoli and A. Giovanardi and M. Schaerf},
  title = 	 {An algorithm to evaluate quantified boolean formulae},
  booktitle = 	 {Proc. of AAAI'98},
  year = 	 {1998},
  address = 	 {Madison (WI)},
  pages = 	 {262--267}
}

@Article{Cadolietal99,
  author =       {M. Cadoli and F.M. Donini and P. Liberatore and M. Schaerf},
  title =        {The size of a revised knowledge base},
  journal =      {Artificial Intelligence},
  year =         {1999},
  volume =       {115},
  number =       {1},
  pages =        {25--64}
}

@article{Cantor97,
  author =	 {G. Cantor},
  title = 	 {Beitr\"age zur Begr\"undung der transfiniten Mengenlehre},
  journal = 	 {Mathematische Annalen},
  volume = {49},
  pages = {207--246},
  year = 	 {1897}
}

@inproceedings{Capelli17,
  author    = {F. Capelli},
  title     = {Understanding the complexity of {\#}SAT using knowledge compilation},
  booktitle = {32nd Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
               2017, Reykjavik, Iceland, June 20-23, 2017},
  pages     = {1--10},
  year      = {2017},
}

@inproceedings{Castell96,
 author = {Th. Castell},
 title = {Computation of Prime Implicates and Prime Implicants by a variant of the {D}avis and {P}utnam Procedure},
 booktitle = {Proc. of ICTAI'96},
 year = {1996},
 pages = {428},
 publisher = {IEEE Computer Society},
 address = {Washington, DC, USA}
 }

@PhdThesis{Castell97,
  author = 	 {Th. Castell},
  title = 	 {Consistance et d\'eduction en logique propositionnelle},
  school = 	 {Universit\'e Paul Sabatier, Toulouse},
  year = 	 {1997},
  type = 	 {Th\`ese d'Universit\'e},
  note = 	 {(in french)}
}

@InProceedings{Castelletal96,
  author = 	 {Th. Castell and C. Cayrol and M. Cayrol and D. Le Berre},
  title = 	 {Using the {D}avis and {P}utnam procedure for an
		  efficient computation of preferred models},
  booktitle = 	 {Proc. of ECAI'96},
  year = 	 {1996},
  address = 	 {Budapest},
  pages = 	 {350--354}
}

@inproceedings{Cateetal06,
  author    = {B. ten Cate and
               W. Conradie and
               M. Marx and
               Y. Venema},
  title     = {Definitorially Complete Description Logics.},
  booktitle = {Proc. of KR'06},
  year      = {2006},
  pages     = {79-89},
  OPTcrossref  = {DBLP:conf/kr/2006},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}


@Article{Cayrol92,
 author = {C. Cayrol},
 title = {Une mod\`ele logique g\'en\'eral pour le
 raisonnement r\'evisable},
 journal = {Revue d'Intelligence Artificielle},
 year = {1992},
 volume = {6},
 number = {3},
 OPTpages = {255-284}
}

@Article{Cayroletal98,
  author =   {C. Cayrol and M.-C. Lagasquie-Schiex and Th. Schiex},
  title =    {Nonmonotonic reasoning: from complexity to algorithms},
  journal =      {Annals of Mathematics and Artificial Intelligence},
  year =     {1998},
  volume =   {22},
  number =       {3--4},
  pages =        {207--236},
}

@PhdThesis{Cazalens92,
  author = 	 {S. Cazalens},
  title = 	 {Formalisation en logique non standard de certaines m\'ethodes de raisonnement pour fournir des
r\'eponses coop\'eratives, dans des syst\`emes de bases de donne\'es et de connaissances},
  school = 	 {Universit\'e Paul Sabatier, Toulouse},
  year = 	 {1992},
  type = 	 {Th\`ese d'Universit\'e},
  note = 	 {(in french)},
  }
  
  @inproceedings{DBLP:conf/kr/CeylanDB16,
  author    = {{\.I.} {\.I.} Ceylan and
               A. Darwiche and
               G. Van den Broeck},
  title     = {Open-World Probabilistic Databases},
  booktitle = {Principles of Knowledge Representation and Reasoning: Proceedings
               of the Fifteenth International Conference, {KR} 2016, Cape Town, South
               Africa, April 25-29, 2016.},
  pages     = {339--348},
  year      = {2016},
}

@InProceedings{Chabrier95,
 author = {J. Chabrier and V. Juliard and J.J. Chabrier},
 title = {{SCORE(FD/B)} an efficient complete local-based search method for satisiability problems},
 booktitle = {Proc. of the CP'95 Workshop on Solving Really Hard Problems},
 year = {1995},
 address = {Cassis, France},
 pages = {25--30}
}

@Article{Chandra1978,
  author  = {A.K. Chandra and G. Markowsky},
  title   = {On the number of prime implicants},
  journal = {Discrete Mathematics},
  year    = {1978},
  volume  = {24},
  pages   = {7--11},
}

@Article{Chandra1978a,
  author  = {A.K. Chandra and G. Markowsky},
  title   = {On the number of prime implicants},
  journal = {Discrete Mathematics},
  year    = {1978},
  volume  = {24},
  pages   = {7--11},
}

@Article{ChandraMarkowsky78,
  author = 	 {A.K. Chandra and G. Markowsky},
  title = 	 {On the number of prime implicants},
  journal = 	 {Discrete Mathematics},
  year = 	 {1978},
  volume = 	 {24},
  pages = 	 {7--11}
}

@Article{Chandru1990,
  author =   {V. Chandru and C. R. Coullard and P. Hammer and M. Montanez and X. Sun},
  title =    {{On Renamable Horn and Generalized Horn Functions}},
  journal =      {Annals of Mathematics and Artificial Intelligence},
  year =     1990,
  volume =   1,
  pages =    {33--47}
}

@Article{Chandru1991,
  author =       {V. Chandru and J. N. Hooker},
  title =        {{Extended Horn Sets in Propositional Logic}},
  journal =      {Journal of the Association for Computing Machinery},
  year =         1991,
  volume =       38,
  pages =        {205--221}
}

@Book{Chang1973,
  title     = {Symbolic logic and mechanical theorem proving},
  publisher = {Academic Press},
  year      = {1973},
  author    = {C.L. Chang and R.C.T. Lee},
  address   = {New York},
}

@Book{Chang1973a,
  title     = {Symbolic logic and mechanical theorem proving},
  publisher = {Academic Press},
  year      = {1973},
  author    = {C.L. Chang and R.C.T. Lee},
  address   = {New York},
}

@Book{ChangLee73,
  author = 	 {C.L. Chang and R.C.T. Lee},
  title = 	 {Symbolic logic and mechanical theorem proving},
  publisher = 	 {Academic Press},
  year = 	 {1973},
  address = 	 {New York}
}

@inproceedings{Chauhanetal04,
  author    = {P. Chauhan and
               E. M. Clarke and
               D. Kroening},
  title     = {A {SAT}-based algorithm for reparameterization in symbolic
               simulation},
  booktitle = {Proc. of DAC'04},
  year      = {2004},
  pages     = {524-529},
  OPTee        = {http://doi.acm.org/10.1145/996566.996711},
  OPTcrossref  = {DBLP:conf/dac/2004},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@INPROCEEDINGS{ChaviraDarwiche07,
  AUTHOR = "Chavira, M. and Darwiche, A.",
  TITLE  = "Compiling {B}ayesian Networks Using Variable Elimination",
  BOOKTITLE = "Proc. of IJCAI'07",
  YEAR = 2007,
  PAGES = "2443--2449",
}

@article{ChaviraDarwiche08,
  author    = {M. Chavira and
               A. Darwiche},
  title     = {On probabilistic inference by weighted model counting},
  journal   = {Artif. Intell.},
  volume    = {172},
  number    = {6-7},
  pages     = {772--799},
  year      = {2008},
}

@article{Chaviraetal06,
author="Chavira, M. and Darwiche, A. and Jaeger, M.",
title="Compiling Relational {B}ayesian Networks for Exact Inference",
journal="International Journal of Approximate Reasoning",
volume="42",
number="1--2",
pages="4--20",
year="2006",
OPTkeywords="Exact inference, Relational models, Bayesian networks"
}

@InProceedings{Cheesemanetal91,
  author =   {P. Cheeseman and B. Kanefsky and W.M. Taylor},
  title =    {Where the really hard problems are},
  booktitle =    {Proc. of IJCAI'91},
  pages =    {331--337},
  year =     {1991},
  address =      {Sydney}
}

@InProceedings{Audemard22ijcai,
  author =   {G. Audemard and S. Bellart and L. Bounia and F. Koriche and J.M. Lagniez and P. Marquis},
  title =    {On Preferred Abductive Explanations for Decision Trees and Random Forests},
  booktitle =    {Proc. of IJCAI'22},
  year =     {2022}
}


@TechReport{Chen2003,
  author =   {H. Chen},
  title =    {{Quantified Constraint Satisfaction Problems: Closure Properties, Complexity, and Algorithms}},
  institution =  {Cornell University},
  year =     2003,
  address =  {Ithaca, NY, USA}
}

@InProceedings{Chen2004a,
  author   = {H. Chen and V. Dalmau},
  title    = {{Looking Algebraically at Tractable Quantified Boolean Formulas}},
  crossref = {Giunchiglia2004e},
}

@inproceedings{Choietal13,
author = {A. Choi and D. Kisa and A. Darwiche},
title = {Compiling Probabilistic Graphical Models using Sentential Decision Diagrams},
booktitle = {Proc. of ECSQARU'13},
year = {2013},
pages = {121-132},
}

@inproceedings{DBLP:conf/icml/ChoiD17,
  author    = {A. Choi and
               A. Darwiche},
  title     = {On Relaxing Determinism in Arithmetic Circuits},
  booktitle = {Proceedings of the 34th International Conference on Machine Learning,
               {ICML} 2017, Sydney, NSW, Australia, 6-11 August 2017},
  pages     = {825--833},
  year      = {2017},
}

@InProceedings{Chu97,
  author =   {ChuMin Li and Anbulagan},
  title =    {Heuristics based on unit propagation for satisfiability problems},
  booktitle =    {Proc. of IJCAI'97},
  pages =    {366--371},
  year =     {1997},
  address =      {Nagoya}
}

@Article{Chvatal88,
 author = {V. Chv\'atal and E. Szemer\'edi},
 title = {Many hard examples for resolution},
 journal = {JACM},
 year = {1988},
 volume = {35},
 number = {4},
 pages = {759--768}
}

@book{Clarkeetal01,
  author    = {E. M. Clarke and
               O. Grumberg and
               D. Peled},
  title     = {Model checking},
  publisher = {MIT Press},
  year      = {2001},
  OPTisbn      = {978-0-262-03270-4},
  OPTpages     = {I-XIV, 1-314},
  OPTee        = {http://books.google.de/books?id=Nmc4wEaLXFEC},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@Article{Conforti1994,
  author =   {M. Conforti and G. Cornu\'ejols and A. Kapoor and M. R. Rao and K. Vuskovic},
  title =    {Balanced matrices: A survey},
  journal =      {Mathematical Programming: State of the Art},
  year =     1994,
  pages =    {1--33}
}

@Article{Conforti2001,
  author =   {M. Conforti and G. Cornu\'ejols and A. Kapoor and K. Vuskovic},
  title =    {{Balanced $0, \pm 1$ matrices, Parts I-II}},
  journal =      {Journal of Combinatorial Theory},
  year =     2001,
  volume =   {B 81},
  pages =    {243--306}
}

@Article{Conforti2001a,
  author =   {M. Conforti and G. Cornu\'ejols and A. Kapoor and K. Vuskovic},
  title =    {{Balanced $0, \pm 1$ matrices, Part I: Decomposition}},
  journal =      {Journal of Combinatorial Theory},
  year =     2001,
  volume =   {B 81},
  pages =    {243--274}
} 

@Article{Conforti2001b,
  author =   {M. Conforti and G. Cornu\'ejols and A. Kapoor and K. Vuskovic},
  title =    {{Balanced $0, \pm 1$ matrices, Part II: Recognition algorithm}},
  journal =      {Journal of Combinatorial Theory},
  year =     2001,
  volume =   {B 81},
  pages =    {275--306}
}

@Article{Conforti2001e,
  author  = {M. Conforti and G. Cornu\'ejols and A. Kapoor and K. Vuskovic},
  title   = {{Balanced $0, \pm 1$ matrices, Parts I-II}},
  journal = {Journal of Combinatorial Theory},
  year    = {2001},
  volume  = {B 81},
  pages   = {243--306},
}

@InProceedings{Conforti2004,
  author    = {Michele Conforti and Gerard Cornu\'ejols and Giacomo Zambelli},
  title     = {Bicolorings and Equitable Bicolorings of Matrices},
  booktitle = {The Sharpest Cut: The Impact of Manfred Padberg and His Work},
  year      = {2004},
  editor    = {Martin Groetschel},
  pages     = {33--37},
  publisher = {MPS/SIAM Series on Optimization},
}

@Misc{Conforti2004b,
  author =   {M. Conforti and G. Cornu\'ejols and K. Vuskovic},
  title =    {Balanced Matrices},
  month =    {April},
  year =     2004,
  note =     {To appear in  Discrete Mathematics}
}

@TechReport{Conforti2004c,
  author =   {M. Conforti and G. Cornu\'ejols and Giacomo Zambelli},
  title =    {{Decomposing Berge graphs containing no proper wheel, long prism or their complements}},
  institution =  {{LIF}},
  year =     2004,
  type =     {Research report},
  number =   {19-2004},
  address =  {Marseille, France},
  month =    {January},
  note =     {http://www.lim.univ-mrs.fr/Rapports/19-2004-Conforti-Cornuejols-Zambelli.html}
}

@InProceedings{Consoleetal89,
  author = 	 {L. Console and D. Theseider Dupr\'e and P. Torasso},
  title = 	 {A theory of diagnosis for incomplete causal models},
  booktitle = 	 {Proc. of the $11^{th}$ International Joint Conference on Artificial Intelligence (IJCAI'89)},
  year = 	 {1989},
  address = 	 {Detroit (MI)},
  pages = 	 {1131--1137}
}

@Article{Consoleetal91,
  author = 	 {L. Console and D. Theseider Dupr\'e and P. Torasso},
  title = 	 {On the relationship between abduction and deduction},
  journal = 	 {Journal of Logic and Computation},
  year = 	 {1991},
  volume = 	 {1},
  pages = 	 {661--690}
}

@InProceedings{Coste-Marquis2002,
  author    = {S. Coste-Marquis and H. Fargier and J. Lang and D. Le Berre and P. Marquis},
  title     = {RÈsolution de formules boolÈennes quantifiÈes : problËmes et algorithmes},
  booktitle = {Actes du 13e CongrËs AFRIF-AFIA Reconnaissance des Formes et Intelligence Artificielle},
  year      = {2002},
  pages     = {289-298},
  address   = {Angers, France},
}

@inproceedings{CosteMarquis00,
  author    = {S. Coste{-}Marquis and
               P. Marquis},
  title     = {Compiling Stratified Belief Bases},
  booktitle = {Proc. of ECAI'00},
  year      = {2000},
  pages     = {23--27},
  OPTcrossref  = {DBLP:conf/ecai/2000},
  OPTtimestamp = {Wed, 24 Sep 2014 14:16:31 +0200},
  OPTbiburl    = {http://dblp.uni-trier.de/rec/bib/conf/ecai/Coste-MarquisM00},
  OPTbibsource = {dblp computer science bibliography, http://dblp.org}
}

@Article{CosteMarquis01,
  author =       {S. Coste-Marquis and P. Marquis},
  title =        {Knowledge Compilation for Closed World Reasoning and Circumscription},
  journal =      {Journal of Logic and Computation},
  year =         {2001},
  volume = {11},
  number = {4},
  pages = {579--607}
}

@Article{CosteMarquis04,
  author =   {S. Coste-Marquis and P. Marquis},
  title =    {On Stratified Belief Base Compilation},
  journal =      {Annals of Mathematics and Artificial Intelligence},
  year =     {2004},
  volume =   {42},
  number =   {4},
  pages =        {399-442}
}

@inproceedings{CosteMarquis99,
  author    = {S. Coste{-}Marquis and
               P. Marquis},
  title     = {Complexity Results for Propositional Closed World Reasoning and Circumscription
               from Tractable Knowledge Bases},
  booktitle = {Proc. of IJCAI'99},
  year      = {1999},
  pages     = {24--29},
  OPTcrossref  = {DBLP:conf/ijcai/99},
  OPTtimestamp = {Wed, 24 Sep 2014 14:15:24 +0200},
  OPTbiburl    = {http://dblp.uni-trier.de/rec/bib/conf/ijcai/Coste-MarquisM99},
  OPTbibsource = {dblp computer science bibliography, http://dblp.org}
}


@inproceedings{CosteMarquisetal05,
  author    = {S. Coste{-}Marquis and
               D. Le Berre and
               F. Letombe and
               P. Marquis},
  title     = {Propositional Fragments for Knowledge Compilation and Quantified Boolean
               Formulae},
  booktitle = {Proc. of AAAI'05},
  year      = {2005},
  pages     = {288--293},
  OPTcrossref  = {DBLP:conf/aaai/2005},
  OPTurl       = {http://www.aaai.org/Library/AAAI/2005/aaai05-046.php},
  OPTtimestamp = {Wed, 24 Sep 2014 14:18:35 +0200},
  OPTbiburl    = {http://dblp.uni-trier.de/rec/bib/conf/aaai/Coste-MarquisBLM05},
  OPTbibsource = {dblp computer science bibliography, http://dblp.org}
}
	
@article{CosteMarquisetal06,
  author    = {S. Coste{-}Marquis and
               D. Le Berre and
               F. Letombe and
               P. Marquis},
  title     = {Complexity Results for Quantified Boolean Formulae Based on Complete
               Propositional Languages},
  journal   = {{JSAT}},
  year      = {2006},
  volume    = {1},
  number    = {1},
  pages     = {61--88},
  OPTurl       = {http://jsat.ewi.tudelft.nl/content/volume1/JSAT1_3_Coste.pdf},
  OPTtimestamp = {Wed, 24 Sep 2014 14:19:59 +0200},
  OPTbiburl    = {http://dblp.uni-trier.de/rec/bib/journals/jsat/Coste-MarquisBLM06},
  OPTbibsource = {dblp computer science bibliography, http://dblp.org}
}

@InProceedings{CoxPietrzykowski86,
  author = 	 {P.T. Cox and T. Pietrzykowski},
  title = 	 {Causes for events: their computation and applications},
  booktitle = 	 {Proc. of the $8^{th}$ International Conference on Automated Deduction (CADE'86)},
  year = 	 {1986},
  address = 	 {Oxford},
  pages = 	 {608--621}
}

@InProceedings{CoxPietrzykowski87,
  author = 	 {P.T. Cox and T. Pietrzykowski},
  title = 	 {General diagnosis by abductive inference},
  booktitle = 	 {Proc. of the IEEE Symposium on  Logic Programming},
  year = 	 {1987},
  pages = 	 {183--189}
}

@Article{Craig57,
  author = 	 {W. Craig},
  title = 	 {Three uses of the {H}erbrand-{G}entzen theorem in relating model theory and proof theory},
  journal = 	 {Journal of Symbolic Logic},
  year = 	 {1957},
  volume = 	 {22},
  OPTnumber = 	 {},
  pages = 	 {269--285}
}

@InProceedings{Crawford1993,
  author =   {J. Crawford and L. Auton},
  title =    {Experimental results on the crossover point in satisfiability problems},
  booktitle =    aaai93,
  pages =    {21--27},
  year =     1993,
  publisher =    {AAAI Press/The MIT Press}
}

@Article{Crawford96,
 author = {J.M. Crawford and L.D. Auton},
 title = {Experimental results on the crossover point in random {3SAT}},
 journal = {Artificial Intelligence},
 year = {1996},
 volume = {81},
 pages = {31--57}
}

@Article{Creignou2003,
  author  = {N. Creignou and H. DaudÈ},
  title   = {Generalized satisfiability problems: minimal elements and phase transitions},
  journal = {Theoretical Computer Science},
  year    = {2003},
  volume  = {302},
  number  = {1-3},
  pages   = {417-430},
  month   = {13 June},
}

@Article{Creignou2003b,
  author =   {N. Creignou and H. DaudÈ and O. Dubois},
  title =    {{Approximating The Satisfiability Threshold For Random K-Xor-Formulas}},
  journal =      {Combinatorics, Probability & Computing},
  year =     2003,
  volume =   12,
  number =   2
}

@article{Creignou95,
  author    = {N. Creignou},
  title     = {A Dichotomy Theorem for Maximum Generalized Satisfiability Problems},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {51},
  number    = {3},
  pages     = {511--522},
  year      = {1995},
}

@Article{CreignouHermann96,
  author =       {N. Creignou and M. Hermann},
  title =        {Complexity of generalized satisfiability counting problems},
  journal =      {Information and Computation},
  year =         {1996},
  volume = {125},
  number = {1},
  pages = {1--12}
}

@inproceedings{DBLP:conf/aaai/KleerB84,
  author    = {J. de Kleer and
               D.G. Bobrow},
  title     = {Qualitative Reasoning With Higher-Order Derivatives},
  booktitle = {Proc. of {AAAI}'84},
  pages     = {86--91},
  year      = {1984},
  }

@inproceedings{DBLP:conf/aaai/Marquis15,
  author    = {P. Marquis},
  title     = {Compile!},
  booktitle = {Proc. of {AAAI}'15},
  pages     = {4112--4118},
  year      = {2015},
}

 @inproceedings{DBLP:conf/cav/BrauerKK11,
  author    = {J. Brauer and
               A. King and
               J. Kriener},
  title     = {Existential Quantification as Incremental {SAT}},
  booktitle = {Proc. of CAV'11},
  pages     = {191--207},
  year      = {2011},
}

@inproceedings{DBLP:conf/cav/Monniaux10,
  author    = {D. Monniaux},
  title     = {Quantifier Elimination by Lazy Model Enumeration},
  booktitle = {Proc. of {CAV}'10},
  pages     = {585--599},
  year      = {2010},
}

@inproceedings{DBLP:conf/cluster/BurchardSB16,
  author    = {Jan Burchard and Tobias Schubert and Bernd Becker},
  title     = {Distributed Parallel {\#}SAT Solving},
  booktitle = {Proc. of CLUSTER'16},
   pages     = {326--335},
  year      = {2016},
}

@inproceedings{DBLP:conf/cp/Razgon15,
  author    = {I. Razgon},
  title     = {Quasipolynomial Simulation of {DNNF} by a Non-determistic Read-Once
               Branching Program},
  booktitle = {Proc. of CP'15},
  pages     = {367--375},
  year      = {2015},
}

@inproceedings{DBLP:conf/cp/SchumannSH09,
  author    = {A. Schumann and
               M. Sachenbacher and
               J. Huang},
  title     = {Constraint-Based Optimal Testing Using {DNNF} Graphs},
  booktitle = {Proc. of CP'09},
  pages     = {731--745},
  year      = {2009},
}

@inproceedings{DBLP:conf/cp/Sinz05,
  author    = {C. Sinz},
  title     = {Towards an Optimal {CNF} Encoding of Boolean Cardinality Constraints},
  booktitle = {Proc. of CP'05},
  pages     = {827--831},
  year      = {2005},
}

@article{DBLP:journals/constraints/AsinNOR11,
  author    = {R. As{\'{\i}}n and
               R. Nieuwenhuis and
               A. Oliveras and
               E. Rodr{\'{\i}}guez{-}Carbonell},
  title     = {Cardinality Networks: a theoretical and empirical study},
  journal   = {Constraints},
  volume    = {16},
  number    = {2},
  pages     = {195--221},
  year      = {2011},
}


@inproceedings{DBLP:conf/fmics/ZenglerK13,
  author    = {Ch. Zengler and
               W. K{\"{u}}chlin},
  title     = {Boolean Quantifier Elimination for Automotive Configuration - {A}
               Case Study},
  booktitle = {Proc. of FMICS'13},
  pages     = {48--62},
  year      = {2013},
}

@inproceedings{bounia2023approximating,
  title={Approximating Probabilistic Explanations via Supermodular Minimization (Corrected Version)},
  author={Bounia, Louenas and Koriche, Frederic},
  booktitle={Uncertainty in Artificial Intelligence (UAI 2023).},
  pages={216--225},
  year={2023}
}

@article{Mothilal2019,
  title={Explaining machine learning classifiers through diverse counterfactual explanations},
  author={Ramaravind Kommiya Mothilal and Amit Sharma and Chenhao Tan},
  journal={Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency},
  year={2019},
  url={https://api.semanticscholar.org/CorpusID:159041688}
}

@inproceedings{DBLP:conf/ijcai/BroeckTMDR11,
  author    = {G. Van den Broeck and
               N. Taghipour and
               W. Meert and
               J. Davis and
               L. De Raedt},
  title     = {Lifted Probabilistic Inference by First-Order Knowledge Compilation},
  booktitle = {{IJCAI} 2011, Proceedings of the 22nd International Joint Conference
               on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22,
               2011},
  pages     = {2178--2185},
  year      = {2011},
  url       = {http://ijcai.org/papers11/Papers/IJCAI11-363.pdf},
  timestamp = {Tue, 09 Aug 2011 14:09:58 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/ijcai/BroeckTMDR11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

@inproceedings{DBLP:conf/ijcai/BrownK83,
  author    = {J. Seely Brown and
               J. de Kleer},
  title     = {The Origin, Form, and Logic of Qualitative Physical Laws},
  booktitle = {Proc. of {IJCAI}'83},
  pages     = {1158--1169},
  year      = {1983},
}

@inproceedings{DBLP:conf/ijcai/ChakrabortyFMV15,
  author    = {S. Chakraborty and
               D. Fried and
               K. S. Meel and
               M. Y. Vardi},
  title     = {From Weighted to Unweighted Model Counting},
  booktitle = {Proc. of IJCAI'15},
  pages     = {689--695},
  year      = {2015},
}

@inproceedings{DBLP:conf/kr/BroeckMD14,
  author    = {G. Van den Broeck and
               W. Meert and
               A. Darwiche},
  title     = {Skolemization for Weighted First-Order Model Counting},
  booktitle = {Principles of Knowledge Representation and Reasoning: Proceedings
               of the Fourteenth International Conference, {KR} 2014, Vienna, Austria,
               July 20-24, 2014},
  year      = {2014},
  url       = {http://www.aaai.org/ocs/index.php/KR/KR14/paper/view/8012},
  timestamp = {Thu, 31 Jul 2014 10:35:22 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/kr/BroeckMD14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

@inproceedings{DBLP:conf/nfm/BrauerK11,
  author    = {J. Brauer and
               A. King},
  title     = {Approximate Quantifier Elimination for Propositional Boolean Formulae},
  booktitle = {Proc. of {NASA} Symposium on Formal Methods},
  pages     = {73--88},
  year      = {2011},
}

@inproceedings{DBLP:conf/pods/BovaS17,
  author    = {S. Bova and
               S. Szeider},
  title     = {Circuit Treewidth, Sentential Decision, and Query Compilation},
  booktitle = {Proceedings of the 36th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
               of Database Systems, {PODS} 2017, Chicago, IL, USA, May 14-19, 2017},
  pages     = {233--246},
  year      = {2017},
}

@inproceedings{Azizetal15,
  author    = {R. A. Aziz and
               G. Chu and
               Ch. J. Muise and
               P. J. Stuckey},
  title     = {{\#}{\(\exists\)}SAT: Projected Model Counting},
  booktitle = {Proc. of SAT'15},
  pages     = {121--137},
  year      = {2015},
}

@inproceedings{DBLP:conf/sat/BovaCMS15,
  author    = {S. Bova and
               F. Capelli and
               S. Mengel and
               F. Slivovsky},
  title     = {On Compiling CNFs into Structured Deterministic DNNFs},
  booktitle = {Proc. of SAT'15},
  pages     = {199--214},
  year      = {2015},
}

@inproceedings{DBLP:conf/sat/BurchardSB15,
  author    = {Jan Burchard and Tobias Schubert and Bernd Becker},
  title     = {Laissez-Faire Caching for Parallel {\#}SAT Solving},
  booktitle = {Proc. of SAT'15},
  pages     = {46--61},
  year      = {2015},
}

@inproceedings{DBLP:conf/uai/BeameL15,
  author    = {P. Beame and
               V. Liew},
  title     = {New Limits for Knowledge Compilation and Applications to Exact Model
               Counting},
  booktitle = {Proc. of UAI'15},
  pages     = {131--140},
  year      = {2015},
}

@article{DBLP:journals/ai/KleerW87,
  author    = {J. de Kleer and
               B. C. Williams},
  title     = {Diagnosing Multiple Faults},
  journal   = {Artificial Intelligence},
  volume    = {32},
  number    = {1},
  pages     = {97--130},
  year      = {1987},
}

 @article{DBLP:journals/constraints/IvriiMMV16,
  author    = {A. Ivrii and
               S. Malik and
               K. S. Meel and
               M. Y. Vardi},
  title     = {On computing minimal independent support and its applications to sampling
               and counting},
  journal   = {Constraints},
  volume    = {21},
  number    = {1},
  pages     = {41--58},
  year      = {2016},
}

@article{DBLP:journals/debu/GribkoffSB14,
  author    = {Eric Gribkoff and
               Dan Suciu and
               Guy Van den Broeck},
  title     = {Lifted Probabilistic Inference: {A} Guide for the Database Researcher},
  journal   = {{IEEE} Data Eng. Bull.},
  volume    = {37},
  number    = {3},
  pages     = {6--17},
  year      = {2014},
  url       = {http://sites.computer.org/debull/A14sept/p6.pdf},
  timestamp = {Wed, 15 Oct 2014 20:48:39 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/debu/GribkoffSB14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
                 
@article{DBLP:journals/eccc/Haan15,
  author    = {R. {de Haan}},
  title     = {An Overview of Non-Uniform Parameterized Complexity},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {22},
  pages     = {1-36},
  year      = {2015},
}     

@article{DBLP:journals/fmsd/GoldbergM14,
  author    = {E. Goldberg and
               P. Manolios},
  title     = {Quantifier elimination by dependency sequents},
  journal   = {Formal Methods in System Design},
  volume    = {45},
  number    = {2},
  pages     = {111--143},
  year      = {2014},
}

@article{DBLP:journals/jar/LagniezM17,
  author    = {J.-M. Lagniez and P. Marquis},
  title     = {On Preprocessing Techniques and Their Impact on Propositional Model
               Counting},
  journal   = {J. Autom. Reasoning},
  volume    = {58},
  number    = {4},
  pages     = {413--481},
  year      = {2017},
}

   @article{DBLP:journals/jsat/BelovM12,
  author    = {A. Belov and
               J. Marques{-}Silva},
  title     = {{MUSer2:} An Efficient {MUS} Extractor},
  journal   = {{JSAT}},
  volume    = {8},
  number    = {3/4},
  pages     = {123--128},
  year      = {2012},
}

@article{audemard2022raisons,
  title={Les raisons majoritaires: des explications abductives pour les for{\^e}ts al{\'e}atoires},
  author={Audemard, Gilles and Bellart, Steve and Bounia, Louenas and Koriche, Fr{\'e}d{\'e}ric and Lagniez, Jean-Marie and Marquis, Pierre},
  journal={EGC'2022},
  volume={38},
  year={2022},
  publisher={BoD-Books on Demand}
}

 @article{DBLP:journals/jsc/PlaistedG86,
  author    = {D. A. Plaisted and
               S. Greenbaum},
  title     = {A Structure-Preserving Clause Form Translation},
  journal   = {Journal of Symbolic Computation},
  volume    = {2},
  number    = {3},
  pages     = {293--304},
  year      = {1986},
}

@article{DBLP:journals/ml/HaarenBMD16,
  author    = {Jan Van Haaren and
               Guy Van den Broeck and
               Wannes Meert and
               Jesse Davis},
  title     = {Lifted generative learning of Markov logic networks},
  journal   = {Machine Learning},
  volume    = {103},
  number    = {1},
  pages     = {27--55},
  year      = {2016},
  url       = {http://dx.doi.org/10.1007/s10994-015-5532-x},
  doi       = {10.1007/s10994-015-5532-x},
  timestamp = {Sat, 12 Mar 2016 18:25:57 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/ml/HaarenBMD16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

@article{DBLP:journals/pvldb/GatterbauerS15,
  author    = {Wolfgang Gatterbauer and
               Dan Suciu},
  title     = {Approximate Lifted Inference with Probabilistic Databases},
  journal   = {{PVLDB}},
  volume    = {8},
  number    = {5},
  pages     = {629--640},
  year      = {2015},
  url       = {http://www.vldb.org/pvldb/vol8/p629-gatterbauer.pdf},
  timestamp = {Fri, 23 Jan 2015 18:37:49 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/pvldb/GatterbauerS15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

@article{DBLP:journals/pvldb/GribkoffS16,
  author    = {Eric Gribkoff and
               Dan Suciu},
  title     = {SlimShot: In-Database Probabilistic Inference for Knowledge Bases},
  journal   = {{PVLDB}},
  volume    = {9},
  number    = {7},
  pages     = {552--563},
  year      = {2016},
  url       = {http://www.vldb.org/pvldb/vol9/p552-gribkoff.pdf},
  timestamp = {Thu, 03 Mar 2016 14:20:18 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/pvldb/GribkoffS16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

@article{DBLP:journals/siamcomp/Toda91,
  author    = {S. Toda},
  title     = {{PP} is as Hard as the Polynomial-Time Hierarchy},
  journal   = {{SIAM} Journal on Computing},
  volume    = {20},
  number    = {5},
  pages     = {865--877},
  year      = {1991},
}

@article{DBLP:journals/tods/GatterbauerS14,
  author    = {Wolfgang Gatterbauer and
               Dan Suciu},
  title     = {Oblivious bounds on the probability of boolean functions},
  journal   = {{ACM} Trans. Database Syst.},
  volume    = {39},
  number    = {1},
  pages     = {5},
  year      = {2014},
  url       = {http://doi.acm.org/10.1145/2532641},
  doi       = {10.1145/2532641},
  timestamp = {Tue, 18 Feb 2014 20:53:58 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/tods/GatterbauerS14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}


@book{DBLP:series/synthesis/2011Suciu,
  author    = {Dan Suciu and
               Dan Olteanu and
               Christopher R{\'{e}} and
               Christoph Koch},
  title     = {Probabilistic Databases},
  booktitle = {Probabilistic Databases},
  series    = {Synthesis Lectures on Data Management},
  publisher = {Morgan {\&} Claypool Publishers},
  year      = {2011},
  url       = {http://dx.doi.org/10.2200/S00362ED1V01Y201105DTM016},
  doi       = {10.2200/S00362ED1V01Y201105DTM016},
  timestamp = {Thu, 03 Mar 2016 17:54:19 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/series/synthesis/2011Suciu},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

@Article{DPLL62,
  author =   {M. Davis and G. Logemann and D. Loveland},
  title =    {A machine program for theorem-proving},
  journal =      {Journal of the ACM},
  year =     1962,
  volume =   5,
  number =   7,
  pages =    {394--397},
  month =    {July}
}

@inproceedings{Audemard2023OnCE,
  title={On Contrastive Explanations for Tree-Based Classifiers},
  author={Gilles Audemard and Jean-Marie Lagniez and Pierre Marquis and Nicolas Szczepanski},
  booktitle={European Conference on Artificial Intelligence},
  year={2023},
  url={https://api.semanticscholar.org/CorpusID:264289955}
}

@Article{Dalal1992a,
  author    = {M. Dalal and D. W. Etherington},
  title     = {A hierarchy of tractable satisfiability problems},
  journal   = {Information Processing Letters},
  year      = {1992},
  volume    = {44},
  number    = {4},
  pages     = {173--180},
  issn      = {0020-0190},
  publisher = {Elsevier North-Holland, Inc.},
  url       = {ftp://ftp.cirl.uoregon.edu/pub/users/ether/tract-hier.ps.gz},
}

@InProceedings{Dalal1996,
  author =   {M. Dalal},
  title =    {An Almost Quadratic Class of Satisfiability Problems},
  booktitle =    ecai96,
  pages =    {355-359},
  year =     1996,
  url =          {citeseer.nj.nec.com/dalal96almost.html}
}

@InProceedings{Dalal88,
 author = {M. Dalal},
 title = {Investigations into a theory of knowledge base revision: Preliminary report},
 booktitle = {Proc. of the $7^{th}$ National Conference on
 Artificial Intelligence (AAAI'88)},
 year = {1988},
 pages = {475--479}
}

@TechReport{Dalmau1997,
  author      = {V. Dalmau},
  title       = {{Some Dichotomy Theorems on Constant-free Quantified Boolean Formulas}},
  institution = {Departament LSI (UPC)},
  year        = {1997},
  number      = {LSI-97-43-R},
}

@InProceedings{Dalmau1997a,
    author = "V. Dalmau",
    title = "A Dichotomy Theorem for Learning Quantified Boolean Formulas",
    booktitle = {COLT'97},
    publisher = "ACM Press",
    pages = "193--200",
    year = "1997",
    url = "citeseer.ist.psu.edu/article/dalmau97dichotomy.html"
}

@Article{Dalmau1999,
  author =   {V. Dalmau},
  title =    {{A Dichotomy Theorem for Learning Quantified Boolean Formulas}},
  journal =      {Machine Learning},
  year =     1999,
  volume =   35,
  number =   3,
  month =    {June}
}

@article{Dalmau2003,
 author = {V. Dalmau and P. Jeavons},
 title = {Learnability of quantified formulas},
 journal = {Theoretical Computer Science},
 volume = {306},
 number = {1-3},
 year = {2003},
 issn = {0304-3975},
 pages = {485--511},
 doi = {http://dx.doi.org/10.1016/S0304-3975(03)00342-6},
 publisher = {Elsevier Science Publishers Ltd.},
}

@Article{Darwiche01,
  author = 	 {A. Darwiche},
  title = 	 {Decomposable negation normal form},
  journal = 	 {Journal of the Association for Computing Machinery},
  year = 	 {2001},
  volume = 	 {48}, 
  number = {4},
  pages = 	 {608--647}
}

@inproceedings{Darwiche02,
  author    = {A. Darwiche},
  title     = {A Compiler for Deterministic, Decomposable Negation Normal Form},
  booktitle = {Proceedings of the Eighteenth National Conference on Artificial Intelligence
               and Fourteenth Conference on Innovative Applications of Artificial
               Intelligence, July 28 - August 1, 2002, Edmonton, Alberta, Canada.},
  pages     = {627--634},
  year      = {2002},
}

@inproceedings{Darwiche04,
  author    = {A. Darwiche},
  title     = {New Advances in Compiling {CNF} into Decomposable Negation
               Normal Form},
  booktitle = {Proc. of ECAI'04},
  year      = {2004},
  pages     = {328-332},
  OPTcrossref  = {DBLP:conf/ecai/2004},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@book{Darwiche09,
  author    = {A. Darwiche},
  title     = {Modeling and Reasoning with Bayesian Networks},
  publisher = {Cambridge University Press},
  year      = {2009},
  isbn      = {978-0-521-88438-9},
  pages     = {I-XII, 1-548},
  OPTee        = {http://www.cambridge.org/uk/catalogue/catalogue.asp?isbn=9780521884389},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{Darwiche11,
  author    = {A. Darwiche},
  title     = {{SDD}: A New Canonical Representation of Propositional Knowledge
               Bases},
  booktitle = {Proc. of IJCAI'11},
  year      = {2011},
  pages     = {819-826},
  OPTee        = {http://ijcai.org/papers11/Papers/IJCAI11-143.pdf},
  OPTcrossref  = {DBLP:conf/ijcai/2011},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@InBook{Darwiche14,
  author =	 {A. Darwiche},
  title =	 {Tractable Knowledge Representation Formalisms},
  publisher =	 {Cambridge University Press},
  year =	 {2014},
  series = {Tractability --Practical Approaches to Hard Problems},
  pages =	 {141--172},
}

@Article{Darwiche1997,
  author  = {A. Darwiche},
  title   = {A logical notion of conditional independence: properties and applications},
  journal = {Artificial Intelligence},
  year    = {1997},
  volume  = {97},
  number  = {1--2},
  pages   = {45--82},
}

@Article{Darwiche1998,
  author  = {A. Darwiche},
  title   = {Model--Based Diagnosis using Structured System Descriptions},
  journal = {Journal of Artificial Intelligence Research},
  year    = {1998},
  volume  = {8},
  pages   = {165-222},
}

@InProceedings{Darwiche2002a,
  author    = {A. Darwiche},
  title     = {A Compiler for Deterministic Decomposable Negation Normal Form},
  booktitle = aaai02,
  year      = {2002},
  pages     = {627--634},
}

@InProceedings{Darwiche2002b,
  author    = {A. Darwiche},
  title     = {A Logical Approach to Factoring Belief Networks},
  booktitle = {Proc. of KR'02},
  year      = {2002},
  pages     = {409--420},
}

@Article{Darwiche97,
  author =   {A. Darwiche},
  title =    {A logical notion of conditional independance :
                  properties and applications},
  journal =      {Artificial Intelligence},
  year =     {1997},
  volume =   {97},
  number =   {1--2},
  pages =    {45--82}
}

@article{Darwiche98,
  author    = {A. Darwiche},
  title     = {Model-Based Diagnosis using Structured System Descriptions},
  journal   = {Journal of Artificial Intelligence Research},
  volume    = {8},
  year      = {1998},
  pages     = {165-222},
  OPTee        = {http://dx.doi.org/10.1613/jair.462},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@InProceedings{Darwiche99,
  author    = {A. Darwiche},
  title     = {Compiling devices into decomposable negation normal form},
  booktitle = ijcai99,
  year      = {1999},
  pages     = {284--289},
}

@inproceedings{DarwicheICAPS05,
author = {H. Palacios and B. Bonet and A. Darwiche and H. Geffner},
title = {Pruning Conformant Plans by Counting Models on Compiled {d-DNNF} Representations},
booktitle = {Proc. of ICAPS'05},
pages = {141--150},
OPTpublisher = {AAAI Press},
OPTaddress = {Monterey},
year = {2005}
}

@article{DarwicheJANCL,
  author    = {A. Darwiche},
  title     = {On the Tractable Counting of Theory Models and its Application
               to Truth Maintenance and Belief Revision},
  journal   = {Journal of Applied Non-Classical Logics},
  volume    = {11},
  number    = {1-2},
  year      = {2001},
  pages     = {11-34},
  OPTee        = {http://dx.doi.org/10.3166/jancl.11.11-34},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@InProceedings{DarwicheMarquis01,
  author =   {A. Darwiche and P. Marquis},
  title =    {A perspective on knowledge compilation},
  booktitle =    ijcai01,
  pages =    {175--182},
  year =     {2001},
  address =  {Seattle (WA)}
}

@Article{DarwicheMarquis02,
  author =       {A. Darwiche and P. Marquis},
  title =        {A knowledge compilation map},
  journal =      {Journal of Artificial Intelligence Research},
  year =         {2002},
  volume = {17},
  OPTnumber = {},
  pages = {229--264}
}

@Article{DarwicheMarquis04,
  author =   {A. Darwiche and P. Marquis},
  title =    {Compiling Propositional Weighted Bases},
  journal =      {Artificial Intelligence},
  year =     {2004},
  volume =   {157},
  number =   {1-2},
  pages =        {81-113}
}


@InProceedings{DarwichePearl94,
  author = 	 {A. Darwiche and J. Pearl},
  title = 	 {Symbolic causal networks},
  booktitle = 	 {Proc. of AAAI'94},
  year = 	 {1994},
  address = 	 {Seattle (WA)},
  pages =	 {238--244}
}

@article{Davis1960,
 author = {M. Davis and H. Putnam},
 title = {A Computing Procedure for Quantification Theory},
 journal = {Journal of the ACM},
 volume = {7},
 number = {3},
 year = {1960},
 issn = {0004-5411},
 pages = {201--215},
 doi = {http://doi.acm.org/10.1145/321033.321034},
 publisher = {ACM Press},
}

@Article{Davis1960a,
  author  = {M. Davis and H. Putnam},
  title   = {A computing procedure for quantification theory},
  journal = {JACM},
  year    = {1960},
  volume  = {7},
  pages   = {201--215},
}

@Article{Davis1960b,
  author    = {M. Davis and H. Putnam},
  title     = {A Computing Procedure for Quantification Theory},
  journal   = {Journal of the ACM},
  year      = {1960},
  volume    = {7},
  number    = {3},
  pages     = {201--215},
  issn      = {0004-5411},
  doi       = {http://doi.acm.org/10.1145/321033.321034},
  publisher = {ACM Press},
}
 
@article{Davis1962,
 author = {M. Davis and G. Logemann and D. Loveland},
 title = {A machine program for theorem-proving},
 journal = {Communications of the ACM},
 volume = {5},
 number = {7},
 year = {1962},
 issn = {0001-0782},
 pages = {394--397},
 doi = {http://doi.acm.org/10.1145/368273.368557},
 publisher = {ACM Press},
}

@Article{Davis1962a,
  author  = {M. Davis and G. Logemann and D. Loveland},
  title   = {A machine program for theorem proving},
  journal = {CACM},
  year    = {1962},
  volume  = {5},
  pages   = {394--397},
}
                 
                 
@Article{Davis1962b,
  author    = {M. Davis and G. Logemann and D. Loveland},
  title     = {A machine program for theorem-proving},
  journal   = {Communications of the ACM},
  year      = {1962},
  volume    = {5},
  number    = {7},
  pages     = {394--397},
  issn      = {0001-0782},
  doi       = {http://doi.acm.org/10.1145/368273.368557},
  publisher = {ACM Press},
}

@Article{Davis1962c,
  author  = {M. Davis and G. Logemann and D. Loveland},
  title   = {A machine program for theorem-proving},
  journal = {Journal of the ACM},
  year    = {1962},
  volume  = {5},
  number  = {7},
  pages   = {394--397},
  month   = {July},
}

@Article{Davis1962d,
  author  = {M. Davis and G. Logemann and D. Loveland},
  title   = {A machine program for theorem proving},
  journal = {CACM},
  year    = {1962},
  volume  = {5},
  pages   = {394--397},
}

@Article{DavisPutnam60,
 author = {M. Davis and H. Putnam},
 title = {A computing procedure for quantification theory},
 journal = {JACM},
 year = {1960},
 volume = {7},
 pages = {201--215}
}

@Article{Davisetal62,
  author = 	 {M. Davis and G. Logemann and D. Loveland},
  title = 	 {A machine program for theorem proving},
  journal = 	 {Communications of the Association for Computing Machinery},
  year = 	 {1962},
  volume = 	 {5},
  pages = 	 {394--397}
}

@Article{DeKleer86,
  author = 	 {J. de Kleer},
  title = 	 {An assumption-based TMS},
  journal = 	 {Artificial Intelligence},
  year = 	 {1986},
  volume = 	 {28},
  pages = 	 {127--167}
}

@InProceedings{DeKleer92,
  author = 	 {J. de Kleer},
  title = 	 {An improved incremental algorithm for generating
		  prime implicates},
  booktitle = 	 {Proc. of the $10^{th}$ National Conference on
		  Artificial Intelligence (AAAI'92)},
  year = 	 {1992},
  address = 	 {San Jose (CA)},
  pages = 	 {780--785}
}


@Article{DeKleerKonolige89,
  author = 	 {J. de Kleer and K. Konolige},
  title = 	 {Eliminating the fixed predicates from a circumscription},
  journal = 	 {Artificial Intelligence},
  year = 	 {1989},
  volume = 	 {39},
  pages = 	 {391--398}
}

@Article{DeKleeretal92,
 author = {J. de Kleer and A.K. Mackworth and R. Reiter},
 title = {Characterizing diagnoses and systems},
 journal = {Artificial Intelligence},
 year = {1992},
 volume = {56},
 pages = {197--222}
}

@Article{DechterPearl92,
  author =       {R. Dechter and J. Pearl},
  title =        {Structure identification in relational data},
  journal =      {Artificial Intelligence},
  year =         {1992},
  volume = {58},
  pages = {237--270}
}

@InProceedings{DechterRish94,
  author = 	 {R. Dechter and I. Rish},
  title = 	 {Directional resolution: the Davis-Putnam procedure, revisited},
  booktitle = 	 {Proc. of the $4^{th}$ International Conference on
		  Principles of Knowledge Representation and Reasoning
		  (KR'94)},
  year = 	 {1994},
  address = 	 {Bonn},
  pages = 	 {134--145}
}

@InProceedings{DelVal94,
  author = 	 {A. del Val},
  title = 	 {Tractable databases: how to make propositional unit resolution complete through compilation},
  booktitle = 	 {Proc. of the $4^{th}$ International Conference on Principles of Knowledge Representation and Reasoning (KR'94)},
  year = 	 {1994},
  address = 	 {Bonn},
  pages = 	 {551--561}
}

@InProceedings{DelVal95,
  author = 	 {A. del Val},
  title = 	 {An analysis of approximate knowledge compilation},
  booktitle = 	 {Proc. of the $14^{th}$ International Joint
		  Conference on Artificial Intelligence (IJCAI'95)},
  year = 	 {1995},
  address = 	 {Montreal},
  pages = 	 {830--836}
}

@InProceedings{Delgrande2001,
  author =   {J. P. Delgrande and T. Schaub and H. Tompits and S. Woltran},
  title =    {{On Computing Solutions to Belief Change Scenarios}},
  booktitle =    {ECSQARU'01},
  year =     {510--521},
  OPTeditor =    {S. Benferhat and P. Besnard},
  OPTvolume =    2143
}

@InProceedings{Delgrande510--521,
  author    = {J. P. Delgrande and T. Schaub and H. Tompits and S. Woltran},
  title     = {{On Computing Solutions to Belief Change Scenarios}},
  booktitle = {ECSQARU'01},
  year      = {510--521},
  opteditor = {S. Benferhat and P. Besnard},
  optvolume = {2143},
}

@InProceedings{DemolombeLuis91,
  author = 	 {R. Demolombe and L. Fari{\~n}as del Cerro},
  title = 	 {An inference rule for hypothesis generation},
  booktitle = 	 {Proc. of the $12^{th}$ International Joint
		  Conference on Artificial Intelligence (IJCAI'91)},
  year = 	 {1991},
  address = 	 {Sydney},
  pages = 	 {152--157}
}
 
@InProceedings{Ding2001a,
  author   = {D. Ding and H. Kleine-B\"uning and X. Zhao},
  title    = {{Minimal Falsity for QBF with Fixed Deficiency}},
  pages    = {21--28},
  crossref = {Egly2001f},
}

@Proceedings{Dix1997,
  title     = {Logic Programming and Nonmonotonic Reasoning, 4th International Conference, LPNMR'97, Dagstuhl Castle, Germany, July 28-31, 1997, Proc.},
  year      = {1997},
  editor    = {J{\"u}rgen Dix and Ulrich Furbach and Anil Nerode},
  volume    = {1265},
  series    = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn      = {3-540-63255-7},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  booktitle = {LPNMR},
}

@InProceedings{Dohertyetal95,
 author = {P. Doherty and W. Lukaszewicz and A. Szalas},
 title = {Computing circumscription revisited: preliminary report},
 booktitle = {Proc. of the $14^{th}$ International Joint
 Conference on Artificial Intelligence (IJCAI'95)},
 year = {1995},
 address = {Montreal},
 pages = {1502--1508}
}

@Article{DowlingGallier84,
  author = 	 {W. Dowling and J.H. Gallier},
  title = 	 {Linear time algorithms for testing the
		  satisfiability of propositional {H}orn formulae},
  journal = 	 {Journal of Logic Programming},
  year = 	 {1984},
  volume = 	 {1},
  number = 	 {3},
  pages = 	 {267--284}
}

@book{DowneyFellows99,
  author    = {R. G. Downey and
               M. R. Fellows},
  title     = {Parameterized Complexity},
  series    = {Monographs in Computer Science},
  publisher = {Springer},
  year      = {1999},
  }
   
@Article{Dubois1997,
  author  = {D. Dubois and F. Esteva and P. Garcia and L. Godo and H. Prade},
  title   = {A logical approach to interpolation based on similarity relations},
  journal = {International Journal of Approximate Reasoning},
  year    = {1997},
  volume  = {17},
  number  = {1},
  pages   = {1--36},
}
 
@InBook{Dubois96,
 author = {O. Dubois and P. Andr\'e and Y. Boufkhad and J. Carlier},
 title = {SAT versus UNSAT},
 publisher = {Trick and Johnson},
 year = {1996},
 pages = {415--436}
}

@InProceedings{Duboisetal98,
  author = 	 {D. Dubois and D. Le Berre and H. Prade and R. Sabbadin},
  title = 	 {Logical representation and computation of optimal
		  decisions in a qualitative setting},
  booktitle = 	 {Proc. of AAAI'98},
  year = 	 {1998},
  address = 	 {Madison (WI)},
  pages = 	 {588--593}
}

@Article{Dunham1959,
  author    = {B. Dunham and B. Fridshal},
  title     = {The problem of simplifying logical expressions},
  journal   = {Journal of Symbolic Logic},
  year      = {1959},
  optpages  = {17--19},
  optvolume = {24},
}

@Article{Dunham1959a,
  author    = {B. Dunham and B. Fridshal},
  title     = {The problem of simplifying logical expressions},
  journal   = {Journal of Symbolic Logic},
  year      = {1959},
  optpages  = {17--19},
  optvolume = {24},
}

@Article{DunhamFridshal59,
  author = 	 {B. Dunham and B. Fridshal},
  title = 	 {The problem of simplifying logical expressions},
  journal = 	 {Journal of Symbolic Logic},
  year = 	 {1959},
  volume = 	 {24},
  pages = 	 {17--19}
}


@article{Dyeretal09,
  author    = {M. E. Dyer and
               L. A. Goldberg and
               M. Jerrum},
  title     = {The Complexity of Weighted Boolean \#{CSP}},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {5},
  pages     = {1970--1986},
  year      = {2009},
}

@InProceedings{Egly00,
  author =   {U. Egly and T. Eiter and H. Tompits and S. Woltran},
  title =    {Solving advanced reasoning tasks using {Q}uantified
                  {B}oolean {F}ormulas},
  booktitle =    aaai00,
  year =         {2000},
  pages =        {417--422}
}


@article{IzzaDT1,
  title={On Tackling Explanation Redundancy in Decision Trees},
  author={Yacine Izza and Alexey Ignatiev and Joao Marques-Silva},
  journal={J. Artif. Intell. Res.},
  year={2022},
  volume={75},
  pages={261-321},
}


@InProceedings{Egly2000,
  author    = {U. Egly and T. Eiter and H. Tompits and S. Woltran},
  title     = {{QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks}},
  booktitle = {CoRR},
  year      = {2000},
  editor    = {Electronic Edition},
  month     = {March},
}

@InProceedings{Egly2001,
  author =   {U. Egly and T. Eiter and R. Feldmann and S. Schamberger and H. Tompits and and S. Woltran},
  title =    {{On Mechanizing Modal Nonmonotonic Logics}},
  booktitle =    {DGNMR-01},
  year =     2001
}

@InProceedings{Egly2001a,
  author =   {U. Egly and T. Eiter and V. Klotz and H. Tompits},
  title =    {{Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results}},
  booktitle =    {Proc. of the AAAI 2001 Spring Symposium on Answer Set Programming},
  year =     2001
}

@InProceedings{Egly2001d,
  author   = {U. Egly and T. Eiter and V. Klotz and H. Tompits},
  title    = {{A Toolbox for Abduction: Preliminary Report}},
  crossref = {Egly2001f},
}

@Proceedings{Egly2001f,
  title     = {Proc. of QBF2001 workshop at IJCAR'01},
  year      = {2001},
  editor    = {U. Egly and R. Feldmann and H. Tompits},
  address   = {Siena, Italy},
  month     = {June},
  booktitle = {Proc. of QBF2001 workshop at IJCAR'01},
  url       = {http://www.uni-paderborn.de/fachbereich/AG/monien/PERSONAL/qbf2001.tar.gz},
}

@InProceedings{Egly2002,
  author    = {U. Egly and T. Eiter and V. Klotz and S. Woltran},
  title     = {{Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks}},
  booktitle = {Proc. of the Eleventh Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2002)},
  year      = {2002},
  editor    = {Springer LNAI 2381},
  pages     = {100-114},
}

@InProceedings{Egly2002c,
  author   = {U. Egly and H. Tompits},
  title    = {{On Quantifier Shifting for Quantified Boolean Formulas}},
  pages    = {48--61},
  crossref = {Narizzano2002a},
}

@Article{Eiter1995c,
  author  = {T. Eiter and T. Kilpelainen and H. Mannila},
  title   = {{Recognizing renamable generalized propositional {H}orn formulas is NP-complete}},
  journal = {Discrete Applied Mathematics},
  year    = {1995},
  volume  = {2},
  number  = {59},
  pages   = {23--32},
}

@InProceedings{Eiter2002,
  author =   {T. Eiter and T. Ibaraki and K. Makino},
  title =    {{Recognition and Dualization of Disguised Bidual Horn Functions}},
  booktitle =    {Information Processing Letters},
  pages =    {283-291},
  year =     2002,
  volume =   82
}

@inproceedings{d4,
  title     = {DMC: A Distributed Model Counter},
  author    = {Jean-Marie Lagniez and Pierre Marquis and Nicolas Szczepanski},
  publisher = {International Joint Conferences on Artificial Intelligence Organization},
  pages     = {1331--1338},
  year      = {2018},
}


@Article{Eiter95,
  author =   {T. Eiter and T. Kilpelainen and H. Mannila},
  title =    {{Recognizing renamable generalized propositional Horn formulas is NP-complete}},
  journal =      {Discrete Applied Mathematics},
  year =     1995,
  volume =   2,
  number =   59,
  pages =    {23--32}
}

@article{giniyuan2021,
  title={Gini-Impurity index analysis},
  author={Yuan, Ye and Wu, Liji and Zhang, Xiangmin},
  journal={IEEE Transactions on Information Forensics and Security},
  volume={16},
  pages={3154--3169},
  year={2021},
  publisher={IEEE}
}

@Article{Eiter99,
  author =   {T. Eiter and T. Ibaraki and K. Makino},
  title =    {{Bidual Horn Functions and Extensions}},
  journal =      {Discrete Applied Mathematics},
  year =     1999,
  volume =   {96--97},
  pages =    {55--88}
}

@Article{EiterGottlob93,
  author = 	 {Th. Eiter and G. Gottlob},
  title = 	 {Propositional circumscription and extended 
		  closed-world reasoning are ${\Pi}_2^P$-complete},
  journal = 	 {Theoretical Computer Science},
  year = 	 {1993},
  volume = 	 {114},
  pages = 	 {231--245}
}

@Article{EiterGottlob95,
  author = 	 {Th. Eiter and G. Gottlob},
  title = 	 {The complexity of logic-based abduction},
  journal = 	 {Journal of the Association for Computing Machinery},
  year = 	 {1995},
  volume = 	 {42},
  number = 	 {1},
  pages = 	 {3--42}
}

@InProceedings{Eiteretal95,
  author = 	 {Th. Eiter and G. Gottlob and N. Leone},
  title = 	 {Semantics and complexity of abduction from default theories},
  booktitle = 	 {Proc. of the $14^{th}$ International Joint Conference
		  on Artificial Intelligence (IJCAI'95)},
  year = 	 {1995},
  address = 	 {Montreal},
  pages = 	 {870--876}
}

@InProceedings{Elliott2006,
  author    = {P. Elliott and B.C. Williams},
  title     = {{DNNF}-based Belief State Estimation},
  booktitle = {Proc. of AAAI'06},
  year      = {2006},
  pages     = {36-41},
}

@Book{Enderton1972,
  title     = {A mathematical introduction to logic},
  publisher = {Academic Press},
  year      = {1972},
  author    = {H.B. Enderton},
  address   = {New York},
}

@Book{Enderton1972a,
  title     = {A mathematical introduction to logic},
  publisher = {Academic Press},
  year      = {1972},
  author    = {H.B. Enderton},
  address   = {New York},
}

@Book{Enderton72,
  author = 	 {H.B. Enderton},
  title = 	 {A mathematical introduction to logic},
  publisher = 	 {Academic Press},
  year = 	 {1972},
  address = 	 {New York}
}

@InProceedings{Eshghi93,
  author = 	 {K. Eshghi},
  title = 	 {A tractable class of abduction problems},
  booktitle = 	 {Proc. of the $13^{th}$ International Joint Conference on Artificial Intelligence (IJCAI'93)},
  year = 	 {1993},
  address = 	 {Chamb\'ery},
  pages = 	 {3--8}
}

@book{crama2011boolean,
  title={Boolean functions: Theory, algorithms, and applications},
  author={Crama, Yves and Hammer, Peter L},
  year={2011},
  publisher={Cambridge University Press}
}

@InProceedings{EnumeringPI,
author="Jabbour, Said
and Marques-Silva, Joao
and Sais, Lakhdar
and Salhi, Yakoub",
title="Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form",
booktitle="Logics in Artificial Intelligence",
year="2014",
}


@InProceedings{Etherington87,
  author = 	 {D.V. Etherington},
  title = 	 {Relating default logic and circumscription},
  booktitle = 	 {Proc. of the $10^{th}$ International Joint Conference on Artificial Intelligence (IJCAI'87)},
  year = 	 {1987},
  address = 	 {Milano},
  pages = 	 {489--494}
}

@Article{Even1976,
  author =       {S. Even and A. Itai and A. Shamir},
  title =        {On the Complexity of Timetable and Integral Multi-Commodity Flow Problems},
  journal =      {SIAM J. on Comp},
  year =         1976,
  volume =       5,
  number =       4,
  pages =        {691--703}
}

@Article{Even1976a,
  author  = {S. Even and A. Itai and A. Shamir},
  title   = {On the complexity of timetable and multicommodity flow problems},
  journal = {SIAM Journal of Computing},
  year    = {1976},
  volume  = {5},
  number  = {4},
  pages   = {691--700},
}

@Article{Even1976b,
  author  = {S. Even and A. Itai and A. Shamir},
  title   = {On the Complexity of Timetable and Integral Multi-Commodity Flow Problems},
  journal = {SIAM J. on Comp},
  year    = {1976},
  volume  = {5},
  number  = {4},
  pages   = {691--703},
}

@Article{Even1976c,
  author  = {S. Even and A. Itai and A. Shamir},
  title   = {On the complexity of timetable and multicommodity flow problems},
  journal = {SIAM Journal of Computing},
  year    = {1976},
  volume  = {5},
  number  = {4},
  pages   = {691--700},
}

@Article{Evenetal76,
  author = 	 {S. Even and A. Itai and A. Shamir},
  title = 	 {On the complexity of timetable and multicommodity
		  flow problems},
  journal = 	 {SIAM Journal of Computing},
  year = 	 {1976},
  volume = 	 {5},
  number = 	 {4},
  pages = 	 {691--700}
}

@Article{Fagin77,
  author = 	 {R. Fagin},
  title = 	 {Functional dependencies in a relational database and propositional logic},
  journal = 	 {IBM Journal of Research and Development},
  year = 	 {1977},
  volume = 	 {21},
  pages = 	 {534--544}
}

@Article{Fahlman74,
  author = 	 {S.E. Fahlman},
  title = 	 {A planning system for robot 
construction tasks},
  journal = 	 {Artificial Intelligence},
  year = 	 {1974},
  volume = 	 {5},
  pages = 	 {1-49}
}

@InProceedings{Fargier2000,
  author    = {H. Fargier and J. Lang and P. Marquis},
  title     = {Propositional Logic and One-stage Decision Making},
  booktitle = {Proc. of KR'00},
  year      = {2000},
  pages     = {445--456},
}

@inproceedings{FargierMarquis06,
  author    = {H. Fargier and P. Marquis},
  title     = {On the Use of Partially Ordered Decision Graphs in Knowledge
               Compilation and Quantified {B}oolean Formulae},
  booktitle = {Proc. of AAAI'06},
  year      = {2006},
  pages = {42--47},
  OPTcrossref  = {DBLP:conf/aaai/2006},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de},
}

@InProceedings{FargierMarquis07,
  author =       {H. Fargier and P.Marquis},
  title =        {On Valued Negation Normal Form Formulas},
  booktitle =    {Proc. of IJCAI'07},
  year =         {2007},
  pages =        {360-365},
  note = {(poster)}
}

@inproceedings{FargierMarquis08a,
  author    = {H. Fargier and P. Marquis},
  title     = {Extending the Knowledge Compilation Map: {K}rom, {H}orn, Affine and Beyond},
  booktitle = {Proc. of AAAI'08},
  year      = {2008},
  pages = {442--447}
}

@inproceedings{FargierMarquis08b,
  author    = {H. Fargier and P. Marquis},
  title     = {Extending the Knowledge Compilation Map: Closure Principles},
  booktitle = {Proc. of ECAI'08},
  year      = {2008},
  pages = {50-54}
}

@inproceedings{FargierMarquis09,
  author    = {H. Fargier and P. Marquis},
  title     = {Knowledge Compilation Properties of Trees-of-BDDs, Revisited},
  booktitle = {Proc. of IJCAI'09},
  year      = {2009},
  pages     = {772-777},
  OPTee        = {http://ijcai.org/papers09/Papers/IJCAI09-133.pdf},
  OPTcrossref  = {DBLP:conf/ijcai/2009},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@Article{FargierMarquis14,
  author       = {H. Fargier and P. Marquis},
  title        = {Disjunctive closures for knowledge compilation},
  journal      = {Artificial Intelligence},
  year         = {2014},
  volume       = {216},
  pages        = {129--162},
}

@Article{FargierVilarem04,
author = "H. Fargier and M.-C. Vilarem",
title = "Compiling {CSP}s into tree-driven automata for interactive solving",
journal = "Constraints",
volume = "9",
pages = "263--287",
year = "2004"
}

@inproceedings{Fargieretal13a,
  author    = {H. Fargier and
               P. Marquis and
               A. Niveau},
  title     = {Towards a Knowledge Compilation Map for Heterogeneous Representation
               Languages},
  booktitle = {Proc. of IJCAI'13},
  year      = {2013},
  pages = {877-883},
  OPTcrossref  = {DBLP:conf/ijcai/2013},
  OPTurl       = {http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6969},
  OPTtimestamp = {Wed, 24 Sep 2014 11:47:02 +0200},
  OPTbiburl    = {http://dblp.uni-trier.de/rec/bib/conf/ijcai/FargierMN13},
  OPTbibsource = {dblp computer science bibliography, http://dblp.org}
}

@inproceedings{Fargieretal13b,
  author    = {H. Fargier and
               P. Marquis and
               N. Schmidt},
  title     = {Semiring Labelled Decision Diagrams, Revisited: Canonicity and Spatial
               Efficiency Issues},
  booktitle = {Proc. of IJCAI'13},
  year      = {2013},
  pages = {884-890},
  OPTcrossref  = {DBLP:conf/ijcai/2013},
  OPTurl       = {http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6623},
  OPTtimestamp = {Wed, 24 Sep 2014 13:51:19 +0200},
  OPTbiburl    = {http://dblp.uni-trier.de/rec/bib/conf/ijcai/FargierMS13},
  OPTbibsource = {dblp computer science bibliography, http://dblp.org}
}

@inproceedings{Fargieretal14,
  author    = {H. Fargier and
               P. Marquis and
               A. Niveau and
               N. Schmidt},
  title     = {A Knowledge Compilation Map for Ordered Real-Valued Decision Diagrams},
  booktitle = {Proc. of AAAI'14},
  year      = {2014},
  pages     = {1049--1055},
  OPTcrossref  = {DBLP:conf/aaai/2014},
  OPTurl       = {http://www.aaai.org/ocs/index.php/AAAI/AAAI14/paper/view/8195},
  OPTtimestamp = {Wed, 24 Sep 2014 11:43:45 +0200},
  OPTbiburl    = {http://dblp.uni-trier.de/rec/bib/conf/aaai/FargierMNS14},
  OPTbibsource = {dblp computer science bibliography, http://dblp.org}
}

@inproceedings{Fargieretal15,
  author    = {H. Fargier and
               F. Maris and
               V. Roger},
  title     = {Temporal Constraint Satisfaction Problems and Difference Decision
               Diagrams: {A} Compilation Map},
  booktitle = {27th {IEEE} International Conference on Tools with Artificial Intelligence,
               {ICTAI} 2015, Vietri sul Mare, Italy, November 9-11, 2015},
  pages     = {429--436},
  year      = {2015},
}

@InProceedings{Fargieretal96,
  author = 	 {H. Fargier and J. Lang and Th. Schiex},
  title = 	 {Mixed constraint satisfaction: a framework for
		  decision making under incomplete knowledge},
  booktitle = 	 {Proc. of AAAI'96},
  year = 	 {1996},
  address = 	 {Portland (OR)},
  pages = 	 {175--180}
}

@InProceedings{Feldmann2000,
  author    = {R. Feldmann and B. Monien and S. Schamberger},
  title     = {A distributed algorithm to evaluate quantified boolean formula},
  booktitle = aaai00,
  year      = {2000},
  pages     = {285-290},
}

@Misc{Feldmann2000a,
  author = {R. Feldmann and B. Monien and S. Schamberger},
  title  = {{\sc Qsolve}},
  year   = {2000},
  note   = {\\http://www.upb.de/fachbereich/AG/monien/PERSONAL/SCHAUM/ QSAT.html},
}

@InProceedings{Feldmann2004,
  author    = {R. Feldmann and B. Monien and S. Schamberger},
  title     = {A Distributed Algorithm to Evaluate Quantified Boolean Formulas},
  booktitle = aaai00,
  year      = {2004},
  pages     = {285--290},
}

@incollection{Felfernigetal11,
  author    = {A. Felfernig and
               G. Friedrich and
               D. Jannach and
               M. Zanker},
  title     = {Developing Constraint-based Recommenders},
  booktitle = {Recommender Systems Handbook},
  year      = {2011},
  pages     = {187-215},
  OPTee        = {http://dx.doi.org/10.1007/978-0-387-85820-3_6},
  OPTcrossref  = {DBLP:reference/rsh/2011},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@PhdThesis{Finger1977,
  author  = {J.J. Finger},
  title   = {Exploiting constraints in design synthesis},
  school  = {Stanford University},
  year    = {1977},
  address = {Stanford},
}

@PhdThesis{Finger1977a,
  author  = {J.J. Finger},
  title   = {Exploiting constraints in design synthesis},
  school  = {Stanford University},
  year    = {1977},
  address = {Stanford},
}

@PhdThesis{Finger77,
  author = 	 {J.J. Finger},
  title = 	 {Exploiting constraints in design synthesis},
  school = 	 {Stanford University},
  year = 	 {1977},
  address = 	 {Stanford}
}

@article{Finketal12,
  author    = {R. Fink and
               L. Han and
               D. Olteanu},
  title     = {Aggregation in Probabilistic Databases via Knowledge Compilation},
  journal   = {{PVLDB}},
  year      = {2012},
  volume    = {5},
  number    = {5},
  pages     = {490--501},
  OPTurl       = {http://vldb.org/pvldb/vol5/p490_robertfink_vldb2012.pdf},
  OPTtimestamp = {Wed, 24 Sep 2014 14:51:46 +0200},
  OPTbiburl    = {http://dblp.uni-trier.de/rec/bib/journals/pvldb/FinkHO12},
  OPTbibsource = {dblp computer science bibliography, http://dblp.org}
}

@InProceedings{Forbus89,
 author = {K. Forbus},
 title = {Introducing actions into qualitative simulation},
 booktitle = {Proc. of the $11^{th}$ International Joint Conference on
 Artificial Intelligence (IJCAI'89)},
 year = {1989},
 address = {Detroit (MI)},
 pages = {1273--1278}
}

@InProceedings{ForgetSiegel96,
  author = 	 {P. Siegel and L. Forget},
  title = 	 {A representation theorem for preferential logics},
  booktitle = 	 {Proc. of the $5^{th}$ International Conference on
		  Principles of Knowledge Representation and Reasoning
		  (KR'96)},
  year = 	 {1996},
  address = 	 {Cambridge (MA)}
}

@InProceedings{Fortune1978,
  author       = {S. Fortune and J. E. Hopcroft and E. Meineche Schmidt},
  title        = {The Complexity of Equivalence and Containment for Free Single Variable Program Schemes},
  booktitle    = {Proc. of ICALP'78},
  year         = {1978},
  pages        = {227-240},
  optbibsource = {DBLP, http://dblp.uni-trier.de},
  optcrossref  = {DBLP:conf/icalp/1978},
  optee        = {http://dx.doi.org/10.1007/3-540-08860-1_17},
}

@inproceedings{Fortuneetal78,
  author    = {S. Fortune and
               J. E. Hopcroft and
               E. Meineche Schmidt},
  title     = {The Complexity of Equivalence and Containment for Free Single
               Variable Program Schemes},
  booktitle = {Proc. of ICALP'78},
  year      = {1978},
  pages     = {227-240},
  OPTee        = {http://dx.doi.org/10.1007/3-540-08860-1_17},
  OPTcrossref  = {DBLP:conf/icalp/1978},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@Article{Franco1998,
  author =   {J. Franco and A. Van Gelder},
  title =    {A perspective on certain polynomial time solvable classes of Satisfiability},
  journal =      {Discrete Applied Mathematics},
  month =    {August 7},
  year =     1998
}

@PhdThesis{Freemann1995,
  author =   {J. W. Freemann},
  title =    {{Improvement to Propositional Satisfiability Search Algorithms}},
  school =   {University of Pennsylvania},
  year =     1995
}

@InProceedings{Fridshal1957,
  author    = {R. Fridshal},
  title     = {The Quine algorithm},
  booktitle = {Summaries of talks at the summer institute of symbolic logic},
  year      = {1957},
  pages     = {211},
  address   = {Cornell University},
}

@InProceedings{Fridshal1957a,
  author    = {R. Fridshal},
  title     = {The Quine algorithm},
  booktitle = {Summaries of talks at the summer institute of symbolic logic},
  year      = {1957},
  pages     = {211},
  address   = {Cornell University},
}

@InProceedings{Fridshal57,
  author = 	 {R. Fridshal},
  title = 	 {The Quine algorithm},
  booktitle = 	 {Summaries of talks at the summer institute of
		  symbolic logic},
  year =         {1957},
  address = 	 {Cornell University},
  pages = 	 {211}
}
      
@Article{FriedmanSupowit90,
  author = 	 {S.J. Friedman and K.J. Supowit},
  title = 	 {Finding the optimal variable ordering for binary
		  decision diagrams},
  journal = 	 {IEEE Transactions on Computers},
  year = 	 {1990},
  volume = 	 {C-39},
  pages = 	 {710--713}
}

@InProceedings{FurbachObermaier07,
  author       = {Ulrich Furbach and Claudia Obermaier},
  title        = {Knowledge Compilation for Description Logics},
  booktitle    = {Proc. of KESE'07},
  year         = {2007},
  optbibsource = {DBLP, http://dblp.uni-trier.de},
  optcrossref  = {DBLP:conf/ki/2007bmi},
  optee        = {http://ceur-ws.org/Vol-282/03-furbach_obermaier_edit.pdf},
}

@InProceedings{Gallo1988,
  author =   {G. Gallo and M. G. Scutella},
  title =    {Polynomially solvable satisfiability problems},
  booktitle =    {Information Processing Letters},
  pages =    {221--227},
  year =     1988,
  volume =   29
}

@Book{Garey1979,
  title     = {Computers and intractability: a guide to the theory of $NP$-completeness},
  publisher = {Freeman},
  year      = {1979},
  author    = {M.R. Garey and D.S. Johnson},
}

@Book{Garey1979a,
  title     = {Computers and intractability: a guide to the theory of $NP$-completeness},
  publisher = {Freeman},
  year      = {1979},
  author    = {M.R. Garey and D.S. Johnson},
}

@Book{GareyJohnson79,
  author = 	 {M.R. Garey and D.S. Johnson},
  title = 	 {Computers and intractability: a guide to the theory
		  of {NP}-completeness},
  publisher = 	 {Freeman},
  year = 	 {1979}
}

@inproceedings{GaspersSzeider12,
  author    = {S. Gaspers and
               S. Szeider},
  title     = {Backdoors to Satisfaction},
  booktitle = {The Multivariate Algorithmic Revolution and Beyond},
  year      = {2012},
  pages     = {287-317},
  OPTee        = {http://dx.doi.org/10.1007/978-3-642-30891-8_15},
  OPTcrossref  = {DBLP:conf/birthday/2012fellows},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{Gebseretal09,
  author    = {M. Gebser and
               B. Kaufmann and
               T. Schaub},
  title     = {Solution Enumeration for Projected {B}oolean Search Problems},
  booktitle = {Proc. of CP-AI-OR'09},
  year      = {2009},
  pages     = {71-86},
  OPTee        = {http://dx.doi.org/10.1007/978-3-642-01929-6_7},
  OPTcrossref  = {DBLP:conf/cpaior/2009},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{Geffner04,
  author    = {H. Geffner},
  title     = {Planning Graphs and Knowledge Compilation},
  booktitle = {Proc. of KR'04},
  year      = {2004},
  pages     = {662-672}
}

@InProceedings{Geffner97,
  author = 	 {H. Geffner},
  title = 	 {Causality, constraints and the
indirect effects of actions},
  booktitle = 	 {Proc. of AAAI'97},
  year = 	 {1997},
  pages = 	 {550-560}
}

@Article{GelfondPrzymusinska86,
  author = 	 {M. Gelfond and H. Przymusinska},
  title = 	 {Negation as failure: careful closure procedure},
  journal = 	 {Artificial Intelligence},
  year = 	 {1986},
  volume = 	 {30},
  pages = 	 {273--287}
}

@InProceedings{Gelfondetal86,
  author = 	 {M. Gelfond and H. Przymusinska and T. Przymusinski},
  title = 	 {The extended closed world assumption and its relationship to parallel circumscription},
  booktitle = 	 {Proc. of ACM SIGACT-SIGMOD Symposium on Principles of Database Systems (PODS'86)},
  year = 	 {1986},
  pages = 	 {133--139}
}

@Article{Gelfondetal89,
  author = 	 {M. Gelfond and H. Przymusinska and T. Przymusinski},
  title = 	 {On the relationship between circumscription and negation as failure},
  journal = 	 {Artificial Intelligence},
  year = 	 {1989},
  volume = 	 {38},
  pages = 	 {49--73}
}
    
@InProceedings{Genisson1995,
  author =   {R. G\'enisson and A. Rauzy},
  title =    {Sur les relations algorithmiques entre classes polynomiales du probl\`eme {SAT} et des probl\`emes de satisfaction de contraites},
  booktitle =    {5\`eme Journ\'ees du PRC Intellignce Artificielle},
  pages =    {97--107},
  year =     1995,
  editor =   {Teknea},
  address =      {Nancy}
}             

@inproceedings{Wldchen2022EA,
  title={Towards explainable artificial intelligence: interpreting neural network classifiers with probabilistic prime implicants},
  author={Stephan W{\"a}ldchen},
  year={2022},
  url={https://api.semanticscholar.org/CorpusID:252623922}
}

@article{IzzaIJAR,
  title={On Computing Probabilistic Abductive Explanations},
  author={Yacine Izza and Xuanxiang Huang and Alexey Ignatiev and Nina Narodytska and Martin C. Cooper and Joao Marques-Silva},
  journal={Int. J. Approx. Reason.},
  year={2022},
  volume={159},
  pages={108939},
  url={https://api.semanticscholar.org/CorpusID:254564000}
}

@Article{Genisson1999,
  author =   {R. G\'enisson and A. Rauzy},
  title =    {O˘ la polynomialit\'e n'est qu'\'enum\'erative},
  journal =      {Revue d'Intelligence Artificielle},
  year =     1999,
  volume =   13,
  number =   2,
  pages =    {355--388},
  url =          {http://iml.univ-mrs.fr/~arauzy/publis/GR99.ps.zip}
}

@InProceedings{Gent1999,
  author    = {I. P. Gent},
  title     = {Beyond {NP}: the {QSAT} phase transition},
  booktitle = {Proc. of the Sixteenth National Conference on Artificial Intelligence},
  year      = {1999},
  pages     = {648--653},
  address   = {Orlando, Florida},
  url       = {http://www.cs.strath.ac.uk/\~{}apes/papers/gwaaai99.ps.gz},
}

@InProceedings{Gent2002,
  author   = {I. P. Gent and A. G. D. Rowley},
  title    = {{Solving 2-CNF Quantified Boolean Formulae using Variable Assignment and Propagation}},
  year     = {2002},
  pages    = {17-25},
  crossref = {Narizzano2002a},
  url      = {citeseer.nj.nec.com/gent02solving.html},
}

@InProceedings{Gent2002b,
  author    = {I. P. Gent and T. Walsh},
  title     = {Beyond {NP}: the {QSAT} phase transition},
  booktitle = {Proc. of the Second International Workshop on Quantified Boolean Formulas},
  year      = {2002},
  url       = {http://www.qbflib.org/02-qbfGenRow.ps.gz},
}

@TechReport{Gent2003a,
  author =   {I. P. Gent and A. Rowley},
  title =    {{Encoding Connect-4 using Quantified Boolean Formulae}},
  institution =  {APES Research Group},
  year =     2003,
  number =   {APES-68-2003},
  month =    {July},
  note =     {\\http://www.dcs.st-and.ac.uk/\~{}apes/apesreports.html},
  url=           {http://www.dcs.st-and.ac.uk/~apes/reports/apes-68-2003.ps}
}

@TechReport{Gent2003b,
  author =   {I. P. Gent and H. H. Hoos and A. G. D. Rowley and K. Smyth},
  title =    {{Using Stochastic Local Search to Solve Quantified Boolean Formulae}},
  institution =  {APES Research Group},
  year =     2003,
  number =   {APES-58-2003},
  month =    {January},
  note =     {\\http://www.dcs.st-and.ac.uk/\~{}apes/apesreports.html},
  url =          {http://www.dcs.st-and.ac.uk/~apes/reports/apes-58-2003.ps}
}

@InProceedings{Gent2003e,
  author   = {I. P. Gent and M. Narizzano and A. G. D. Rowley and A. Tacchella},
  title    = {{Watched Data Structures for QBF Solvers}},
  pages    = {25-36},
  crossref = {Giunchiglia2003b},
}

@TechReport{Gent2004,
  author      = {I. P. Gent and P. Nightingale and A. G. D. Rowley},
  title       = {{Encoding Quantified CSPs as Quantified Boolean Formulae}},
  institution = {APES Research Group},
  year        = {2004},
  number      = {APES-79-2004},
  month       = {Febrary},
}

@TechReport{Gent2004b,
  author =   {I. P. Gent and A. Rowley},
  title =    {Solution Learning and Solution Directed Backjumping Revisited},
  institution =  {APES Research Group},
  year =     2004,
  number =   {APES-80-2004},
  month =    {Febrary}
}

@Article{GergovMeinel94,
  author =       {J. Gergov and C. Meinel},
  title =        {Efficient analysis and manipulation of {OBDDs} can be extended to {FBDDs}},
  journal =      {IEEE Transactions on Computers},
  year =         {1994},
  volume =       {43},
  number =       {10},
  pages =        {1197--1209}
}

@article{Ghallab1991,
 author = {M. Ghallab and G. Escalada-Imaz},
 title = {A linear control algorithm for a class of rule-based systems},
 journal = {Journal of Logic Programming},
 volume = 11,
 number = 2,
 year = 1991,
 issn = {0743-1066},
 pages = {117--132},
 doi = {http://dx.doi.org/10.1016/0743-1066(91)90015-H},
 publisher = {Elsevier Science Inc.},
}

@TechReport{GhasemZadeh2004,
  author      = {M. GhasemZadeh and V. Klotz and C. Meinel},
  title       = {ZQSAT: a QSAT Solver based on Zero-Suppressed Binary Decision Diagrams},
  institution = {FB-IV Informatik, University of Trier},
  year        = {2004},
  address     = {Trier (Germany)},
}

@book {GhilardiZawadowski02,
    AUTHOR = {S. Ghilardi and M. Zawadowski},
     TITLE = {Sheaves, games, and model completions},
    SERIES = {Trends in Logic---Studia Logica Library},
    VOLUME = {14},
      NOTE = {A categorical approach to nonclassical propositional logics},
 PUBLISHER = {Kluwer Academic Publishers},
   ADDRESS = {Dordrecht},
      YEAR = {2002},
     OPTPAGES = {x+243},
      OPTISBN = {1-4020-0660-8},
   OPTMRCLASS = {03-02 (03B45 03B55 03G30 06-02 06D20 06E25)},
  OPTMRNUMBER = {MR2041391 (2005a:03002)},
OPTMRREVIEWER = {Leo Esakia},
}

@Article{Ginsberg89,
  author = 	 {M. Ginsberg},
  title = 	 {A circumscriptive theorem prover},
  journal = 	 {Artificial Intelligence},
  year = 	 {1989},
  volume = 	 {39},
  pages = 	 {109--230}
}

@InProceedings{Ginsbergetal98,
  author = 	 {M.L. Ginsberg and A.J. Parkes and A. Roy},
  title = 	 {Supermodels and robustness},
  booktitle = 	 {Proc. of AAAI'98},
  year = 	 {1998},
  address = 	 {Madison (WI)},
  pages = 	 {334--339}
}

@InProceedings{Giunchiglia2001,
  author    = {E. Giunchiglia and M. Narizzano and A. Tacchella},
  title     = {On the effectiveness of backjumping and trivial truth in quantified boolean formulas satisfiability},
  booktitle = {Proc. of the First International Workshop on Quantified Boolean Formulas},
  year      = {2001},
  pages     = {40--54},
  crossref  = {Egly2001f},
  url       = {http://www.upb.de/cs/obelix/qbf2001.tar.gz},
}

@InProceedings{Giunchiglia2001a,
  author =   {E. Giunchiglia and M. Narizzano and A. Tacchella},
  title =    {Backjumping for Quantified Boolean Logic Satisfiability},
  booktitle =    ijcai01,
  year =         {2001},
  pages = {275--281},
  url =          {http://www.mrg.dist.unige.it/\~{}enrico/ftp/01ijcai.ps.gz}
}

@InProceedings{Giunchiglia2001b,
  author    = {E. Giunchiglia and M. Narizzano and A. Tacchella},
  title     = {{QuBE: A system for deciding Quantified Boolean Formulas Satisfiability}},
  booktitle = ijcar01,
  year      = {2001},
  pages     = {364-369},
  url       = {http://www.mrg.dist.unige.it/\~{}enrico/ftp/01ijcar-qube.ps.gz},
}

@InProceedings{Giunchiglia2001c,
  author =   {E. Giunchiglia and M. Narizzano and A. Tacchella},
  title =    {An analysis of backjumping and trivial truth in quantified boolean formulas satisfiability},
  bookTitle =    {7 Congresso dell'Associazione Italiana per l'Intelligenza Artificiale},
  OPTcrossref =     {AIIA01},
  month =        {September 25-28},
  year =         {2001},
  address =      {Bari, Italy},
  url =          {http://www.qbflib.org/01-aiiaGiuNarTac.ps.gz}
}

@InProceedings{Giunchiglia2002,
  author    = {E. Giunchiglia and M. Narizzano and A. Tacchella},
  title     = {Learning for quantified boolean logic satisfiability},
  booktitle = aaai02,
  year      = {2002},
  url       = {http://www.qbflib.org/02-aaaiGiuNarTac.ps.gz},
}
     
@InProceedings{Giunchiglia2002a,
  author    = {E. Giunchiglia and M. Narizzano and A. Tacchella},
  title     = {Assessing the Impact of Learning Techniques in Quantified Boolean Logic},
  booktitle = {Proc. of the Second International Workshop on Quantified Boolean Formulas},
  year      = {2002},
  crossref  = {Narizzano2002a},
  url       = {http://gauss.ececs.uc.edu/Conferences/SAT2002/Abstracts/QBF/giunchiglia.ps},
}    

@Article{Giunchiglia2003,
  author =   {E. Giunchiglia and M. Narizzano and A. Tacchella},
  title =    {Backjumping for Quantified Boolean Logic Satisfiability},
  journal =      {Artificial Intelligence},
  year =     2003,
  volume =   145,
  number =   {1--2},
  pages =    {99--120},
  month =    {April}
}


@Proceedings{Giunchiglia2003b,
  title     = {Proc. of QBF'03 workshop at SAT'03},
  year      = {2003},
  editor    = {Enrico Giunchiglia and Armando Tacchella},
  series    = {Lecture Notes in Artificial Intelligence},
  address   = {S. Margherita, Portofino, Italy},
  publisher = {Springer},
  month     = {May 5-8},
  booktitle = {Proc. of QBF'03 workshop at SAT'03},
  url       = {http://www.mrg.dist.unige.it/events/sat03},
}

@InProceedings{Giunchiglia2004,
  author   = {E. Giunchiglia and M. Narizzano and A. Tacchella},
  title    = {Monotone Literals and Learning in QBF reasoning},
  pages    = {??},
  crossref = {Wallace2004},
}

@InProceedings{Giunchiglia2004c,
  author   = {E. Giunchiglia and M. Narizzano and A. Tacchella},
  title    = {{QBF Reasoning on Real-World Instances}},
  pages    = {247--254},
  crossref = {Giunchiglia2004e},
}

@Proceedings{Giunchiglia2004d,
  title     = {Proc. of SAT'04},
  year      = {2004},
  editor    = {Enrico Giunchiglia and Armando Tacchella},
  series    = {Lecture Notes in Artificial Intelligence},
  address   = {Vancouver, BC, Canada},
  publisher = {Springer},
  month     = {May 10-13},
  booktitle = {Proc. of SAT'04},
  url       = {http://www.satisfiability.org/SAT04},
}

@Proceedings{Giunchiglia2004e,
  title     = {Proc. of QBF'04 workshop at SAT'04},
  year      = {2004},
  editor    = {Enrico Giunchiglia and Armando Tacchella},
  series    = {Lecture Notes in Artificial Intelligence},
  address   = {Vancouver, BC, Canada},
  publisher = {Springer},
  month     = {May 10-13},
  booktitle = {Proc. of QBF'04 workshop at SAT'04},
  url       = {http://www.satisfiability.org/SAT04},
}

@inproceedings{GiunchigliaLifschitz98,
  author    = {E. Giunchiglia and
               V. Lifschitz},
  title     = {An Action Language Based on Causal Explanation: Preliminary
               Report},
  booktitle = {Proc. of AAAI'98},
  year      = {1998},
  pages     = {623-630},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de},
}

@inproceedings{Giunchigliaetal02,
  author    = {E. Giunchiglia and
               M. Maratea and
               A. Tacchella},
  title     = {Dependent and Independent Variables in Propositional Satisfiability},
  booktitle = {Proc. of JELIA'02},
  year      = {2002},
  pages     = {296-307},
  OPTee        = {http://link.springer.de/link/service/series/0558/bibs/2424/24240296.htm},
  OPTcrossref  = {DBLP:conf/jelia/2002},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de},
}

@inproceedings{GoasdoueRousset02,
  author    = {F. Goasdou\'e and M.-C. Rousset},
  title     = {Compilation and Approximation of Conjunctive Queries by Concept Descriptions},
  booktitle = {Proc. of ECAI'02},
  year      = {2002},
  pages = {267-271}
}

@InProceedings{Gogicetal95,
  author = 	 {G. Gogic and H.A. Kautz and Ch.H. Papadimitriou and
		  B. Selman},
  title = 	 {The comparative linguistics of knowledge representation},
  booktitle = 	 {Proc. of the $14^{th}$ International Joint
		  Conference on Artificial Intelligence (IJCAI'95)},
  year = 	 {1995},
  address = 	 {Montreal},
  pages = 	 {862--869}
}

@inproceedings{Gomesetal07,
  author    = {C.~P. Gomes and
               J. Hoffmann and
               A. Sabharwal and
               B. Selman},
  title     = {From Sampling to Model Counting},
  booktitle = {Proc. of IJCAI'07},
  year      = {2007},
  pages     = {2293-2299},
}

@Proceedings{Gottfried2007,
  title     = {Proceedings of the Workshop on Behaviour Monitoring and Interpretation BMI 2007, Osnabr{\"u}ck, Germany, September 10, 2007},
  year      = {2007},
  editor    = {Bj{\"o}rn Gottfried},
  volume    = {296},
  series    = {CEUR Workshop Proceedings},
  publisher = {CEUR-WS.org},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  booktitle = {BMI},
}

@Article{Gottlob92,
  author = 	 {G. Gottlob},
  title = 	 {Complexity results for nonmonotonic logics},
  journal = 	 {Journal of Logic and Computation},
  year = 	 {1992},
  volume = 	 {2},
  pages = 	 {397--425}
}

@inproceedings{Gregoireetal04,
  author    = {{\'E}. Gr{\'e}goire and
               R. Ostrowski and
               B. Mazure and
               L. Sais},
  title     = {Automatic Extraction of Functional Dependencies},
  booktitle = {Proc. of SAT'04 (Selected Papers)},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {3542},
  year      = {2005},
  pages     = {122-132},
  OPTee        = {http://dx.doi.org/10.1007/11527695_10},
  OPTcrossref  = {DBLP:conf/sat/2004lncs},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de},
}

@inproceedings{Grumbergetal04,
  author    = {O. Grumberg and
               A. Schuster and
               A. Yadgar},
  title     = {Memory Efficient All-Solutions {SAT} Solver and Its Application
               for Reachability Analysis},
  booktitle = {Proc. of FMCAD'04},
  year      = {2004},
  pages     = {275-289},
  OPTee        = {http://dx.doi.org/10.1007/978-3-540-30494-4_20},
  OPTcrossref  = {DBLP:conf/fmcad/2004},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@Article{Gu1997,
  author =   {J. Gu and P. W. Purdom and J. Franco and B. W. Wah},
  title =    {{Algorithms for Satisfiability (SAT) Problem: A Survey}},
  journal =      {Discrete Mathematics and Theoretical Computer Science: Satisfiability (SAT) Problem},
  year =     1997,
  volume =   35,
  pages =    {19--152}
}

@inproceedings{Guptaetal00,
  author    = {A. Gupta and
               Z. Yang and
               P. Ashar and
               A. Gupta},
  title     = {{SAT}-Based Image Computation with Application in Reachability
               Analysis},
  booktitle = {Proc. of FMCAD'00},
  year      = {2000},
  pages     = {354-371},
  OPTee        = {http://dx.doi.org/10.1007/3-540-40922-X_22},
  OPTcrossref  = {DBLP:conf/fmcad/2000},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@Article{HaiJigui04,
 author = {L. Hai and S. Jigui},
 title = {Knowledge compilation using the extension rule},
 journal = {Journal of Automated Reasoning},
 year = {2004},
 volume = {32},
 pages = {93-102}
}

@InProceedings{Hastad1986,
  author    = {J. Hastad},
  title     = {Almost Optimal Lower Bounds for Small Depth Circuits},
  booktitle = {Proc. of STOC'86},
  year      = {1986},
  pages     = {6--20},
}

@inproceedings{Hastad86,
  author    = {J. Hastad},
  title     = {Improved lower bounds for small depth circuits},
  booktitle = {Proc. of STOC'86},
  year      = {1986},
  pages = {6--20}
}

@Article{Hebrard1994,
  author =   {J. J. H\'ebrard},
  title =    {{A Linear Algorithm for Renaming a Set of Clauses as a Horn Set}},
  journal =      {Theoretical Computer Science},
  pages =    {343--350},
  year =     1994,
  volume =   124,
  number =   2
}

@InProceedings{Hebrard1995,
  author =   {J. J. H\'ebrard},
  title =    {{Unique Horn Renaming an Unique 2-Satisfiability}},
  booktitle =    {Information Processing Letters},
  pages =    {235--239},
  year =     1995,
  volume =   54,
  OPTnumber =    4
}

@Proceedings{Hentenryck2002,
  title     = {Principles and Practice of Constraint Programming - CP 2002, 8th International Conference, CP 2002, Ithaca, NY, USA, September 9-13, 2002, Proc.},
  year      = {2002},
  editor    = {Pascal Van Hentenryck},
  volume    = {2470},
  series    = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn      = {3-540-44120-4},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  booktitle = {CP},
}

@inproceedings{Herzigetal01,
  author    = {A. Herzig and J. Lang and P. Marquis and Th. Polacsek},
  title     = {Updates, actions, and planning},
  booktitle = {Proc. of IJCAI'01},
  year      = {2001},
  pages = {119-124}
}

@article{Herzigetal13,
  author    = {A. Herzig and
               J. Lang and
               P. Marquis},
  title     = {Propositional Update Operators Based on Formula/Literal Dependence},
  journal   = {{ACM} Transactions on Computational Logic},
  year      = {2013},
  volume    = {14},
  number    = {3},
  pages     = {24},
  OPTurl       = {http://doi.acm.org/10.1145/2499937.2499945},
  OPTdoi       = {10.1145/2499937.2499945},
  OPTtimestamp = {Wed, 24 Sep 2014 14:01:21 +0200},
  OPTbiburl    = {http://dblp.uni-trier.de/rec/bib/journals/tocl/HerzigLM13},
  OPTbibsource = {dblp computer science bibliography, http://dblp.org}
}

@Article{Hobbsetal93,
  author = 	 {J. Hobbs and M.E. Stickel and D. Appelt and P. Martin},
  title = 	 {Interpretation as abduction},
  journal = 	 {Artificial Intelligence},
  year = 	 {1993},
  volume = 	 {63},
  pages = 	 {69--142}
}

@PhdThesis{Hoogland01,
  author = 	 {E. Hoogland},
  title = 	 {Definability and Interpolation -- Model-theoretic investigations},
  school = 	 {Institute for Logic, Language and Computation, University of Amsterdam},
  year = 	 {2001},
  OPTkey = 	 {},
  OPTtype = 	 {},
  OPTaddress = 	 {},
  OPTmonth = 	 {},
  OPTnote = 	 {},
  OPTannote = 	 {},
}

@Article{Hooker1993,
  author =   {J. N. Hooker},
  title =    {Solving the incremental satisfiability problem},
  journal =      {Journal of Logic Programming},
  year =     1993,
  volume =   15,
  pages =    {177--186}
}

@article{HoriyamaIbaraki02,
    author = {T. Horiyama and T. Ibaraki},
    title = "Ordered binary decision diagrams as knowledge-bases",
    journal = {Artificial Intelligence},
    pages = "189-213",
    volume = "136",
    year = "2002"
}

@Article{Horn1951,
  author =   {A. Horn},
  title =    {{On Sentences Which Are True of Direct Unions of Algebras}},
  journal =      {Journal of Symbolic Logic},
  year =     1951,
  volume =   16,
  pages =    {14-21}
}

@Article{Horn1951a,
  author  = {A. Horn},
  title   = {On sentences which are true of direct unions of algebras},
  journal = {Journal of Symbolic Logic},
  year    = {1951},
  volume  = {16},
  pages   = {14--21},
}

@Article{Horn1951b,
  author  = {A. Horn},
  title   = {On sentences which are true of direct unions of algebras},
  journal = {Journal of Symbolic Logic},
  year    = {1951},
  volume  = {16},
  pages   = {14--21},
}

@Article{Horn51,
  author = 	 {A. Horn},
  title = 	 {On sentences which are true of direct unions of algebras},
  journal = 	 {Journal of Symbolic Logic},
  year = 	 {1951},
  volume = 	 {16},
  pages = 	 {14--21}
}

@Article{HowardMatheson84,
  author = 	 {R.A. Howard and J.E. Matheson},
  title = 	 {Influence Diagrams},
  journal = 	 {The Principles and Applications of Decision Analysis},
  year = 	 {1984},
  volume = 	 {2},
  pages = 	 {720-761}
}

@InProceedings{HuDill93,
  author = 	 {A. J. Hu and D. L. Dill},
  title = 	 {Reducing {BDD} size by exploiting functional dependencies},
  booktitle = 	 {Proc. of $30^{th}$ ACM/IEEE Design Automation Conference},
  year = 	 {1993},
  pages = 	 {266-271}
}

@inproceedings{Huang06,
  author    = {J. Huang},
  title     = {Combining Knowledge Compilation and Search for Conformant Probabilistic
               Planning},
  booktitle = {Proc. of ICAPS'06},
  pages     = {253--262},
  year      = {2006},
}      

@inproceedings{HuangDarwiche04,
  author    = {J. Huang and
               A. Darwiche},
  title     = {Using {DPLL} for Efficient {OBDD} Construction},
  booktitle = {Theory and Applications of Satisfiability Testing, 7th International
               Conference, {SAT} 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised
               Selected Papers},
  pages     = {157--172},
  year      = {2004},
}

@inproceedings{HuangDarwiche05,
  author    = {J. Huang and
               A. Darwiche},
  title     = {On Compiling System Models for Faster and More Scalable
               Diagnosis},
  booktitle = {Proc. of AAAI'05},
  year      = {2005},
  pages     = {300-306},
  OPTee        = {http://www.aaai.org/Library/AAAI/2005/aaai05-048.php},
  OPTcrossref  = {DBLP:conf/aaai/2005},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{HuangDarwiche07,
  author    = {J. Huang and
               A. Darwiche},
  title     = {The Language of Search},
  journal   = {Journal of Artificial Intelligence Research {(JAIR)}},
  volume    = {29},
  pages     = {191--219},
  year      = {2007},
}

@Article{Hwa1974,
  author  = {H.R. Hwa},
  title   = {A method for generating prime implicants of a {B}oolean expression},
  journal = {IEEE Transactions in Computers},
  year    = {1974},
  pages   = {637--641},
}

@Article{Hwa1974a,
  author  = {H.R. Hwa},
  title   = {A method for generating prime implicants of a boolean expression},
  journal = {IEEE Transactions in Computers},
  year    = {1974},
  pages   = {637--641},
}

@Article{Hwa74,
  author = 	 {H.R. Hwa},
  title = 	 {A method for generating prime implicants of a
		  boolean expression},
  journal = 	 {IEEE Transactions in Computers},
  year = 	 {1974},
  pages = 	 {637--641}
}


@PROCEEDINGS{IJCAI01,
  KEY = {IJCAI01},
  TITLE = {Proc. of the Seventeenth International Joint Conference on Artificial Intelligence},
  BOOKTITLE = {Proc. of the Seventeenth International Joint Conference on Artificial Intelligence},
  YEAR = 2001,
  ADDRESS = {Seattle, Washington, USA},
  MONTH = {August 4th-10th},
  OPTNOTE = {to appear},
  URL = {http://www.ijcai-01.org}
}

@PROCEEDINGS{IJCAI97,
  KEY = {IJCAI97},
  TITLE = {Proc. of the Fifteenth International Joint Conference on Artificial Intelligence},
  BOOKTITLE = {Proc. of the Fifteenth International Joint Conference on Artificial Intelligence},
  YEAR = 1997,
  ADDRESS = {Nagoya, Japan},
  MONTH = {August 23--29},
  URL = {http://www.ijcai.org/past/ijcai-97}
}

@PROCEEDINGS{IJCAI99,
  KEY = {IJCAI99},
  TITLE = {Proc. of the Sixteenth International Joint Conference on Artificial Intelligence},
  BOOKTITLE = {Proc. of the Sixteenth International Joint Conference on Artificial Intelligence},
  YEAR = 1999,
  MONTH = {July 31-August 6},
  ADDRESS = {Stockholm, Sweden},
  PUBLISHER = {M. Kaufmann},
  URL = {http://www.dsv.su.se/ijcai-99}
}

@PROCEEDINGS{IJCAR01,
  KEY = {IJCAR01},
  TITLE = {Proc. of the International Joint Conference on Automated Reasoning},
  BOOKTITLE = {Proc. of the International Joint Conference on Automated Reasoning},
  YEAR = 2001,
  ADDRESS = {Siena, Italy},
  MONTH = {June 18-23},
  URL = {http://www.dii.unisi.it/\~{}ijcar}
}

@Article{Ibarakietal01,
  author = 	 {T. Ibaraki and A. Kogan and K. Makino},
  title = 	 {On functional dependencies in q-{H}orn theories},
  journal = 	 {Artificial Intelligence},
  year = 	 {2001},
  volume = 	 {131},
  number = 	 {1--2},
  pages = 	 {171--187}
}

@Article{Ibarakietal03,
  author = 	 {T. Ibaraki and A. Kogan and K. Makino},
  title = 	 {Inferring minimal functional dependencies in {H}orn and q-{H}orn theories},
  journal = 	 {Annals of Mathematics and Artificial Intelligence},
  year = 	 {2003},
  volume = 	 {38},
  pages = 	 {233-255}
}

@Article{Ibarakietal99,
  author = 	 {T. Ibaraki and A. Kogan and K. Makino},
  title = 	 {Functional dependencies in {H}orn theories},
  journal = 	 {Artificial Intelligence},
  year = 	 {1999},
  volume = 	 {108},
  number = 	 {1--2},
  pages = 	 {1--30}
}

@InProceedings{Inoue90,
 author = {K. Inoue},
 title = {An abductive procedure for the CMS/ATMS},
 booktitle = {Proc. of the ECAI'90 Workshop on Truth Maintenance Systems},
 volume = {515},
 series = {Lecture Notes in Artificial Intelligence},
 year = {1990},
 publisher = {Springer--Verlag},
 address = {Stockholm},
 pages = {34--53}
}

@InProceedings{Inoue91,
  author = 	 {K. Inoue},
  title = 	 {Consequence-finding based on ordered linear resolution},
  booktitle = 	 {Proc. of the $12^{th}$ International Joint
		  Conference on Artificial Intelligence (IJCAI'91)},
  year = 	 {1991},
  address = 	 {Sydney},
  pages = 	 {158--164}
}

@Article{Inoue92,
  author = 	 {K. Inoue},
  title = 	 {Linear resolution in consequence--finding},
  journal = 	 {Artificial Intelligence},
  year = 	 {1992},
  volume = 	 {56},
  number = 	 {2--3},
  pages = 	 {301--353}
}

@InProceedings{InoueHelft90,
 author = {K. Inoue and N. Helft},
 title = {On theorem provers for circumscription},
 booktitle = {Proc. of the $8^{th}$ Biennal Conference of the Canadian Society
†††††††††††††††† for Computational Studies of Intelligence (CSCSI'90)},
 year = {1990},
 address = {Ottawa},
 pages = {212--219}
}

@TechReport{Itai1982,
  author =       {A. Itai and J. A. Makowsky},
  title =        {On the complexity of {H}erbrand's theorem},
  institution =  {Department of Computer Science, Israel Institute of Technology},
  year =         1982,
  volume =       243,
  month =        {May}
}

@InProceedings{Jackson91,
 author = {P. Jackson},
 title = {Computing prime implicants incrementally},
 booktitle = {Proc. of the $11^{th}$ International Conference on
 Automated Deduction (CADE'92)},
 volume = {607},
 series = {Lecture Notes in Artificial Intelligence},
 year = {1992},
 publisher = {Springer--Verlag},
 address = {Saratoga Springs (NY)},
 pages = {253--267}
}

@InProceedings{JacksonPais90,
  author = 	 {P. Jackson and J. Pais},
  title = 	 {Computing prime implicants},
  booktitle = 	 {Proc. of the $10^{th}$ International Conference on
		  Automated Deduction (CADE'90)},
  volume = 	 {449},
  series = 	 {Lecture Notes in Artificial Intelligence},
  year = 	 {1990},
  publisher = {Springer--Verlag},
  address = 	 {Kaiserslautern},
  pages = 	 {543--557}
}
          
@inproceedings{JanotaS11,
     author    = {M. Janota and
                  J. Marques Silva},
     title     = {On Deciding {MUS} Membership with {QBF}},
     booktitle = {Proc. of CP'11},
     pages     = {414--428},
     year      = {2011},
   }

@inproceedings{Kohavi1995,
  title={A Study of Cross-Validation and Bootstrap for Accuracy Estimation and Model Selection},
  author={Ron Kohavi},
  booktitle={International Joint Conference on Artificial Intelligence},
  year={1995}
}

@book{FriedmanElements,
  author = {Hastie, Trevor and Tibshirani, Robert and Friedman, Jerome},
  publisher = {Springer New York Inc.},
  series = {Springer Series in Statistics},
  title = {The Elements of Statistical Learning},
  year = 2001
}

@Article{Jeroslow1990,
  author  = {R. J. Jeroslow and J. Wang},
  title   = {Solving propositional satisfiability problems},
  journal = {Annals of Mathematics and Artificial Intelligence},
  year    = {1990},
  volume  = {1},
  pages   = {167-188},
}


@inproceedings{JhaSuciu12,
  author    = {A. K. Jha and
               D. Suciu},
  title     = {On the tractability of query compilation and bounded treewidth},
  booktitle = {15th International Conference on Database Theory, {ICDT} '12, Berlin,
               Germany, March 26-29, 2012},
  pages     = {249--261},
  year      = {2012},
}

@article{JhaSuciu13,
  author    = {A.K. Jha and
               D. Suciu},
  title     = {Knowledge Compilation Meets Database Theory: Compiling Queries to
               Decision Diagrams},
  journal   = {Theory of Computing Systems},
  year      = {2013},
  volume    = {52},
  number    = {3},
  pages     = {403--440},
}

@inproceedings{Jungetal08,
  author    = {J.-C. Jung and P. Barahona and G. Katsirelos and T. Walsh},
  title     = {Two encodings of {DNNF} theories},
  booktitle = {ECAI'08 Workshop on Graphical Structures of Knowledge},
  year      = {2008},
  OPTpages     = {},
}

@article{KangPark05,
  author    = {Hyeong-Ju Kang and
               In-Cheol Park},
  title     = {{SAT}-based unbounded symbolic model checking},
  journal   = {IEEE Transactions on {CAD} of Integrated Circuits and Systems},
  volume    = {24},
  number    = {2},
  year      = {2005},
  pages     = {129-140},
  OPTee        = {http://dx.doi.org/10.1109/TCAD.2004.841068},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@Article{Karnaugh1953,
  author  = {G. Karnaugh},
  title   = {The map method for synthesis of combinational logic circuits},
  journal = {AIEE Transactions on Communications and Electronics},
  year    = {1953},
  volume  = {72},
  pages   = {593--599},
}

@Article{Karnaugh1953a,
  author  = {G. Karnaugh},
  title   = {The map method for synthesis of combinational logic circuits},
  journal = {AIEE Transactions on Communications and Electronics},
  year    = {1953},
  volume  = {72},
  pages   = {593--599},
}


@Article{Karnaugh53,
  author = 	 {G. Karnaugh},
  title = 	 {The map method for synthesis of combinational logic circuits},
  journal = 	 {AIEE Transactions on Communications and Electronics},
  year = 	 {1953},
  volume = 	 {72},
  pages = 	 {593--599}
}
   
@InBook{Karp1972,
  chapter   = {Complexity of Computer Computations},
  pages     = {85--103},
  title     = {Reducibility among combinatorial problems},
  publisher = {Plenum Press},
  year      = {1972},
  author    = {R.M. Karp},
  address   = {New York},
}

@InProceedings{Karp1980,
  author    = {R.M. Karp and R.J. Lipton},
  title     = {Some connections between non-uniform and uniform complexity classes},
  booktitle = {Proc. of STOC'80},
  year      = {1980},
  pages     = {302-309},
}

@InProceedings{Karp1980a,
  author    = {R. M. Karp and R. J. Lipton},
  title     = {Some connections between non-uniform and uniform complexity classes},
  booktitle = stoc80,
  year      = {1980},
  pages     = {302--309},
}


@InBook{Karp72,
 author = {R.M. Karp},
 title = {Reducibility among combinatorial problems},
 chapter = {Complexity of Computer Computations},
 publisher = {Plenum Press},
 year = {1972},
 address = {New York},
 pages = {85--103}
}

@InProceedings{KarpLipton,
  author =   {R. M. Karp and R. J. Lipton},
  title =    {Some connections between non-uniform and uniform complexity classes},
  booktitle =    stoc80,
  pages =    {302--309},
  year =     {1980}
}

@inproceedings{KarpLipton80,
  author    = {R.M. Karp and R.J. Lipton},
  title     = {Some connections between non-uniform and uniform complexity classes},
  booktitle = {Proc. of STOC'80},
  year      = {1980},
  pages     = {302-309}
}

@inproceedings{Karpinskietal87,
  author    = {M. Karpinski and
               H. Kleine B{\"u}ning and
               P. H. Schmitt},
  title     = {On the Computational Complexity of Quantified {H}orn Clauses},
  booktitle = {Proc. of CSL'87},
  year      = {1987},
  pages     = {129-137},
  OPTee        = {http://dx.doi.org/10.1007/3-540-50241-6_34},
  OPTcrossref  = {DBLP:conf/csl/1987},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@Article{KautzSelman91,
  author = 	 {H.A. Kautz and B. Selman},
  title = 	 {Hard problems for simple default logic},
  journal = 	 {Artificial Intelligence},
  year = 	 {1991},
  volume = 	 {49},
  pages = 	 {243--279}
}

@InProceedings{KautzSelman92,
 author = {H.A. Kautz and B. Selman},
 title = {Forming concepts for fast inference},
 booktitle = {Proc. of AAAI'92},
 year = {1992},
 address = {San Jose (CA)},
 pages = {786--793}
}

@InProceedings{KautzSelman92a,
  author = 	 {H.A. Kautz and B. Selman},
  title = 	 {Planning as satisfiability},
  booktitle = 	 {Proc. of ECAI'92},
  year = 	 {1992},
  pages = 	 {359--363}
}

@InProceedings{KautzSelman97,
  author = 	 {H. Kautz and D. McAllester and B. Selman},
  title = 	 {Exploiting variable dependency in local search (abstract)},
  booktitle = 	 {Proc. of IJCAI'97 (poster session)},
  year = 	 {1997},
  pages = 	 {57}
}

@PhdThesis{Kean92,
  author = 	 {A. Kean},
  title = 	 {A formal characterization of a domain independent
		  abductive reasoning system},
  school = 	 {University of British Columbia},
  year = 	 {1992}
}
   
@TechReport{KeanTsiknis88,
  author = 	 {A. Kean and G. Tsiknis},
  title = 	 {Clause management systems},
  institution =  {The University of British Columbia -- Department of
		  Computer Science},
  year = 	 {1988},
  type = 	 {technical report},
  number = 	 {88-21}
}

@Article{KeanTsiknis90,
  author = 	 {A. Kean and G. Tsiknis},
  title = 	 {An incremental method for generating prime implicants/implicates},
  journal = 	 {Journal of Symbolic Computation},
  year = 	 {1990},
  volume = 	 {9},
  pages = 	 {185--206}
}

@TechReport{KeanTsiknis90b,
  author = 	 {A. Kean and G. Tsiknis},
  title = 	 {Assumption based reasoning and clause management systems},
  institution =  {The University of British Columbia -- Department of
		  Computer Science},
  year = 	 {1990},
  type = 	 {technical report},
  number = 	 {90-9}
}

@Article{KeanTsiknis92,
  author = 	 {A. Kean and G. Tsiknis},
  title = 	 {Assumption-based reasoning and clause management systems},
  journal = 	 {Computational Intelligence},
  year = 	 {1992},
  volume = 	 {8},
  number = 	 {1},
  pages = 	 {1--24}
}

@Article{KeanTsiknis93,
  author = 	 {A. Kean and G. Tsiknis},
  title = 	 {Clause management systems (CMS)},
  journal = 	 {Computational Intelligence},
  year = 	 {1993},
  volume = 	 {9},
  number = 	 {1},
  pages = 	 {11--40}
}
  
@article{KeyderG09,
  author    = {E. Keyder and
               H. Geffner},
  title     = {Soft Goals Can Be Compiled Away},
  journal   = {J. Artif. Intell. Res.},
  volume    = {36},
  pages     = {547--556},
  year      = {2009},
} 

@inproceedings{DBLP:conf/kr/KisaBCD14,
  author    = {D. Kisa and
               G. Van den Broeck and
               A. Choi and
               A. Darwiche},
  title     = {Probabilistic Sentential Decision Diagrams},
  booktitle = {Principles of Knowledge Representation and Reasoning: Proceedings
               of the Fourteenth International Conference, {KR} 2014, Vienna, Austria,
               July 20-24, 2014},
  year      = {2014},
}

@inproceedings{Khurshidetal03,
  author    = {S. Khurshid and
               D. Marinov and
               I. Shlyakhter and
               D. Jackson},
  title     = {A Case for Efficient Solution Enumeration},
  booktitle = {Proc. of SAT'03},
  year      = {2003},
  pages     = {272-286},
  OPTee        = {http://dx.doi.org/10.1007/978-3-540-24605-3_21},
  OPTcrossref  = {DBLP:conf/sat/2003},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{Klebanovetal13,
  author    = {V. Klebanov and N. Manthey and Ch. J. Muise},
  title     = {SAT-Based Analysis and Quantification of Information Flow in Programs},
  booktitle = {Proc. of QUEST'13},
  pages     = {177--192},
  year      = {2013},
  }

@Book{Kleene67,
  author =	 {S.C. Kleene},
  title = 	 {Mathematical Logic},
  publisher = 	 {John Wiley},
  year = 	 {1967}
}

@Misc{Kleine-Buening1995,
  author  = {H. Kleine-B\"uning and M. Karpinski and A. Fl\"ogel},
  title   = {{QKN}},
  year    = {1995},
  optnote = {\\Ciming soon},
}

@InProceedings{Kleine-Buening2002,
  author   = {H. Kleine-B\"uning and X. Zhao},
  title    = {{Minimal Falsity for QBF with Deficiency One}},
  crossref = {Narizzano2002a},
}

@InProceedings{Kleine-Buening2004,
  author   = {H. Kleine-B\"uning},
  title    = {{Equivalence Model for Quantified Boolean Formulas}},
  crossref = {Giunchiglia2004e},
}

@Article{Kleine-Buning1995a,
  author =   {H. Kleine-B\"uning and M. Karpinski and A. Fl\"ogel},
  title =    {Resolution for quantified boolean formulas},
  journal =      {Information and Computation},
  pages =    {12--18},
  year =     1995,
  volume =   117,
  number =   1
}

@Book{Kleine-Buning1999,
  author =   {H. Kleine-B\"uning and T. Lettmann},
  ALTeditor =    {Cambridge University Press},
  title =    {Propositional Logic: Deduction and Algorithms},
  publisher =    {The Edinburgh Building},
  year =     1999,
  address =      {Shaftesbury Road, Cambridge CB2 2RU, UK}
}

@inproceedings{KleineBuningetal11,
  author    = {H. Kleine-B{\"u}ning and
               X. Zhao and
               U. Bubeck},
  title     = {Transformations into Normal Forms for Quantified Circuits},
  booktitle = {Proc. of SAT'11},
  year      = {2011},
  pages     = {245-258},
  OPTee        = {http://dx.doi.org/10.1007/978-3-642-21581-0_20},
  OPTcrossref  = {DBLP:conf/sat/2011},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@InProceedings{Knuth1990,
  author =   {D. E. Knuth},
  title =    {Nested satisfiability},
  booktitle =    {Acta Informatica},
  pages =    {1--6},
  year =     1990,
  OPTnumber =    28
}



@InProceedings{KolaitisPapadimitriou88,
  author = 	 {P.G. Kolaitis and Ch.H. Papadimitriou},
  title = 	 {Some computational aspects of circumscription},
  booktitle = 	 {Proc. of the $7^{th}$ National Conference on
		  Artificial Intelligence (AAAI'88)},
  year = 	 {1988},
  address = 	 {St Paul (MN)},
  pages = 	 {465--469}
}

@Article{KolaitisPapadimitriou90,
  author = 	 {P.G. Kolaitis and Ch.H. Papadimitriou},
  title = 	 {Some computational aspects of circumscription},
  journal = 	 {Journal of the Association for Computing Machinery},
  year = 	 {1990},
  volume = 	 {37},
  pages = 	 {1--14}
}

@InProceedings{KoniecznyPino98,
 author = {S. Konieczny and R. Pino P\'erez},
 title = {On the logic of merging},
 booktitle = {Proc. of the $6^{th}$ International Conference on
 Principles of Knowledge Representation and Reasoning
 (KR'98)},
 year = {1998},
 pages = {488--498},
 address = {Trento}
}

@Article{Konolige92,
  author = 	 {K. Konolige},
  title = 	 {Abduction versus closure in causal theories},
  journal = 	 {Artificial Intelligence},
  year = 	 {1992},
  volume = 	 {53},
  pages = 	 {255-272}
}

@InProceedings{Koricheetal13,
  author =       {F. Koriche and J.-M. Lagniez and P. Marquis and
                  S. Thomas},
  title =        {Knowledge Compilation for Model Counting: Affine Decision Trees},
  booktitle =    {Proc. of IJCAI'13},
  year =         {2013},
  pages =        {947-953}
}

@inproceedings{Koricheetal15,
  author    = {F. Koriche and
               J.-M. Lagniez and
               P. Marquis and
               S. Thomas},
  title     = {Compiling Constraint Networks into Multivalued Decomposable Decision
               Graphs},
  booktitle = {Proc. of IJCAI'15},
  pages     = {332--338},
  year      = {2015},
}

@inproceedings{Koricheetal16,
  author    = {F. Koriche and
               D. Le Berre and
               E. Lonca and
               P. Marquis},
  title     = {Fixed-Parameter Tractable Optimization Under {DNNF} Constraints},
  booktitle = {Proc. of ECAI'16},
  pages     = {1194--1202},
  year      = {2016},
}

@inproceedings{Koriche18,
  author    = {F. Koriche},
  title     = {Compiling Combinatorial Prediction Games},
  booktitle = {Proceedings of the 35th International Conference on Machine Learning,
               {ICML} 2018, Stockholmsm{\"{a}}ssan, Stockholm, Sweden, July
               10-15, 2018},
  pages     = {2761--2770},
  year      = {2018},
}

@Article{Kowalski1971,
  author  = {R. Kowalski and D. Kuhner},
  title   = {Linear resolution with selection function},
  journal = {Artificial Intelligence},
  year    = {1971},
  volume  = {2},
  pages   = {227-260},
}

@Article{Kowalski1971a,
  author  = {R. Kowalski and D. Kuhner},
  title   = {Linear resolution with selection function},
  journal = {Artificial Intelligence},
  year    = {1971},
  volume  = {2},
  pages   = {227-260},
}

@Article{KowalskiKuhner71,
  author = 	 {R. Kowalski and D. Kuhner},
  title = 	 {Linear resolution with selection function},
  journal = 	 {Artificial Intelligence},
  year = 	 {1971},
  volume = 	 {2},
  pages = 	 {227-260}
}

@Article{Krishnaprasad88,
  author = 	 {T. Krishnaprasad},
  title = 	 {On the computability of circumscription},
  journal = 	 {Information Processing Letters},
  year = 	 {1988},
  volume = 	 {27},
  pages = 	 {237--243}
}

@Article{Krom1970,
  author  = {M.R. Krom},
  title   = {The decision problem for formulas in prenex conjunctive normal form with binary disjunctions},
  journal = {Journal of Symbolic Logic},
  year    = {1970},
  volume  = {35},
  pages   = {210--216},
}

@Article{Krom1970a,
  author  = {M.R. Krom},
  title   = {The decision problem for formulas in prenex conjunctive normal form with binary disjunctions},
  journal = {Journal of Symbolic Logic},
  year    = {1970},
  volume  = {35},
  pages   = {210--216},
}

@Article{Krom70,
  author = 	 {M.R. Krom},
  title = 	 {The decision problem for formulas in prenex conjunctive normal form with binary disjunctions},
  journal = 	 {Journal of Symbolic Logic},
  year = 	 {1970},
  volume = 	 {35},
  pages = 	 {210--216}
}

@Article{Kuznetsov83,
  author = 	 {V. Kuznetsov},
  title = 	 {On the lower estimate of the length of the shortest
		  disjunctive normal forms for almost all boolean functions},
  journal = 	 {Veroiatnostnye Metody v. Kibernetiki},
  year = 	 {1983},
  volume = 	 {19},
  pages = 	 {44--47},
  note = 	 {(in russian)}
}

@InProceedings{Lafage2000,
  author    = {C. Lafage and J. Lang},
  title     = {Logical representation of preferences for group decision making},
  booktitle = {Proc. of the $7^{th}$ International Conference on Knowledge Representation and Reasoning (KR'00)},
  year      = {2000},
  pages     = {457--468},
  address   = {Breckenridge (C0)},
}

@inproceedings{LagniezB13,
     author    = {J.-M. Lagniez and
                  A. Biere},
     title     = {Factoring Out Assumptions to Speed Up {MUS} Extraction},
     booktitle = {Proc. of SAT'13},
     pages     = {276--292},
     year      = {2013},
   }

@inproceedings{LagniezMarquis14,
  author    = {J.-M. Lagniez and
               P. Marquis},
  title     = {Preprocessing for Propositional Model Counting},
  booktitle = {Proc. of AAAI'14},
  pages     = {2688--2694},
  year      = {2014},
}

@inproceedings{Lagniezetal16,
  author    = {J.-M. Lagniez and E. Lonca and
               P. Marquis},
  title     = {Improving Model Counting by Leveraging Definability},
  booktitle = {Proc. of IJCAI'16},
  pages     = {751-757},
  year      = {2016},
}

@inproceedings{Lagniezetal18,
  author    = {J.-M.Lagniez and
               P. Marquis and
               N. Szczepanski},
  title     = {{DMC:} {A} Distributed Model Counter},
  booktitle = {Proceedings of the Twenty-Seventh International Joint Conference on
               Artificial Intelligence, {IJCAI} 2018, July 13-19, 2018, Stockholm,
               Sweden.},
  pages     = {1331--1338},
  year      = {2018},
}

@inproceedings{Lahirietal03,
  author    = {S. K. Lahiri and
               R. E. Bryant and
               B. Cook},
  title     = {A Symbolic Approach to Predicate Abstraction},
  booktitle = {Proc. of CAV'03},
  year      = {2003},
  pages     = {141-153},
  OPTee        = {http://dx.doi.org/10.1007/978-3-540-45069-6_15},
  OPTcrossref  = {DBLP:conf/cav/2003},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{DT_financial,
author = {Rada, Roy and Wimmer, Hayden},
year = {2017},
month = {01},
pages = {1-15},
title = {Decision Trees and Financial Variables},
volume = {9},
journal = {International Journal of Decision Support System Technology},
doi = {10.4018/IJDSST.2017010101}
}

@article{DT_medicine,
author = {Podgorelec, Vili and Kokol, Peter and Stiglic, Bruno and Rozman, Ivan},
year = {2002},
month = {11},
pages = {445-63},
title = {Decision Trees: An Overview and Their Use in Medicine},
volume = {26},
journal = {Journal of medical systems},
doi = {10.1023/A:1016409317640}
}

 @article{LaiPedramVrudhula1996,
  author    = {Y.-T. Lai and
               M. Pedram and
               S. B. K. Vrudhula},
  title     = {Formal Verification Using Edge-Valued Binary Decision Diagrams},
  journal   = {IEEE Transactions on Computers},
  volume    = {45},
  number    = {2},
  year      = {1996},
  pages     = {247-255},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{LaiSastry1992,
  author    = {Y.-T. Lai and
               S. Sastry},
  title     = {Edge-Valued Binary Decision Diagrams for Multi-Level Hierarchical
               Verification},
  booktitle = {Proc. of DAC'92},
  year      = {1992},
  pages     = {608-613},
 OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@InProceedings{Lakemeyer95,
  author = 	 {G. Lakemeyer},
  title = 	 {A logical account of relevance},
  booktitle = 	 {Proc. of IJCAI'95},
  year = 	 {1995},
  pages = 	 {853-859}
}

@Article{Lakemeyer97,
  author = 	 {G. Lakemeyer},
  title = 	 {Relevance from an epistemic perspective},
  journal = 	 {Artificial Intelligence},
  year = 	 {1997},
  volume = 	 {97},
  pages = 	 {137--167}
}

@Article{Lang2002,
  author  = {J. Lang and P. Liberatore and P. Marquis},
  title   = {Conditional Independence in Propositional Logic},
  journal = {Artificial Intelligence},
  year    = {2002},
  volume  = {141},
  number  = {1-2},
  pages   = {79-121},
}

@InProceedings{Lang97,
  author = 	 {J. Lang},
  title = 	 {Planning to discriminate diagnoses},
  booktitle = 	 {Proc. of DX'97},
  year = 	 {1997},
  pages = 	 {135-139}
}

@InProceedings{LangLafage01,
 author = {C. Lafage and J. Lang},
 title = {Propositional distances and preference representation},
 booktitle = {Proc. of the $6^{th}$ European Conference on
Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU'01)},
 year = {2001},
 address = {Toulouse},
 pages = {48--59}
}

@Article{LangLiberatoreMarquis02,
  author = 	 {J. Lang and P. Liberatore and P. Marquis},
  title = 	 {Conditional Independence in Propositional Logic},
  journal = 	 {Artificial Intelligence},
  year = 	 {2002},
  volume = 	 {141}, number = {1-2}},
  pages = 	 {79-121}
}

@Article{LangLiberatoreMarquis03,
  author =   {J. Lang and P. Liberatore and P. Marquis},
  title =    {Propositional independence - formula-variable independence and forgetting},
  journal =      {Journal of Artificial Intelligence Research},
  year =     {2003},
  volume =   {18},
  pages =    {391--443}
}

@InProceedings{LangLinMarquis03,
  author = 	 {J. Lang and F. Lin and P. Marquis},
  title = 	 {Causal theories of action: a computational core},
  booktitle = 	 {Proc. of IJCAI'03},
  year = 	 {2003},
  pages = 	 {1073-1078}
}

@inproceedings{LangMarquis02,
  author    = {J. Lang and P. Marquis},
  title     = {Resolving Inconsistencies by Variable Forgetting},
  booktitle = {Proc. of KR'02},
  year      = {2002},
  pages = {239--250}
}


@article{LangMarquis08,
  author    = {J. Lang and
               P. Marquis},
  title     = {On propositional definability},
  journal   = {Artificial Intelligence},
  volume    = {172},
  number    = {8-9},
  pages     = {991--1017},
  year      = {2008},
}

@article{LangMarquis10,
  author    = {J. Lang and P. Marquis},
  title     = {Reasoning under inconsistency: A forgetting-based approach},
  journal   = {Artificial Intelligence},
  volume    = {174},
  number    = {12-13},
  year      = {2010},
  pages     = {799-823},
  OPTee        = {http://dx.doi.org/10.1016/j.artint.2010.04.023},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@InProceedings{LangMarquis98,
 author = {J. Lang and P. Marquis},
 title = {Complexity results for independence and definability},
 booktitle = {Proc. of the $6^{th}$ International Conference on Knowledge Representation
 and Reasoning (KR'98)},
 year = {1998},
 address = {Trento},
 note = {356--367}
}

@InProceedings{LangMarquis98b,
  author = 	 {J. Lang and P. Marquis},
  title = 	 {Two forms of dependence in propositional logic:
		  controllability and definability},
  booktitle = 	 {Proc. of AAAI'98},
  year = 	 {1998},
  address = 	 {Madison (WI)},
  pages = 	 {268--273}
}

@InProceedings{LeBerre01,
  author =	 {D. {Le Berre}},
  title =	 {Exploiting the real power of unit propagation lookahead},
  booktitle =	 {Proc. of SAT'01},
  OPTpages =	 {},
  year =	 {2001},
  OPTmonth =	 jun,
  OPTaddress =	 {Boston University, Massachusetts, USA},
  OPTeditor =	 {Henry Kautz and Bart Selman},
  volume =	 {9},
  series =	 {Electronic Notes in Discrete Mathematics},
  publisher =	 {Elsevier Science Publishers},
}

@Misc{LeBerre03,
  author =   {D. Le Berre and L. Simon and A. Tacchella},
  title =    {{QBF Evaluation 2003}},
  month =    {May},
  year =     2003,
  note =     {\\http://www.satlive.org/QBFEvaluation}
}

 @inproceedings{LeBerreetal18,
  author    = {D. Le Berre and
               P. Marquis and
             S. Mengel and
               R. Wallon},
  title     = {Pseudo-Boolean Constraints from a Knowledge Representation Perspective},
  booktitle = {Proceedings of the Twenty-Seventh International Joint Conference on
               Artificial Intelligence, {IJCAI} 2018, July 13-19, 2018, Stockholm,
               Sweden.},
  pages     = {1891--1897},
  year      = {2018},
}
  
@PhdThesis{Lee1967,
  author  = {R.C.T. Lee},
  title   = {A completeness theorem and a computer program for finding theorems derivable from given axioms},
  school  = {University of California},
  year    = {1967},
  address = {Berkeley (CA)},
}
        
@PhdThesis{Lee1967a,
  author  = {R.C.T. Lee},
  title   = {A completeness theorem and a computer program for finding theorems derivable from given axioms},
  school  = {University of California},
  year    = {1967},
  address = {Berkeley (CA)},
}
@PhdThesis{Lee67,
  author = 	 {R.C.T. Lee},
  title = 	 {A completeness theorem and a computer program for
		  finding theorems derivable from given axioms},
  school = 	 {University of California},
  year = 	 {1967},
  address = 	 {Berkeley (CA)}
}

@Article{Leeetal85,
  author = 	 {W.S. Lee and D.L. Grosh and F.A. Tillman and C.H. Lie},
  title = 	 {Fault tree analysis, methods and applications: a review},
  journal = 	 {IEEE Transactions on Reliability},
  year = 	 {1985},
  volume = 	 {34},
  pages = 	 {194--303}
}

@TechReport{Letombe2003,
  author =   {F. Letombe},
  title =    {{Algorithmique pour les Formules Bool\'eennes Quantifi\'ees}},
  institution =  {Centre de Recherche en Informatique de Lens, CNRS FRE 2499},
  year =     2003
}

@TechReport{Letombe2004a,
  author      = {F. Letombe},
  title       = {Classes polynomiales pour les Formules Bool\'ennes Quantifi\'ees},
  institution = {Centre de Recherche en Informatique de Lens, CNRS FRE 2499},
  year        = {2004},
}


@Misc{Letombea,
  author = {F. Letombe},
  title  = {qbfl},
  note   = {\\http://www.cril.univ-artois.fr/\~{}letombe/qbfl},
}

@InProceedings{Letz2001,
  author    = {R. Letz},
  title     = {{Advances in Decision Procedures for Quantified Boolean Formulas}},
  booktitle = {Proc. of the First International Conference on Quantified Boolean Formulae},
  year      = {2001},
  pages     = {55--64},
  crossref  = {Egly2001f},
  url       = {http://www4.informatik.tu-muenchen.de/\~{}letz/semprop/qbf-final.pdf},
}

@InProceedings{Letz2002,
  author =       {R. Letz},
  title =        {{Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas}},
  booktitle =    {Proc. of Tableaux 2002},
  address =      {Copenhagen, Denmark},
  year =         {2002},
  url =          {http://www4.informatik.tu-muenchen.de/\~{}letz/semprop/qbf-submitted.ps}
}

@Misc{Letz2002b,
  author = {R. Letz},
  title  = {Semprop},
  year   = {2002},
  note   = {\\http://www4.informatik.tu-muenchen.de/\~{}letz/semprop},
}

@Misc{Letza,
  author = {R. Letz},
  title  = {Semprop},
  note   = {\\http://www4.in.tum.de/\~{}letz/semprop},
}

@inproceedings{Levesque98,
  author    = {H. Levesque},
  title     = {A completeness result for reasoning with incomplete first-order knowledge bases},
  booktitle = {Proc. of KR'98},
  year      = {1998},
  pages = {14-23}
}

@Article{Lewis1978,
  author  = {H.R. Lewis},
  title   = {Renaming a set of clauses as a {H}orn set},
  journal = {Journal of the Association for Computing Machinery},
  year    = {1978},
  volume  = {25},
  pages   = {134--135},
}

@Article{Lewis1978a,
  author  = {H.R. Lewis},
  title   = {Renaming a set of clauses as a Horn set},
  journal = {Journal of the Association for Computing Machinery},
  year    = {1978},
  volume  = {25},
  pages   = {134--135},
}

@Article{Lewis78,
  author = 	 {H.R. Lewis},
  title = 	 {Renaming a set of clauses as a Horn set},
  journal = 	 {Journal of the Association for Computing Machinery},
  year = 	 {1978},
  volume = 	 {25},
  pages = 	 {134--135}
}

@article{Li2003,
 author = {Li, C.},
 title = {Equivalent literal propagation in the DLL procedure},
 journal = {Discrete Applied Mathematics},
 OPTissue_date = {15 August 2003},
 volume = {130},
 number = {2},
 OPTmonth = aug,
 year = {2003},
 pages = {251--276},
 OPTnumpages = {26},
 OPTpublisher = {Elsevier Science Publishers B. V.},
 OPTaddress = {Amsterdam, The Netherlands, The Netherlands},
}

@Article{Liberatore01,
  author =       {P. Liberatore},
  title =        {Monotonic reductions, representative equivalence, and
compilation of intractable problems},
  journal =      {Journal of the ACM},
  year =         {2001},
  volume =       {48},
  number =       {6},
  pages =        {1091--1125}
}

@inproceedings{Liberatore02,
title = {The Size of {MDP} Factored Policies},
year = {2002},
author = {P. Liberatore},
booktitle = aaai02,
pages = {267--272},
}
      
@article{Liberatore05,
  author    = {P. Liberatore},
  title     = {Complexity and compilability of diagnosis and recovery of graph-based
               systems},
  journal   = {Int. J. Intell. Syst.},
  volume    = {20},
  number    = {10},
  pages     = {1053--1076},
  year      = {2005},
}

@PhdThesis{Liberatore1998b,
  author = {P. Liberatore},
  title  = {Compilation of intractable problems and its application to artificial intelligence},
  school = {Dipartimento di Informatica e Sistemistica, Universit\`a di Roma ``La Sapienza''},
  year   = {1998},
}

@Article{Liberatore2000,
  author  = {P. Liberatore},
  title   = {Compilability and Compact Representations of Revision of {H}orn Knowledge Bases},
  journal = {ACM Transactions on Computational Logic},
  year    = {2000},
  volume  = {1},
  number  = {1},
  pages   = {131--161},
}

@InProceedings{Liberatore98,
 author = {P. Liberatore},
 title = {On the compilability of diagnosis, planning,
 reasoning about actions, belief revision, etc.},
 booktitle = {Proc. of KR'98},
 year = {1998},
 OPTaddress = {Trento},
 pages = {144--155}
}

@article{LiberatoreSchaerf07,
  author    = {P. Liberatore and
               M. Schaerf},
  title     = {Compilability of propositional abduction},
  journal   = {{ACM} Trans. Comput. Log.},
  volume    = {8},
  number    = {1},
  pages     = {2},
  year      = {2007},
}

@Article{LiberatoreSchaerf97,
 author = {P. Liberatore and M. Schaerf},
 title = {Reducing belief revision to circumscription (and vice versa)},
 journal = {Artificial Intelligence},
 year = {1997},
 volume = {93},
 number = {1-2},
 pages = {261--296}
}

@InProceedings{Lifschitz85,
  author = 	 {V. Lifschitz},
  title = 	 {Computing circumscription},
  booktitle = 	 {Proc. of the $9^{th}$ International Joint Conference
		  on Artificial Intelligence (IJCAI'85)},
  year = 	 {1985},
  address = 	 {Los Angeles (CA)},
  pages = 	 {121--127}
}

@Article{Lifschitz90,
  author = 	 {V. Lifschitz},
  title = 	 {Frames in the space of situations (Research Note)},
  journal = 	 {Artificial Intelligence},
  year = 	 {1990},
  volume = 	 {46},
  pages = 	 {365--376}
}

@Article{Lin01,
  author = 	 {F. Lin},
  title = 	 {On the strongest necessary and weakest sufficient conditions},
  journal = 	 {Artificial Intelligence},
  year = 	 {2001},
  volume = 	 {128},
  pages = 	 {143-159},
}

@InProceedings{LinReiter94,
  author = 	 {F. Lin and R. Reiter},
  title = 	 {Forget it!},
  booktitle = 	 {Proc. of the AAAI Fall Symposium on Relevance},
  year = 	 {1994},
  address = 	 {New Orleans},
  pages = 	 {154--159}
}

@InProceedings{Littman99,
  author =   {M. Littman},
  title =    {Initial experiments in stochastic satisfiability},
  booktitle =    aaai99,
  year =     {1999},
  pages =    {667-672}
}

@article{Littmanetal01,
  author    = {M. L. Littman and
               S. M. Majercik and
               T. Pitassi},
  title     = {Stochastic Boolean Satisfiability},
  journal   = {Journal of Automated Reasoning},
  volume    = {27},
  number    = {3},
  year      = {2001},
  pages     = {251-296},
  OPTee        = {http://dx.doi.org/10.1023/A:1017584715408},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@Book{Loveland1978,
  title     = {Automated theorem proving: a logical basis},
  publisher = {Noth-Holland},
  year      = {1978},
  author    = {D.W. Loveland},
  address   = {Amsterdam},
}

@Book{Loveland1978a,
  title     = {Automated theorem proving: a logical basis},
  publisher = {Noth-Holland},
  year      = {1978},
  author    = {D.W. Loveland},
  address   = {Amsterdam},
}

@Book{Loveland78,
  author = 	 {D.W. Loveland},
  title = 	 {Automated theorem proving: a logical basis},
  publisher = 	 {Noth-Holland},
  year = 	 {1978},
  address = 	 {Amsterdam}
}

@inproceedings{LucasJoao12,
  author    = {L. Bordeaux and J. Marques-Silva},
  title     = {Knowledge Compilation with Empowerment},
  booktitle = {Proc. of SOFSEM'12},
  year      = {2012},
  OPTpages     = {},
}


 @techreport{M2012,
  author      = {N. Manthey},
  title       = {Solver Description of {RISS} 2.0 and {PRISS} 2.0},
  institution = {TU Dresden, Knowledge Representation and Reasoning},
  year        = {2012}
}

@InProceedings{MadreCoudert91,
  author = 	 {J.-C. Madre and O. Coudert},
  title = 	 {A logically complete reasoning maintenance system
		  based on a logical constraint solver},
  booktitle = 	 {Proc. of the $12^{th}$ International Joint
		  Conference on Artificial Intelligence (IJCAI'91)},
  year = 	 {1991},
  address = 	 {Sydney},
  pages = 	 {294--299},
  note = 	 {Extended version as BULL research report "A complete
		  reasoning maintenance system based on typed decision
		  graphs", Louveciennes, 1--26}
}

@Article{MadreCoudert94,
  author = 	 {J.-C. Madre and O. Coudert},
  title = 	 {Une approche intentionnelle du calcul des implicants
		  premiers et essentiels des fonctions bool\'eennes},
  journal = 	 {Informatique th\'eorique et Applications},
  year = 	 {1994},
  volume = 	 {28},
  number = 	 {2}
}

@InProceedings{MajercikLittman99,
  author =   {S. Majercik and M. Littman},
  title =    {Contingent planning under uncertainty via stochastic
                  satisfiability},
  booktitle =    aaai99,
  year =     {1999},
  pages =    {549-556}
}

@TechReport{Mamoulis2004,
  author =   {N. Mamoulis and K. Stergiou},
  title =    {{Algorithms for Quantified Constraint Satisfaction Problems}},
  institution =  {APES Research Group},
  year =     2004,
  number =   {APES-78-2004},
  month =    {January},
  note =     {\\http://www.dcs.st-and.ac.uk/\~{ }apes/apesreports.html},
  url =          {http://www.dcs.st-and.ac.uk/~apes/reports/apes-78-2004.ps}
}

      @inproceedings{Marques-SilvaP14,
     author    = {J. Marques{-}Silva and
                  A. Previti},
     title     = {On Computing Preferred MUSes and MCSes},
     booktitle = {Proc. of SAT'14},
     pages     = {58--74},
     year      = {2014},
   }

@InBook{Marquis00,
  author =	 {P. Marquis},
  OPTnote =	 {Moral S. et Kohlas J. (eds.), Gabbay D. et Smets Ph. (series
                  eds.)},
  title =	 {Consequence finding algorithms},
  chapter =	 {2},
  publisher =	 {Kluwer Academic Publisher},
  year =	 {2000},
  series =	 {Handbook on Defeasible Reasoning and Uncertainty Management
                  Systems},
  volume =	 {5},
  pages =	 {41--145},
}

@inproceedings{Marquis11,
  author    = {P. Marquis},
  title     = {Existential Closures for Knowledge Compilation},
  booktitle = {Proc. of IJCAI'11},
  year      = {2011},
  pages     = {996-1001},
  OPTee        = {http://ijcai.org/papers11/Papers/IJCAI11-171.pdf},
  OPTcrossref  = {DBLP:conf/ijcai/2011},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@InProceedings{Marquis2008,
  author    = {P. Marquis},
  title     = {Knowledge compilation: a sightseeing tour},
  booktitle = {Tutorial notes, ECAI'08},
  year      = {2008},
  note      = {available on-line},
}



@PhdThesis{Marquis91,
  author = 	 {P. Marquis},
  title = 	 {Contribution \`a l'\'etude des m\'ethodes de
		  construction d'hypoth\`eses en intelligence artificielle},
  school = 	 {Universit\'e de Nancy 1},
  year = 	 {1991},
  type = 	 {Th\`ese d'Universit\'e},
  note = 	 {(in french)}
}

  
@Article{Marquis93,
  author = 	 {P. Marquis},
  title = 	 {Skeptical abduction},
  journal = 	 {International Journal on Artificial Intelligence Tools},
  year = 	 {1993},
  volume = 	 {2},
  number = 	 {4},
  pages = 	 {511--540}
}

@InProceedings{Marquis95,
  author = 	 {P. Marquis},
  title = 	 {Knowledge compilation using theory prime implicates},
  booktitle = 	 {Proc. of the $14^{th}$ International Joint
		  Conference on Artificial Intelligence (IJCAI'95)},
  year = 	 {1995},
  address = 	 {Montreal},
  pages = 	 {837--843}
}

@InBook{Marquis99,
  author = 	 {P. Marquis},
  title = 	 {Consequence finding algorithms},
  chapter = 	 {},
  publisher = 	 {Kluwer Academic Publishers},
  year = 	 {1999},
  volume = 	 {},
  series = 	 {in The Handbook for Uncertain and Defeasible Reasoning,
Volume 5 (Algorithms for Uncertain and Defeasible Reasoning)},
  note = 	 {To appear}
}

@InProceedings{MarquisSadaoui96,
  author = 	 {P. Marquis and S. Sadaoui},
  title = 	 {A new algorithm for computing theory prime
		  implicates compilations},
  booktitle = 	 {Proc. of the $13^{th}$ National Conference on
		  Artificial Intelligence (AAAI'96)},
  year = 	 {1996},
  address = 	 {Portland (OR)},
  pages = 	 {504--509}
}

@inproceedings{MateescuDechter06,
  author    = {R. Mateescu and
               R. Dechter},
  title     = {Compiling Constraint Networks into {AND/OR} Multi-valued Decision
               Diagrams (AOMDDs)},
  booktitle = {Proc. of CP'06},
  year      = {2006},
  pages     = {329-343},
  OPTee        = {http://dx.doi.org/10.1007/11889205_25},
  OPTcrossref  = {DBLP:conf/cp/2006},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{Mateescuetal08,
  author    = {R. Mateescu and
               R. Dechter and
               R. Marinescu},
  title     = {{AND/OR} Multi-Valued Decision Diagrams ({AOMDDs}) for Graphical
               Models},
  journal   = {Journal of Artificial Intelligence Research},
  volume    = {33},
  year      = {2008},
  pages     = {465-519},
  OPTee        = {http://dx.doi.org/10.1613/jair.2605},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}


@InProceedings{MathieuDelahaye90,
  author =       {Ph. Mathieu and J.-P. Delahaye},
  title =        {The Logical Compilation of Knowledge Bases},
  booktitle =    {Proc. of JELIA'90},
  year =         {1990},
  pages =        {386-398}
}

@Article{MathieuDelahaye94,
 author = {Ph. Mathieu and J.-P. Delahaye},
 title = {A Kind of Logical Compilation for Knowledge Bases},
 journal = {Theoretical Computer Science},
 year = {1994},
 volume = {131},
number = {1},
 pages = {197-218}
}
 
@Article{McCarthy80,
  author = 	 {J. McCarthy},
  title = 	 {Circumscription: a form of non--monotonic reasoning},
  journal = 	 {Artificial Intelligence},
  year = 	 {1980},
  volume = 	 {13},
  pages = 	 {27--39}
}

@Article{McCarthy86,
  author = 	 {J. McCarthy},
  title = 	 {Applications of circumscription to formalizing common-sense knowledge},
  journal = 	 {Artificial Intelligence},
  year = 	 {1986},
  volume = 	 {28},
  pages = 	 {89--116}
}

@Article{McCluskey1956,
  author  = {E.J. McCluskey},
  title   = {Minimization of {B}oolean functions},
  journal = {Bell System Technical Journal},
  year    = {1956},
  volume  = {35},
  number  = {6},
  pages   = {1445--1446},
}

@Article{McCluskey1956a,
  author  = {E.J. McCluskey},
  title   = {Minimization of boolean functions},
  journal = {Bell System Technical Journal},
  year    = {1956},
  volume  = {35},
  number  = {6},
  pages   = {1445--1446},
}

@Article{McCluskey56,
  author = 	 {E.J. McCluskey},
  title = 	 {Minimization of boolean functions},
  journal = 	 {Bell System Technical Journal},
  year = 	 {1956},
  volume = 	 {35},
  number = 	 {6},
  pages = 	 {1445--1446}
}

@InProceedings{McIlraith94,
  author = 	 {S. McIlraith},
  title = 	 {Generating tests using abduction},
  booktitle = 	 {Proc. of KR'94},
  year = 	 {1994},
  pages = 	 {449-460}
}

@Article{McKinsey1943,
  author  = {J. McKinsey},
  title   = {The decision problem for some classes of sentences without quantifiers},
  journal = {Journal of Symbolic Logic},
  year    = {1943},
  volume  = {8},
  pages   = {61--77},
}

@Article{McKinsey43,
  author =       {J. McKinsey},
  title =        {The decision problem for some classes of sentences without quantifiers},
  journal =      {Journal of Symbolic Logic},
  year =         {1943},
  volume = {8},
  pages = {61--77}
}

@inproceedings{McMillan02,
  author    = {K. L. McMillan},
  title     = {Applying {SAT} Methods in Unbounded Symbolic Model Checking},
  booktitle = {Proc. of CAV'02},
  year      = {2002},
  pages     = {250-264},
  OPTee        = {http://dx.doi.org/10.1007/3-540-45657-0_19},
  OPTcrossref  = {DBLP:conf/cav/2002},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{Mengel16,
  author    = {S. Mengel},
  title     = {Parameterized Compilation Lower Bounds for Restricted CNF-Formulas},
  booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2016 - 19th
               International Conference, Bordeaux, France, July 5-8, 2016, Proceedings},
  pages     = {3--12},
  year      = {2016},
}

@Article{Minicozzi1972,
  author  = {E. Minicozzi and R. Reiter},
  title   = {A note on linear resolution strategies in consequence--finding},
  journal = {Artificial Intelligence},
  year    = {1972},
  volume  = {3},
  pages   = {175--180},
}


@Article{Minicozzi1972a,
  author  = {E. Minicozzi and R. Reiter},
  title   = {A note on linear resolution strategies in consequence--finding},
  journal = {Artificial Intelligence},
  year    = {1972},
  volume  = {3},
  pages   = {175--180},
}

@Article{MinicozziReiter72,
  author = 	 {E. Minicozzi and R. Reiter},
  title = 	 {A note on linear resolution strategies in consequence--finding},
  journal = 	 {Artificial Intelligence},
  year = 	 {1972},
  volume = 	 {3},
  pages = 	 {175--180}
}

@InProceedings{Minker82,
  author = 	 {J. Minker},
  title = 	 {On indefinite databases and the closed world assumption},
  booktitle = 	 {Proc. of CADE'82},
  year = 	 {1982},
  pages = 	 {292--308}
}

@InProceedings{Minoux1988,
  author =       {M. Minoux},
  title =        {{LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation}},
  booktitle =    {Information Processing Letter},
  pages =        {1--12},
  year =         1988,
  volume =       29
}

@Misc{Mneimneh03,
  author =   {M. Mneimneh and K. A. Sakallah},
  title =    {{QBF Benchmarks : Sequential Depth Computation}},
  year =     2003,
  note =     {\\http://www.eecs.umich.edu/\~{}maherm/benchmarks/qbfbenchmarks.html}
}

@InProceedings{Mneimneh03a,
  author =       {M. Mneimneh and K. Sakallah},
  title =    {{Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution}},
  booktitle =    {Sixth International Conference on Theory and Applications of Satisfiability Testing},
  pages =        {411-425},
  year =     2003
}

@article{MosesTennenholtz96,
title = {Off-line reasoning for on-line efficiency: {K}nowledge bases},
year = {1996},
author = {Y. Moses and M. Tennenholtz},
journal = {Artificial Intelligence},
pages = {229-239},
volume = {83},
}

@inproceedings{Muiseetal12,
  author    = {Ch.J. Muise and
               Sh.A. McIlraith and
               J.Ch. Beck and
               E.I. Hsu},
  title     = {Dsharp: Fast d-{DNNF} Compilation with sharp{SAT}},
  booktitle = {Proc. of AI'12},
  year      = {2012},
  pages     = {356-361},
  OPTee        = {http://dx.doi.org/10.1007/978-3-642-30353-1_36},
  OPTcrossref  = {DBLP:conf/ai/2012},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@Article{Mundici74,
  author = 	 {D. Mundici},
  title = 	 {Tautologies with a unique {C}raig interpolant, uniform vs. non-uniform complexity},
  journal = 	 {Annals of Pure and Applied Logic},
  year = 	 {1974},
  volume = 	 {27},
  pages = 	 {265--273}
}

@Article{MurrayRosenthal93,
  author = 	 {N.V. Murray and E. Rosenthal},
  title = 	 {Dissolution; making paths vanish},
  journal = 	 {Journal of the Association for Computing Machinery},
  year = 	 {1993},
  volume = 	 {40},
  number = 	 {3},
  pages = 	 {504--535}
}

@Proceedings{Narizzano2002,
  title     = {Proc. of SAT'02},
  year      = {2002},
  editor    = {M. Narizzano},
  address   = {Cincinnati, Ohio, USA},
  month     = {May 6-9},
  booktitle = {Proc. of SAT'02},
  url       = {http://www.mrg.dist.unige.it/\~{}mox/qbf-02},
}

@Proceedings{Narizzano2002a,
  title     = {Proc. of QBF'02 workshop at SAT'02},
  year      = {2002},
  editor    = {M. Narizzano},
  address   = {Cincinnati, Ohio, USA},
  month     = {May 6-9},
  booktitle = {Proc. of QBF'02 workshop at SAT'02},
  url       = {http://www.mrg.dist.unige.it/\~{}mox/qbf-02},
}



@Misc{Narizzanoa,
  author = {M. Narizzano and A. Tacchella},
  title  = {{QBFLib : The Quantified Boolean Formulas Satisfiability Library}},
}

@Misc{Narizzanob,
  author = {M. Narizzano},
  title  = {{QBFLIB - Description of the robot problems}},
  note   = {\\http://www.mrg.dist.unige.it/\~{}qube/qbflib/Description/robot.html},
}

@article{Nebel00,
title = {On the Compilability and Expressive Power of Propositional Planning Formalisms},
year = {2000},
author = {B. Nebel},
journal = {Journal of Artificial Intelligence Research},
pages = {271-315},
volume = {12},
}

@InBook{Nebel98,
  author =   {B. Nebel},
  OPTeditor =    {D. Dubois and H. Prade},
  title =    {Belief Revision},
  chapter =      {How hard is it to revise a belief base?},
  publisher =    {Kluwer Academic},
  year =     {1998},
  volume =   {3},
  series =   {Handbook of Defeasible Reasoning and Uncertainty Management Systems},
  pages =    {77-145}
}

@Article{Necula1967,
  author  = {N.N Necula},
  title   = {A numerical procedure for determination of the prime implicants of a {B}oolean function},
  journal = {IEEE Transactions on Electronic Computers},
  year    = {1967},
  volume  = {EC--16},
  pages   = {687--689},
}

@Article{Necula1967a,
  author  = {N.N Necula},
  title   = {A numerical procedure for determination of the prime implicants of a boolean function},
  journal = {IEEE Transactions on Electronic Computers},
  year    = {1967},
  volume  = {EC--16},
  pages   = {687--689},
}

@Article{Necula67,
  author = 	 {N.N Necula},
  title = 	 {A numerical procedure for determination of the prime
		  implicants of a boolean function},
  journal = 	 {IEEE Transactions on Electronic Computers},
  year = 	 {1967},
  volume = 	 {EC--16},
  pages = 	 {687--689}
}

@Article{Nelson1955,
  author  = {R.J. Nelson},
  title   = {Simplest normal truth functions},
  journal = {Journal of Symbolic Logic},
  year    = {1955},
  volume  = {20},
  pages   = {105--108},
}
 
@Article{Nelson1955a,
  author  = {R.J. Nelson},
  title   = {Simplest normal truth functions},
  journal = {Journal of Symbolic Logic},
  year    = {1955},
  volume  = {20},
  pages   = {105--108},
}

@Article{Nelson55,
  author = 	 {R.J. Nelson},
  title = 	 {Simplest normal truth functions},
  journal = 	 {Journal of Symbolic Logic},
  year = 	 {1955},
  volume = 	 {20},
  pages = 	 {105--108}
}

@Article{Nerodeetal95,
  author = 	 {A. Nerode and R.T. Ng and V.S. Subrahmanian},
  title = 	 {Computing circumscriptive databases. I: Theory and algorithms},
  journal = 	 {Information and Computation},
  year = 	 {1995},
  volume = 	 {116},
  pages = 	 {58-80}
}

@InProceedings{Ngair93,
  author = 	 {T.H. Ngair},
  title = 	 {A new algorithm for incremental prime implicate generation},
  booktitle = 	 {Proc. of the $13^{th}$ International Joint
		  Conference on Artificial Intelligence (IJCAI'93)},
  year = 	 {1993},
  address = 	 {Chamb\'ery},
  pages = 	 {46--51}
}

@Article{Nilsson87,
  author = 	 {N.J. Nilsson},
  title = 	 {Probabilistic logic},
  journal = 	 {Artificial Intelligence},
  year = 	 {1987},
  volume = 	 {28},
  OPTnumber = 	 {},
  pages = 	 {71--87}
}

@InProceedings{Nishimura2004b,
  author   = {N. Nishimura and P. Ragde and S. Szeider},
  title    = {{Detecting Backdoor Sets with Respect to {H}orn and Binary Clauses}},
  pages    = {96-103},
  crossref = {Giunchiglia2004d},
}

@inproceedings{Nishimuraetal04,
  author    = {N. Nishimura and
               P. Ragde and
               S. Szeider},
  title     = {Detecting Backdoor Sets with Respect to Horn and Binary
               Clauses},
  booktitle = {Proc. of SAT'04},
  year      = {2004},
  OPTee        = {http://www.satisfiability.org/SAT04/programme/51.pdf},
  OPTcrossref  = {DBLP:conf/sat/2004},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{NiveauZ16,
  author    = {A. Niveau and
               B. Zanuttini},
  title     = {Efficient Representations for the Modal Logic {S5}},
  booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
               Artificial Intelligence, {IJCAI} 2016, New York, NY, USA, 9-15 July
               2016},
  pages     = {1223--1229},
  year      = {2016},
}

@inproceedings{Niveauetal10,
  author    = {A. Niveau and
               H. Fargier and
               C. Pralet and
               G.Verfaillie},
  title     = {Knowledge Compilation Using Interval Automata and Applications to
               Planning},
  booktitle = {Proc. of ECAI'10},
  pages     = {459--464},
  year      = {2010},
  }

  @inproceedings{Niveauetal11,
  author    = {A. Niveau and
               H. Fargier and
               C. Pralet},
  title     = {Representing CSPs with Set-Labeled Diagrams: {A} Compilation Map},
  booktitle = {Graph Structures for Knowledge Representation and Reasoning - Second
               International Workshop, {GKR} 2011, Barcelona, Spain, July 16, 2011.
               Revised Selected Papers},
  pages     = {137--171},
  year      = {2011},
}

@InProceedings{OSullivan2006,
  author    = {B. O'Sullivan and G.M. Provan},
  title     = {Approximate Compilation for Embedded Model-based Reasoning},
  booktitle = {Proc. of AAAI'06},
  year      = {2006},
  pages     = {894-899},
}

@inproceedings{Olteanu16,
  author    = {D. Olteanu},
  title     = {Factorized Databases: {A} Knowledge Compilation Perspective},
  booktitle = {Beyond NP, Papers from the 2016 {AAAI} Workshop, Phoenix, Arizona,
               USA, February 12, 2016.},
  year      = {2016},
}

@inproceedings{OztokDarwiche14,
  author    = {U. Oztok and
               A. Darwiche},
  title     = {On Compiling {CNF} into {Decision-DNNF}},
  booktitle = {Proc. of CP'14},
  pages     = {42--57},
  year      = {2014},
  }

@inproceedings{OztokDarwiche15,
  author    = {U. Oztok and
               A. Darwiche},
  title     = {A Top-Down Compiler for Sentential Decision Diagrams},
  booktitle = {Proc. of IJCAI'15},
  pages     = {3141--3148},
  year      = {2015},
}

@inproceedings{Oztoketal16,
  author    = {U. Oztok and
               A. Choi and
               A. Darwiche},
  title     = {Solving PP\({}^{\mbox{PP}}\)-Complete Problems Using Knowledge Compilation},
  booktitle = {Principles of Knowledge Representation and Reasoning: Proceedings
               of the Fifteenth International Conference, {KR} 2016, Cape Town, South
               Africa, April 25-29, 2016.},
  pages     = {94--103},
  year      = {2016},
}

@InCollection{Padoa03,
  author = 	 {A. Padoa},
  title = 	 {Essai d'une th\'eorie alg\'ebrique des nombres
entiers, pr\'ec\'ed\'e d'une introduction logique \`a une th\'eorie
d\'eductive quelconque},
  booktitle = 	 {Biblioth\`eque du Congr\`es International
de Philosophie},
  year = 	 {1903},
  address = 	 {Paris},
  pages = 	 {309-365}
}

@InProceedings{Palacios2006,
  author    = {H. Palacios and H. Geffner},
  title     = {Compiling Uncertainty Away: Solving Conformant Planning Problems Using a Classical Planner (Sometimes)},
  booktitle = {Proc. of AAAI'06},
  year      = {2006},
  pages     = {900-905},
}

@article{PalaciosG09,
  author    = {H. Palacios and
               H. Geffner},
  title     = {Compiling Uncertainty Away in Conformant Planning Problems with Bounded
               Width},
  journal   = {J. Artif. Intell. Res.},
  volume    = {35},
  pages     = {623--675},
  year      = {2009},
}

@inproceedings{PalaciosGeffner06,
  author    = {H. Palacios and H. Geffner},
  title     = {Compiling Uncertainty Away: Solving Conformant Planning Problems Using a Classical Planner (Sometimes)},
  booktitle = {Proc. of AAAI'06},
  year      = {2006},
  pages     = {900-905}
}

@Misc{Pan,
  author  = {G. Pan},
  title   = {{Home Page}},
  note    = {\\http://www.cs.rice.edu/\~{}gqpan},
  optyear = {2003},
}

@InProceedings{PanVardi03,
  author =   {G. Pan and M.Y. Vardi},
  title =    {Optimizing a BDD-Based Modal Solver},
  booktitle =    cade03,
  pages =    {75-89},
  year =     {2003}
}

@InProceedings{PanVardi04,
  author =   {G. Pan and M.Y. Vardi},
  title =    {Symbolic Decision Procedures for QBF},
  booktitle =    cp04,
  pages =    {},
  year =     {2004}
}

@InProceedings{Panetal02,
  author =   {G. Pan and U. Sattler and M.Y. Vardi},
  title =    {BDD-Based Decision Procedures for K},
  booktitle =    cade02,
  pages =    {16-30},
  year =     {2002}
}

@Book{Papadimitriou94,
  author = 	 {Ch. H. Papadimitriou},
  title = 	 {Computational complexity},
  publisher = 	 {Addison--Wesley},
  year = 	 {1994}
}

@InProceedings{Pearce2001,
  author =   {D. Pearce and H. Tompits and S. Woltran},
  title =    {{Encodings for Equilibrium Logic and Logic Programs with Nested Expressions}},
  booktitle =    {Proc. of 10th Portuguese Conference on Artificial Intelligence},
  year =     2001,
  address =  {Porto, Portugal},
  month =    {December}
}

@InProceedings{Pehoushek2002a,
  author   = {D. Pehoushek},
  title    = {{Introduction to QSpace}},
  pages    = {1-16},
  crossref = {Narizzano2002},
}
  
@InProceedings{Pinkas91,
  author =       {G. Pinkas},
  title =        {Propositional nonmonotonic reasoning and inconsistency
in symmetric neural networks},
  booktitle = {Proc. of IJCAI'91},
  year =         {1991},
  OPTaddress = {Sydney},
  pages =        {525--530}
}

@Article{Pinkas95,
  author =       {G. Pinkas},
  title =        {Reasoning, nonmonotonicity and learning in connectionnist
networks that capture propositional knowledge},
  journal =      {Artificial Intelligence},
  year =         {1995},
  volume =       {77},
  pages =        {203--247}
}

@InProceedings{PinkasLoui92,
  author =   {G. Pinkas and R.P. Loui},
  title =    {Reasoning from inconsistency: a taxonomy of principles for resolving conflict},
  booktitle =    {Proc. of KR'92},
  pages =    {709--719},
  year =     {1992},
  OPTaddress =      {Cambridge (MA)}
}

@inproceedings{PipatsrisawatDarwiche08,
  author    = {K. Pipatsrisawat and A. Darwiche},
  title     = {New Compilation Languages based on Structured Decomposability},
  booktitle = {Proc. of AAAI'08},
  year      = {2008},
  pages = {517--522}
}

@inproceedings{PipatsrisawatDarwiche10,
  author    = {K. Pipatsrisawat and A. Darwiche},
  title     = {A Lower Bound on the Size of Decomposable Negation Normal
               Form},
  booktitle = {Proc. of AAAI'10},
  year      = {2010},
  OPTee        = {http://www.aaai.org/ocs/index.php/AAAI/AAAI10/paper/view/1856},
  OPTcrossref  = {DBLP:conf/aaai/2010},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{PipatsrisawatDarwiche10b,
  author    = {K. Pipatsrisawat and
               A. Darwiche},
  title     = {Top-Down Algorithms for Constructing Structured {DNNF}: Theoretical
               and Practical Implications},
  booktitle = {Proc. of ECAI'10},
  year      = {2010},
  pages     = {3-8},
  OPTee        = {http://www.booksonline.iospress.nl/Content/View.aspx?piid=17704},
  OPTcrossref  = {DBLP:conf/ecai/2010},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{PipatsrisawatDarwiche11,
  author    = {K. Pipatsrisawat and
               A. Darwiche},
  title     = {On the power of clause-learning {SAT} solvers as resolution engines},
  journal   = {Artificial Intelligence},
  year      = {2011},
  volume    = {175},
  number    = {2},
  pages     = {512--525},
  OPTurl       = {http://dx.doi.org/10.1016/j.artint.2010.10.002},
  OPTdoi       = {10.1016/j.artint.2010.10.002},
  OPTtimestamp = {Sun, 05 Oct 2014 21:25:19 +0200},
  OPTbiburl    = {http://dblp.uni-trier.de/rec/bib/journals/ai/PipatsrisawatD11},
  OPTbibsource = {dblp computer science bibliography, http://dblp.org}
}



@InProceedings{Pizzuti96,
  author = 	 {C. Pizzuti},
  title = 	 {Computing prime implicants by integer programming},
  booktitle = 	 {Proc. of the $8^{th}$ IEEE International Conference
		  on Tools with Artificial Intelligence (ICTAI'96)},
  year = 	 {1996},
  address = 	 {Toulouse},
  pages = 	 {332--336}
}

@Article{Plaisted2003,
  author =   {D. A. Plaisted and A. Biere and Y. Zhu},
  title =    {A satisfiability procedure for quantified boolean formulae},
  journal =      {Discrete Applied Mathematics},
  volume =       {130},
  number =       {2},
  year =         {2003},
  issn =         {0166-218X},
  pages =        {291--328},
  publisher =    {Elsevier Science Publishers B. V.},
  OPTcrossref =     {DAM02},
  url =          {http://www.qbflib.org/02-damPlaBieZhu.pdf.gz}
}

@InProceedings{Pliuskevicius2001a,
  author   = {R. Pliuskevicius},
  title    = {{Simple Decision Procedure for a Fragment of QPTL}},
  pages    = {65-74},
  crossref = {Egly2001f},
}

@InProceedings{Polacik2001a,
  author   = {T. Polacik},
  title    = {{Quantified Propositional Formulas, Intuitionistic Logic, and Cantor Space}},
  pages    = {75-83},
  crossref = {Egly2001f},
}

@InProceedings{Pollet1997a,
  author   = {C. Pollet and J. B. Remmel},
  title    = {{Non-Monotonic Reasoning with Quantified Boolean Constraints}},
  pages    = {18-39},
  crossref = {Dix1997},
}

@Article{Poole88,
  author = 	 {D. Poole},
  title = 	 {A logical framework for default reasoning},
  journal = 	 {Artificial Intelligence},
  year = 	 {1988},
  volume = 	 {36},
  pages = 	 {27--47}
}

@Article{Poole89,
 author = {D. Poole},
 title = {Explanation and prediction: an architecture for
 default and abductive reasoning},
 journal = {Computational Intelligence},
 year = {1989},
 volume = {5},
 pages = {97--110}
}

@Article{Poole97,
  author = 	 {D. Poole},
  title = 	 {The independent choice logic for modelling multiple
		  agents under uncertainty},
  journal = 	 {Artificial Intelligence},
  year = 	 {1997},
  volume = 	 {94},
  number = 	 {1},
  pages = 	 {7--56}
}

@Article{Post1941,
  author  = {E. Post},
  title   = {The two-valued iterative systems of mathematical logic},
  journal = {Annals of Mathematical Studies},
  year    = {1941},
  volume  = {5},
  pages   = {1--122},
}

@Article{Post41,
  author =       {E. Post},
  title =        {The two-valued iterative systems of mathematical logic},
  journal =      {Annals of Mathematical Studies},
  year =         {1941},
  volume = {5},
  pages = {1--122}
}

@InProceedings{Provan90,
  author = 	 {G.M. Provan},
  title = 	 {The computational complexity of multiple-context
		  truth maintenance systems},
  booktitle = 	 {Proc. of the $9^{th}$ European Conference on
		  Artificial Intelligence (ECAI'90)},
  year = 	 {1990},
  address = 	 {Stockholm},
  pages = 	 {522--527}
}

@Article{Przymusinski89,
  author = 	 {T.C. Przymusinski},
  title = 	 {An algorithm to compute circumscription},
  journal = 	 {Artificial Intelligence},
  year = 	 {1989},
  volume = 	 {38},
  pages = 	 {49--73}
}

@Misc{QDimacs,
  key =      {QDimacs},
  note =     {http://www.mrg.dist.unige.it/~qube/qbflib/Draft/qDimacs.ps.gz}
}

@Article{Quine1952,
  author  = {W.V.O. Quine},
  title   = {The problem of simplifying truth functions},
  journal = {American Mathematical Monthly},
  year    = {1952},
  volume  = {59},
  pages   = {521--531},
}

@Article{Quine1952a,
  author  = {W.V.O. Quine},
  title   = {The problem of simplifying truth functions},
  journal = {American Mathematical Monthly},
  year    = {1952},
  volume  = {59},
  pages   = {521--531},
}

@Article{Quine1955,
  author  = {W.V.O. Quine},
  title   = {A way to simplify truth functions},
  journal = {American Mathematical Monthly},
  year    = {1955},
  volume  = {62},
  pages   = {627--631},
}

@Article{Quine1955a,
  author  = {W.V.O. Quine},
  title   = {A way to simplify truth functions},
  journal = {American Mathematical Monthly},
  year    = {1955},
  volume  = {62},
  pages   = {627--631},
}

@Article{Quine1959,
  author  = {W.V.O. Quine},
  title   = {On cores and prime implicants of truth functions},
  journal = {American Mathematical Monthly},
  year    = {1959},
  volume  = {66},
  pages   = {755--760},
}

@Article{Quine1959a,
  author  = {W.V.O. Quine},
  title   = {On cores and prime implicants of truth functions},
  journal = {American Mathematical Monthly},
  year    = {1959},
  volume  = {66},
  pages   = {755--760},
}
   
@Article{Quine52,
  author = 	 {W.V.O. Quine},
  title = 	 {The problem of simplifying truth functions},
  journal = 	 {American Mathematical Monthly},
  year = 	 {1952},
  volume = 	 {59},
  pages = 	 {521--531}
}   

@Article{Quine55,
  author = 	 {W.V.O. Quine},
  title = 	 {A way to simplify truth functions},
  journal = 	 {American Mathematical Monthly},
  year = 	 {1955},
  volume = 	 {62},
  pages = 	 {627--631}
}

@Article{Quine59,
  author = 	 {W.V.O. Quine},
  title = 	 {On cores and prime implicants of truth functions},
  journal = 	 {American Mathematical Monthly},
  year = 	 {1959},
  volume = 	 {66},
  pages = 	 {755--760}
}

@Article{Rabinov89,
  author = 	 {A. Rabinov},
  title = 	 {A generalization of collapsible cases of circumscription},
  journal = 	 {Artificial Intelligence},
  year = 	 {1989},
  volume = 	 {38},
  pages = 	 {111-117}
}

@InProceedings{RaimanDeKleer92,
  author = 	 {O. Raiman and J. de Kleer},
  title = 	 {A minimality maintenance system},
  booktitle = 	 {Proc. of KR'92},
  year = 	 {1992},
  address = 	 {Cambridge (MA)},
  pages = 	 {532--538}
}

@InProceedings{Rameshetal93,
  author = 	 {A. Ramesh and N.V. Murray},
  title = 	 {Non-clausal deductive techniques for computing prime
		  implicants and prime implicates},
  booktitle = 	 {Proc. of the $4^{th}$ International Conference on
		  Logic Programming and Automated Reasoning (LPAR'93)},
  year = 	 {1993},
  address = 	 {St Petersburg},
  pages = 	 {277-288}
}

@Article{Rameshetal97,
  author = 	 {A. Ramesh and G. Becker and N.V. Murray},
  title = 	 {CNF and DNF considered harmful for computing prime implicants/implicates},
  journal = 	 {Journal of Automated Reasoning},
  year = 	 {1997},
  volume = 	 {18},
  pages = 	 {337--356}
}

@InProceedings{Rauzy1995,
  author    = {A. Rauzy},
  title     = {{Polynomial restrictions of SAT: What can be done with an efficient implementation of the Davis and Putnam's procedure}},
  booktitle = cp95,
  year      = {1995},
  volume    = {976},
  pages     = {515--532},
  address   = {Springer Verlag},
}

@TechReport{Rauzy1995b,
  author =      {R. G\'enisson and A. Rauzy},
  title =       {{Efficient Horn renaming: yet a Davis and Putnam's procedure}},
  institution = {LaBRI, Universit\'e Bordeaux I},
  volume =      {1092-95},
  year =        {1995}
}

@Book{Reiter01,
author = {R. Reiter},
title = {Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems},
publisher = {MIT Press},
year = {2001}
}

@InBook{Reiter1978,
  pages     = {119-140},
  title     = {On closed world data bases},
  publisher = {Plenum Press},
  year      = {1978},
  author    = {R. Reiter},
}

@InBook{Reiter1978a,
  pages     = {119-140},
  title     = {On closed world data bases},
  publisher = {Plenum Press},
  year      = {1978},
  author    = {R. Reiter},
}

@Article{Reiter1980,
  author  = {R. Reiter},
  title   = {A logic for default reasoning},
  journal = {Artificial Intelligence},
  year    = {1980},
  volume  = {13},
  pages   = {81--132},
}

@Article{Reiter1980a,
  author  = {R. Reiter},
  title   = {A logic for default reasoning},
  journal = {Artificial Intelligence},
  year    = {1980},
  volume  = {13},
  pages   = {81--132},
}

@InBook{Reiter78,
  author = 	 {R. Reiter},
  title = 	 {On closed world data bases},
  publisher = 	 {Plenum Press},
  year = 	 {1978},
  pages = 	 {119-140}
}

@Article{Reiter80,
  author = 	 {R. Reiter},
  title = 	 {A logic for default reasoning},
  journal = 	 {Artificial Intelligence},
  year = 	 {1980},
  volume = 	 {13},
  pages = 	 {81--132}
}

@Article{Reiter87,
  author = 	 {R. Reiter},
  title = 	 {A theory of diagnosis from first principles},
  journal = 	 {Artificial Intelligence},
  year = 	 {1987},
  volume = 	 {32},
  pages = 	 {57--95}
}

@InProceedings{ReiterdeKleer87,
  author = 	 {R. Reiter and J. de Kleer},
  title = 	 {Foundations of assumption-based truth maintenance
		  systems: preliminary report},
  booktitle = 	 {Proc. of AAAI'87},
  year = 	 {1987},
  address = 	 {Seattle (WA)},
  pages = 	 {183--188}
}

@PhdThesis{Remshagen2001,
  author =   {A. Remshagen},
  title =    {{Learning for SAT and MINSAT, and Algorithms for Quantified SAT and MINSAT}},
  school =   {University of Texas},
  year =     2001,
  address =  {Dallas},
  month =    {August}
}
		  
@TechReport{Remshagen2002,
  author =   {A. Remshagen and K. Truemper},
  title =    {{Algorithms for Logic-Based Abduction}},
  institution =  {University of Texas},
  year =     2002,
  address =  {Dallas}
}

@Misc{Rintanen1999,
  author = {J. Rintanen},
  title  = {Decide},
  year   = {1999},
  note   = {\\http://www.informatik.uni-freiburg.de/\~{}rintanen/qbf.html},
}

@InProceedings{Rintanen1999a,
  author =   {J. Rintanen},
  title =    {{Improvements to the Evaluation of Quantified Boolean Formulae}},
  booktitle =    ijcai99,
  pages =        {1192--1197},
  year =         {1999},
  url =          {http://www.informatik.uni-freiburg.de/\~{}rintanen/Rintanen99qbf.ps}
}

@Article{Rintanen1999b,
  author =   {J. Rintanen},
  title =    {{Constructing Conditional Plans by a Theorem-Prover}},
  journal =      {Journal of Artificial Intelligence Research},
  year =     1999,
  volume =   10,
  pages =    {323-352}
}

@InProceedings{Rintanen2001,
  author      = {J. Rintanen},
  title       = {{Partial implicit unfolding in the Davis-Putnam procedure for Quantified Boolean Formulae}},
  booktitle   = {Proc. of the First International Conference on Quantified Boolean Formulae},
  year        = {2001},
  pages       = {84--93},
  note        = {\\http://www.informatik.uni-freiburg.de/\~{}rintanen/qbf.html},
  optcrossref = {QBF2001},
  url         = {http://www.informatik.uni-freiburg.de/\~{}rintanen/Rintanen01qbf.ps},
}

@article{Robinson1965,
 author = {J. A. Robinson},
 title = {A Machine-Oriented Logic Based on the Resolution Principle},
 journal = {Journal of the ACM},
 volume = {12},
 number = {1},
 OPTmonth = {January},
 year = {1965},
 issn = {0004-5411},
 pages = {23--41},
 doi = {http://doi.acm.org/10.1145/321250.321253},
 publisher = {ACM Press},
}

@Article{Robinson1965a,
  author    = {J. A. Robinson},
  title     = {A Machine-Oriented Logic Based on the Resolution Principle},
  journal   = {Journal of the ACM},
  year      = {1965},
  volume    = {12},
  number    = {1},
  pages     = {23--41},
  issn      = {0004-5411},
  doi       = {http://doi.acm.org/10.1145/321250.321253},
  optmonth  = {January},
  publisher = {ACM Press},
}

@Article{Robinson1965b,
  author  = {J.A. Robinson},
  title   = {A machine-oriented logic based on the resolution principle},
  journal = {Journal of the Association for Computing Machinery},
  year    = {1965},
  volume  = {12},
  pages   = {23--41},
} 

@Article{Robinson1965c,
  author  = {J.A. Robinson},
  title   = {A machine-oriented logic based on the resolution principle},
  journal = {Journal of the Association for Computing Machinery},
  year    = {1965},
  volume  = {12},
  pages   = {23--41},
}

@Article{Robinson65,
  author = 	 {J.A. Robinson},
  title = 	 {A machine-oriented logic based on the resolution principle},
  journal = 	 {Journal of the Association for Computing Machinery},
  year = 	 {1965},
  volume = 	 {12},
  pages = 	 {23--41}
}

@Article{Roth1996,
  author  = {D. Roth},
  title   = {On the hardness of approximate reasoning},
  journal = {Artificial Intelligence},
  year    = {1996},
  volume  = {82},
  number  = {1--2},
  pages   = {273--302},
}

@Article{Roth96,
  author =       {D. Roth},
  title =        {On the hardness of approximate reasoning},
  journal =      {Artificial Intelligence},
  year =         {1996},
  volume = {82},
  number = {1--2},
  pages = {273--302}
}

@Article{RousselMathieu00,
 author = {O. Roussel and Ph. Mathieu},
 title = {The Achievement of Knowledge Bases by Cycle Search},
 journal = {Information and Computation},
 year = {2000},
 volume = {162},
number = {1-2},
 pages = {43-58}
}

@article{RoyWilson00,
    author = "A. Roy and Ch. Wilson",
    title = "Supermodels and Closed Sets",
    journal = "Electronic Colloquium on Computational Complexity (ECCC)",
    volume = "010",
    year = "2000"
}

@InProceedings{Rymon92,
  author = 	 {R. Rymon},
  title = 	 {Search through systematic search enumeration},
  booktitle = 	 {Proc. of the $3^{rd}$ International Conference on
		  Principles of Knowledge Representation and Reasoning
		  (KR'92)},
  year = 	 {1992},
  address = 	 {Cambridge (MA)},
  pages = 	 {539--550}
}

@Article{Rymon94,
  author = 	 {R. Rymon},
  title = 	 {An {SE}-tree-based prime implicant generation algorithm},
  journal = 	 {Annals of Mathematics and Artificial Intelligence},
  year = 	 {1994},
  volume = 	 {11},
  note = 	 {special issue on model-based diagnosis},
  pages = {329--349}
}

@InProceedings{Sabbadin98,
  author = 	 {R. Sabbadin},
  title = 	 {Decision as abduction},
  booktitle = 	 {Proc. of ECAI'98},
  year = 	 {1998},
  address = 	 {Brighton},
  pages = 	 {600--604}
}

@inproceedings{SamerSzeider08,
  author    = {M. Samer and
               S. Szeider},
  title     = {Backdoor Trees},
  booktitle = {Proc. of AAAI'08},
  year      = {2008},
  pages     = {363-368},
  OPTcrossref  = {DBLP:conf/aaai/2008},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{Sangetal04,
  author    = {T. Sang and
               F. Bacchus and
               P. Beame and
               H.A. Kautz and
               T. Pitassi},
  title     = {Combining Component Caching and Clause Learning for Effective
               Model Counting},
  booktitle = {Proc. of SAT'04},
  year      = {2004},
  OPTee        = {http://www.satisfiability.org/SAT04/programme/21.pdf},
  OPTcrossref  = {DBLP:conf/sat/2004},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{Sangetal05,
  author    = {T. Sang and
               P. Beame and
               H. A. Kautz},
  title     = {Performing {B}ayesian Inference by Weighted Model Counting},
  booktitle = {Proc. of AAAI'05},
  year      = {2005},
  pages     = {475-482},
  OPTcrossref  = {DBLP:conf/aaai/2005},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{SannerMcAllester05,
  author    = {S. Sanner and
               D. A. McAllester},
  title     = {Affine Algebraic Decision Diagrams ({AADD}s) and their Application
               to Structured Probabilistic Inference.},
  booktitle = {Proc. of IJCAI'05},
  year      = {2005},
  pages     = {1384-1390},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@Book{Savage54,
  author = 	 {L. Savage},
  title = 	 {The foundations of statistics},
  publisher = 	 {Wiley and Sons},
  year = 	 {1954}
}

@article{Savicky2000,
    author = "P. Savicky and J. Sgall",
    title = "{DNF} tautologies with a limited number of occurrences of every variable",
    journal = "Theoretical Computer Science",
    volume = "238",
    number = "1-2",
    pages = "495-498",
    year = "2000",
    url = "citeseer.ist.psu.edu/65504.html"
}

@InProceedings{Schaefer1978,
  author       = {Th. J. Schaefer},
  title        = {The complexity of satisfiability problems},
  booktitle    = {Proc. of STOC'78},
  year         = {1978},
  pages        = {216--226},
  optlocation  = {San Diego, California, United States},
  optpublisher = {ACM Press},
}

@inproceedings{Schaefer78,
 author = {Th. J. Schaefer},
 title = {The complexity of satisfiability problems},
 booktitle = {Proc. of STOC'78},
 year = {1978},
 pages = {216--226},
 OPTlocation = {San Diego, California, United States},
 OPTpublisher = {ACM Press},
 }

@Article{Schlipf1995,
  author  = {J. Schlipf and F. Annexstein and J. Franco and R. Swaminathan},
  title   = {{On finding solutions to extended {H}orn formulas}},
  journal = {Information Processing Letters},
  year    = {1995},
  volume  = {54},
  pages   = {133--137},
}

@TechReport{Scholl2000,
  author =   {C. Scholl and B. Becker},
  title =    {Checking Equivalence for Partial Implementations},
  institution =  {Computer Science Albert-Ludwigs-University},
  year =     2000,
  number =   145,
  address =      {Germany},
  month =    {October}
}

@Misc{Scholl2003,
  author = {C. Scholl and B. Becker},
  title  = {{QBFLIB - Description of the Checking Equivalence for Partial Implementation problems}},
  year   = {2003},
  note   = {\\http://www.mrg.dist.unige.it/\~{}qube/qbflib/Description/CEfPI.html},
}

@InProceedings{Schrag96,
  author =       {R. Schrag},
  title =        {Compilation for critically constrained knowledge bases},
  booktitle = {Proc. of AAAI'96},
  year =         {1996},
  OPTaddress =      {Portland (OR)},
  pages =        {510--515}
}

@Article{Scutella1990,
  author =       {M. G. Scutella},
  title =        {{A note on Dowling and Gallier's topdown algorithm for propositional Horn satisfiability}},
  journal =      {Journal of Logic Programming},
  year =         1990,
  volume =       8,
  pages =        {265--273}
}

@inproceedings{SegoufinVianu05,
  author    = {L. Segoufin and V. Vianu},
  title     = {Views and queries: determinacy and rewriting},
  booktitle = {Proc. of PODS'05},
  year      = {2005},
  pages     = {49--60},
}
		  
@Article{Selman1996,
  author  = {B. Selman and H.A. Kautz},
  title   = {Knowledge compilation and theory approximation},
  journal = {Journal of the ACM},
  year    = {1996},
  volume  = {43},
  pages   = {193--224},
}

@InProceedings{SelmanKautz91,
  author =       {B. Selman and H.A. Kautz},
  title =        {Knowledge Compilation using {H}orn Approximations},
  booktitle =    {Proc. of AAAI'91},
  year =         {1991},
  pages =        {904-909}
}

@Article{SelmanKautz96,
  author = 	 {B. Selman and H.A. Kautz},
  title = 	 {Knowledge compilation and theory approaximation},
  journal = 	 {Journal of the Association for Computing Machinery},
  year = 	 {1996},
  volume = 	 {43},
  pages = 	 {193--224}
}

@InProceedings{SelmanLevesque90,
  author = 	 {B. Selman and H. Levesque},
  title = 	 {Abductive and default reasoning: a computational core},
  booktitle = 	 {Proc. of the $8^{th}$ National Conference on
		  Artificial Intelligence (AAAI'90)},
  year = 	 {1990},
  address = 	 {Boston (MA)},
  pages = 	 {343--348}
}

@article{Senellart17,
  author    = {P. Senellart},
  title     = {Provenance and Probabilities in Relational Databases},
  journal   = {{SIGMOD} Record},
  volume    = {46},
  number    = {4},
  pages     = {5--15},
  year      = {2017},
}

@Article{Shannon1949,
  author  = {C.E. Shannon},
  title   = {The synthesis of two--terminal switching circuits},
  journal = {Bell System Technical Journal},
  year    = {1949},
  volume  = {28},
  number  = {1},
  pages   = {59--98},
}

@Article{Shannon48,
 author = {C.E. Shannon},
 title = {The synthesis of two--terminal switching circuits},
 journal = {Bell System Technical Journal},
 year = {1949},
 volume = {28},
 number = {1},
 pages = {59--98}
}

@Article{Shannon49,
  author = 	 {C.E. Shannon},
  title = 	 {The synthesis of two--terminal switching circuits},
  journal = 	 {Bell System Technical Journal},
  year = 	 {1949},
  volume = 	 {28},
  number = 	 {1},
  pages = 	 {59--98}
}

@inproceedings{DBLP:conf/nips/ShenCD16,
  author    = {Y. Shen and
               A. Choi and
               A. Darwiche},
  title     = {Tractable Operations for Arithmetic Circuits of Probabilistic Models},
  booktitle = {Advances in Neural Information Processing Systems 29: Annual Conference
               on Neural Information Processing Systems 2016, December 5-10, 2016,
               Barcelona, Spain},
  pages     = {3936--3944},
  year      = {2016},
}

@inproceedings{ShihCD18,
  author    = {A. Shih and
               A. Choi and
               A. Darwiche},
  title     = {A Symbolic Approach to Explaining Bayesian Network Classifiers},
  booktitle = {Proc. of IJCAI'18},
  pages     = {5103--5111},
  year      = {2018},
}

@InProceedings{Shoham87,
 author = {Y. Shoham},
 title = {A semantical approach to nonmonotonic logics},
 booktitle = {Proc. of the $2^{nd}$ IEEE Symposium on Logic in
 Computer Science (LICS'87)},
 year = {1987},
 address = {Washington (DC)},
 pages = {275--279}
}

@Article{Shostak1976,
  author  = {R. Shostak},
  title   = {Refutation graphs},
  journal = {Artificial Intelligence},
  year    = {1976},
  volume  = {7},
  pages   = {51--64},
}

@Article{Shostak1976a,
  author  = {R. Shostak},
  title   = {Refutation graphs},
  journal = {Artificial Intelligence},
  year    = {1976},
  volume  = {7},
  pages   = {51--64},
}

@Article{Shostak76,
  author = 	 {R. Shostak},
  title = 	 {Refutation graphs},
  journal = 	 {Artificial Intelligence},
  year = 	 {1976},
  volume = 	 {7},
  pages = 	 {51--64}
}

@PhdThesis{Siegel87,
  author = 	 {P. Siegel},
  title = 	 {Repr\'esentation et utilisation des connaissances en
		  calcul propositionnel},
  school = 	 {Universit\'e d'Aix--Marseille 2},
  year = 	 {1987},
  type = 	 {Th\`ese d'Etat},
  note = 	 {(in french)}
}

@InProceedings{SimondelVal01,
  author =       {L. Simon and A. del Val},
  title =        {Efficient Consequence Finding},
  booktitle =    {Proc. of IJCAI'01},
  pages =        {359-370},
  year =         {2001},
  OPTaddress =      {Seattle (WA)}
}

@inproceedings{Sipser83,
  author    = {M. Sipser},
  title     = {Borel sets and circuit complexity},
  booktitle = {Proc. of STOC'83},
  year      = {1983},
  pages     = {61-69}
}

@InProceedings{Siva2002a,
  author   = {S. Siva and R. Vemuri and W. Vanfleet and J. Franco and J. Schlipf},
  title    = {{Reconfigurable Interconnect Synthesis via Quantified Boolean Satisfiability}},
  pages    = {32-40},
  crossref = {Narizzano2002},
}

@Article{Slagle1967,
  author  = {J.R. Slagle},
  title   = {Automatic theorem proving with renamable and semantic resolution},
  journal = {Journal of the Association for Computing Machinery},
  year    = {1967},
  volume  = {12},
  pages   = {687--697},
}

@Article{Slagle1967a,
  author  = {J.R. Slagle},
  title   = {Automatic theorem proving with renamable and semantic resolution},
  journal = {Journal of the Association for Computing Machinery},
  year    = {1967},
  volume  = {12},
  pages   = {687--697},
}


@InProceedings{Slagle1969,
  author    = {J.R. Slagle and C.L. Chang and R.C.T. Lee},
  title     = {Completeness theorems for semantics resolution in consequence finding},
  booktitle = {Proc. of the $1^{st}$ International Joint Conference on Artificial Intelligence (IJCAI'69)},
  year      = {1969},
  pages     = {281--285},
  address   = {Washington (DC)},
}

@InProceedings{Slagle1969a,
  author    = {J.R. Slagle and C.L. Chang and R.C.T. Lee},
  title     = {Completeness theorems for semantics resolution in consequence finding},
  booktitle = {Proc. of the $1^{st}$ International Joint Conference on Artificial Intelligence (IJCAI'69)},
  year      = {1969},
  pages     = {281--285},
  address   = {Washington (DC)},
}

@Article{Slagle1970,
  author  = {J.R. Slagle and C.L. Chang and R.C.T. Lee},
  title   = {A new algorithm for generating prime implicants},
  journal = {IEEE Transactions on Computers},
  year    = {1970},
  volume  = {C-19},
  pages   = {304--310},
}

@Article{Slagle1970a,
  author  = {J.R. Slagle and C.L. Chang and R.C.T. Lee},
  title   = {A new algorithm for generating prime implicants},
  journal = {IEEE Transactions on Computers},
  year    = {1970},
  volume  = {C-19},
  pages   = {304--310},
}

@Article{Slagle67,
  author = 	 {J.R. Slagle},
  title = 	 {Automatic theorem proving with renamable and semantic resolution},
  journal = 	 {Journal of the Association for Computing Machinery},
  year = 	 {1967},
  volume = 	 {12},
  pages = 	 {687--697}
}

@InProceedings{Slagleetal69,
  author = 	 {J.R. Slagle and C.L. Chang and R.C.T. Lee},
  title = 	 {Completeness theorems for semantics resolution in
		  consequence finding},
  booktitle = 	 {Proc. of the $1^{st}$ International Joint Conference
		  on Artificial Intelligence (IJCAI'69)},
  year = 	 {1969},
  address = 	 {Washington (DC)},
  pages = 	 {281--285}
}

@Article{Slagleetal70,
  author = 	 {J.R. Slagle and C.L. Chang and R.C.T. Lee},
  title = 	 {A new algorithm for generating prime implicants},
  journal = 	 {IEEE Transactions on Computers},
  year = 	 {1970},
  volume = 	 {C-19},
  pages = 	 {304--310}
}

@InProceedings{SlaneyWalsh02,
  author = {J. Slaney and T. Walsh},
  title = {Phase transition behavior: from decision to optimization},
  booktitle = {Proc. of the $5^{th}$ International Symposium on
the Theory and Applications of Satisfiability Testing (SAT'02)},
  address = {Cincinnati (OH)},
  year = {2002}
}

@inproceedings{Srinivasanetal90,
  author    = {A. Srinivasan and
               T. Kam and
               S. Malik and
               R. K. Brayton},
  title     = {Algorithms for Discrete Function Manipulation},
  booktitle = {{IEEE/ACM} International Conference on Computer-Aided Design, {ICCAD}
               1990, Santa Clara, CA, USA, November 11-15, 1990. Digest of Technical
               Papers},
  pages     = {92--95},
  year      = {1990},
}

@InProceedings{Stillman92,
 author = {J. Stillman},
 title = {The complexity of propositional default logics},
 booktitle = {Proc. of the $10^{th}$ National Conference on
 Artificial Intelligence (AAAI'92)},
 year = {1992},
 address = {San Jose (CA)},
 pages = {794--799}
}

@InProceedings{Stockmeyer1973,
  author    = {L. J. Stockmeyer and A. R. Meyer},
  title     = {Word problems requiring exponential time},
  booktitle = {Proc. of the Fith Annual ACM Symposium on Theory of Computing},
  year      = {1973},
  pages     = {1--9},
}

@Article{Stockmeyer1977,
  author  = {L. J. Stockmeyer},
  title   = {The polynomial-time hierarchy},
  journal = {Theoretical Computer Science},
  year    = {1977},
  volume  = {3},
  pages   = {1--22},
}

@Article{Stockmeyer1977a,
  author  = {L. J. Stockmeyer},
  title   = {The polynomial-time hierarchy},
  journal = {Theoretical Computer Science},
  year    = {1977},
  volume  = {3},
  pages   = {1--22},
}

@InProceedings{Stockmeyer73,
  Author         = {L. J. Stockmeyer and A. R. Meyer},
  Title          = {Word problems requiring exponential time},
  BookTitle      = {Proc. of the Fith Annual ACM Symposium on
                   Theory of Computing},
  Pages          = {1--9},
  year           = 1973
}

@InProceedings{Stockmeyer77,
  author = 	 {L.J. Stockmeyer},
  title = 	 {The polynomial-time hierarchy},
  booktitle = 	 {Theoretical Computer Science},
  volume = 	 {3},
  year = 	 {1977},
  pages = 	 {1--22}
}

@InProceedings{Struss94,
  author = 	 {P. Struss},
  title = 	 {Testing for the discrimination of diagnoses},
  booktitle = 	 {Proc. of DX'94},
  year = 	 {1994},
  pages = 	 {312-320}
}

@Article{Strzemecki92,
  author = 	 {T. Strzemecki},
  title = 	 {Polynomial-time algorithm for generation of prime implicants},
  journal = 	 {Journal of Complexity},
  year = 	 {1992},
  volume = 	 {8},
  pages = 	 {37--63}
}

@inproceedings{Subbarayanetal07,
  author    = {S. Subbarayan and L. Bordeaux and Y. Hamadi},
  title     = {Knowledge Compilation Properties of Tree-of-{BDDs}},
  booktitle = {Proc. of AAAI'07},
  year      = {2007},
  pages = {502--507}
}

@Article{Swaminathan1995,
  author =   {R. P. Swaminathan and D. K. Wagner},
  title =    {The arborescence-realisation problem},
  journal =      {Discrete Applied Mathematics},
  year =     1995,
  volume =   59,
  pages =    {267--283}
}

@article{TafertshoferP97,
  author    = {P. Tafertshofer and
 M. Pedram},
  title     = {Factored Edge-Valued Binary Decision Diagrams},
  journal   = {Formal Methods in System Design},
  volume    = {10},
  number    = {2-3},
  year      = {1997},
 OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@Article{Tarjan1972,
  author  = {R.E. Tarjan},
  title   = {Depth first search and linear graph algorithms},
  journal = {SIAM Journal on Computing},
  year    = {1972},
  volume  = {1},
  pages   = {146--160},
}

@Article{Tarjan72,
  author =       {R.E. Tarjan},
  title =        {Depth first search and linear graph algorithms},
  journal =      {SIAM Journal on Computing},
  year =         {1972},
  volume = {1},
  pages = {146--160}
}

@InProceedings{Thiebauxetal00,
 author = {S. Thi\'ebaux and J. Slaney and P. Kilby},
 title = {Estimating the Hardness of Optimisation},
 booktitle = {Proc. of the $14^{th}$ European Conference on Artificial Intelligence (ECAI'00)},
 pages = {123--127},
 address = {Berlin},
 year = {2000}
}


@Article{Tison1967,
  author  = {P. Tison},
  title   = {Generalization of consensus theory and application to the minimization of {B}oolean functions},
  journal = {IEEE Transactions on Electronic Computers},
  year    = {1967},
  volume  = {EC--16},
  pages   = {446--456},
}

@Article{Tison1967a,
  author  = {P. Tison},
  title   = {Generalization of consensus theory and application to the minimization of boolean functions},
  journal = {IEEE Transactions on Electronic Computers},
  year    = {1967},
  volume  = {EC--16},
  pages   = {446--456},
}

@Article{Tison67,
  author = 	 {P. Tison},
  title = 	 {Generalization of consensus theory and application
		  to the minimization of boolean functions},
  journal = 	 {IEEE Transactions on Electronic Computers},
  year = 	 {1967},
  volume = 	 {EC--16},
  pages = 	 {446--456}
}

@article{Toran91,
  author    = {J. Tor\'an},
  title     = {Complexity classes defined by counting quantifiers},
  journal   = {Journal of the ACM},
  volume    = {38},
  year      = {1991},
  pages     = {752-773}
}

@inproceedings{TorassoTorta06,
  author    = {P. Torasso and
               G. Torta},
  title     = {Model-Based Diagnosis Through {OBDD} Compilation: A Complexity
               Analysis},
  booktitle = {Reasoning, Action and Interaction in AI Theories and Systems},
  year      = {2006},
  pages     = {287-305},
  OPTee        = {http://dx.doi.org/10.1007/11829263_16},
  OPTcrossref  = {DBLP:conf/birthday/2006aiello},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@Article{Truemper1982,
  author =       {K. Truemper},
  title =        {{Alpha-balanced graphs and matrices and GF (3)-representability of matroids}},
  journal =      {Journal of Combinatorial Theory},
  year =         1982,
  volume =       {B 32},
  pages =        {112--139}
}

@InBook{Tseitin1968,
  chapter   = {Structures in Constructive Mathematics and Mathematical Logic},
  pages     = {115-125},
  title     = {On the complexity of derivation in propositional calculus},
  publisher = {Steklov Mathematical Institute},
  year      = {1968},
  author    = {G.S. Tseitin},
  notes     = {translated from Russian},
}

@article{greedyweakly,
  title={Greedy minimization of weakly supermodular set functions},
  author={Boutsidis, Christos and Liberty, Edo and Sviridenko, Maxim},
  journal={arXiv preprint arXiv:1502.06528},
  year={2015}
}

@TechReport{TsiknisKean88,
  author = 	 {G. Tsiknis and A. Kean},
  title = 	 {Clause management systems (CMS)},
  institution =  {The University of British Columbia -- Department of
		  Computer Science},
  year = 	 {1988},
  type = 	 {technical report},
  number = 	 {88-21}
}

@InProceedings{UribeStickel94,
 author = {T.E. Uribe and M.E. Stickel},
 title = {Ordered binary decision diagrams and the
 Davis-Putnam procedure},
 booktitle = {Proc. of the $1^{st}$ International Conference on
 Constraints in Computational Logic (CCL'94)},
 year = {1994}
}

@Article{Valiant1979,
  author       = {L. G. Valiant},
  title        = {The Complexity of Computing the Permanent},
  journal      = {Theoretical Computer Science},
  year         = {1979},
  volume       = {8},
  pages        = {189-201},
  optbibsource = {DBLP, http://dblp.uni-trier.de},
  optee        = {http://dx.doi.org/10.1016/0304-3975(79)90044-6},
}

@article{Valiant79,
  author    = {L. G. Valiant},
  title     = {The Complexity of Computing the Permanent},
  journal   = {Theoretical Computer Science},
  volume    = {8},
  year      = {1979},
  pages     = {189-201},
  OPTee        = {http://dx.doi.org/10.1016/0304-3975(79)90044-6},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@InProceedings{Vanhenteryck91,
 author = {P. {Van~Henteryck} and Y. Deville},
 title = {The cardinality operator: A new logical connective for constraint logic programming},
 booktitle = {Proc. of ICLP'91},
 year = {1991},
 address = {Paris, France},
 pages = {745--749}
}

@InProceedings{Velev2004a,
  author   = {M. N. Velev},
  title    = {{Encoding Global Unobservability for Efficient Translation to SAT}},
  pages    = {197-204},
  crossref = {Giunchiglia2004d},
}

@inproceedings{Vempaty92,
  author    = {N. R. Vempaty},
  title     = {Solving Constraint Satisfaction Problems Using Finite State Automata},
  booktitle = {Proceedings of the 10th National Conference on Artificial Intelligence,
               San Jose, CA, USA, July 12-16, 1992.},
  pages     = {453--458},
  year      = {1992},
}

@PHDTHESIS{Voronov13,
  title = {On Formal Methods for Large-Scale Product Configuration},
  author = {A. Voronov},
  year = {2013},
  school = {Chalmers University},
  type = {Ph.D. thesis},
  OPTtopics = {team}
}

@inproceedings{WachterHaenni06,
  author    = {M. Wachter and R. Haenni},
  title     = {Propositional {DAGs}: A New Graph-Based Language for Representing {B}oolean Functions},
  booktitle = {Proc. of KR'06},
  year      = {2006},
  pages = {277--285}
}

@InProceedings{Wagner1998,
  author =   {H. Wagner},
  title =    {A new resolution calculus for the infinite-valued propositional logic of Lukasiewicz},
  booktitle =    {International Workshop on First order Theorem Proving},
  pages =    {234-243},
  year =     1998,
  address =  {Schloss Wilhelminenberg, Vienna, Austria},
  month =    {November 23 - 25}
}



@article{Wagner86,
  author    = {K.W. Wagner},
  title     = {The complexity of combinatorial problems with succinct input representation},
  journal   = {Acta Informatica},
  volume    = {23},
  year      = {1986},
  pages     = {325-356}
}

@Proceedings{Wallace2004,
  title     = {Principles and Practice of Constraint Programming - CP 2004, 10th International Conference, CP 2004, Toronto, Canada, September 27- October 1, 2004, Proc.},
  year      = {2004},
  editor    = {Mark Wallace},
  volume    = {3258},
  series    = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn      = {3-540-23241-9},
  booktitle = {CP},
}

@InProceedings{Walsh2002,
  author = {T. Walsh},
  title  = {{The Interface between P and NP: COL, XOR, NAE, 1-in-k , and Horn SAT}},
  year   = {2002},
}

@Article{Warners1998,
  author  = {J. P. Warners},
  title   = {A linear-time transformation of linear inequalities into conjunctive normal form},
  journal = {Information Processing Letters},
  year    = {1998},
  volume  = {68},
  number  = {2},
  pages   = {63-69},
}

@InProceedings{Williams2002,
  author =   {R. Williams},
  title =    {Algorithms for quantified boolean formulas},
  booktitle = {Proc. of the thirteenth annual ACM-SIAM symposium on Discrete algorithms},
  year = {2002},
  isbn = {0-89871-513-X},
  pages = {299--307},
  location = {San Francisco, California},
  doi = {http://doi.acm.org/10.1145/545381.545421},
  url = {http://www.people.cornell.edu/pages/rrw9/qbf2.pdf},
  publisher = {ACM Press}
}

@InProceedings{Williams2002a,
  author    = {R. Williams},
  title     = {Algorithms for quantified {B}oolean formulas},
  booktitle = {Proc. of the thirteenth annual ACM-SIAM symposium on Discrete algorithms},
  year      = {2002},
  pages     = {299--307},
  publisher = {ACM Press},
  doi       = {http://doi.acm.org/10.1145/545381.545421},
  isbn      = {0-89871-513-X},
  location  = {San Francisco, California},
  url       = {http://www.people.cornell.edu/pages/rrw9/qbf2.pdf},
}

@InProceedings{Williams2003,
  author =   {R. Williams and C. Gomes and B. Selman},
  title =    {{Backdoors To Typical Case Complexity}},
  booktitle =    ijcai03,
  pages =    {1173-1178},
  year =     2003,
  editor =   {Georg Gottlob and Toby Walsh},
  address =  {Acaplco, Mexico},
  publisher =    {Morgan Kaufmann}
}

 @inproceedings{Wilson05,
  author    = {N. Wilson},
  title     = {Decision Diagrams for the Computation of Semiring Valuations},
  booktitle = {Proc. of IJCAI'05},
  year      = {2005},
  pages     = {331-336},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@Article{Wos1967,
  author  = {L. Wos and G.A. Robinson and D.F. Carson},
  title   = {Efficiency and completeness of the set of support strategy in theorem proving},
  journal = {Journal of the Association for Computing Machinery},
  year    = {1967},
  volume  = {12},
  pages   = {536--541},
}

@Article{Wos1967a,
  author  = {L. Wos and G.A. Robinson and D.F. Carson},
  title   = {Efficiency and completeness of the set of support strategy in theorem proving},
  journal = {Journal of the Association for Computing Machinery},
  year    = {1967},
  volume  = {12},
  pages   = {536--541},
}

@Article{Wosetal67,
  author = 	 {L. Wos and G.A. Robinson and D.F. Carson},
  title = 	 {Efficiency and completeness of the set of support strategy in theorem proving},
  journal = 	 {Journal of the Association for Computing Machinery},
  year = 	 {1967},
  volume = 	 {12},
  pages = 	 {536--541}
}

@inproceedings{Xueetal12,
  author    = {Y. Xue and
               A. Choi and
               A. Darwiche},
  title     = {Basing Decisions on Sentences in Decision Diagrams},
  booktitle = {Proceedings of the Twenty-Sixth {AAAI} Conference on Artificial Intelligence,
               July 22-26, 2012, Toronto, Ontario, Canada.},
  year      = {2012},
}

@Article{YahyaHenschen85,
  author = 	 {A. Yahya and L.J. Henschen},
  title = 	 {Deduction in non-{H}orn databases},
  journal = 	 {Journal of Automated Reasoning},
  year = 	 {1985},
  volume = 	 {1},
  pages = 	 {141--160}
}

@InProceedings{Yamasaki1983,
  author =   {S. Yamasaki and S. Doshita},
  title =    {The satisfiability problem for a class consisting of {H}orn sentences and some non-{H}orn sentences in proportional logic},
  booktitle =    {Information and Control},
  pages =    {1--12},
  year =     1983,
  volume =   59
}


@article{Yap83,
title = {Some consequences of non-uniform conditions on uniform classes},
year = {1983},
author = {C.K. Yap},
journal = {Theoretical Computer Science},
pages = {287-300},
volume = {26},
}


@InProceedings{Zabih1988,
  author =   {R. Zabih and D. A. McAllester},
  title =    {{A Rearrangement Search Strategy for Determining Propositional Satisfiability}},
  booktitle =    aaai88,
  pages =    {155-160},
  year =     1988,
  month =    {August 21-26}
}

@article{ZantemaBodlaender02,
  author    = {Hans Zantema and
               Hans L. Bodlaender},
  title     = {Sizes of Ordered Decision Trees},
  journal   = {Int. J. Found. Comput. Sci.},
  volume    = {13},
  number    = {3},
  year      = {2002},
  pages     = {445-458},
  OPTee        = {http://dx.doi.org/10.1142/S0129054102001205},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@InProceedings{Zanuttini02,
  author =   {B. Zanuttini},
  title =    {Approximating Propositional Knowledge with Affine Formulas},
  booktitle =    {Proc.< of ECAI'02},
  pages =    {287--291},
  year =     2002,
}

@article{Zanuttini03,
  author    = {B. Zanuttini},
  title     = {New Polynomial Classes for Logic-Based Abduction},
  journal   = {Journal of Artificial Intelligence Research},
  volume    = {19},
  year      = {2003},
  pages     = {1-10},
  OPTee        = {http://dx.doi.org/10.1613/jair.1170},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@MastersThesis{Zanuttini2000,
  author =   {B. Zanuttini},
  title =    {Identification et Formules Ordonn\'ees},
  school =   {Universit\'e de Caen},
  year =     2000,
  month =    {Septembre}
}

@InProceedings{Zhang2002,
  author    = {L. Zhang and S. Malik},
  title     = {Towards a symetric treatment of satisfaction and conflicts in quantified {B}oolean formula evaluation},
  booktitle = cp02,
  year      = {2002},
  pages     = {200--215},
  address   = {Ithaca, NY, USA},
  month     = {Sept.},
  url       = {http://ee.princeton.edu/\~{}chaff/publication/cp_2002.pdf},
}

@InProceedings{Zhang2002b,
  author =       {L. Zhang and S. Malik},
  title =        {{Conflict Driven Learning in a Quantified Boolean Satisfiability Solver}},
  booktitle =    {Proc. of International Conference on Computer Aided Design},
  year =         2002,
  address =      {San Jose, CA, USA},
  month =        {Nov.}
}

@Misc{Zhang2002d,
  author = {L. Zhang and S. Malik},
  title  = {Quaffle},
  year   = {2002},
  note   = {\\http://ee.princeton.edu/\~{}chaff/Quaffle.php},
}

@InProceedings{ZhangMalik2002a,
  author =   {L. Zhang and S. Malik},
  title =    {Towards a Symmetric Treatment of Satisfaction and Conflicts
                  in Quantified Boolean Formula Evaluation},
  booktitle =    cp02,
  pages =    {200-215},
  year =     {2002}
}

@inproceedings{bahar93,
    author = {R.I. Bahar and E.A. Frohm and C.M. Gaona and G.D. Hachtel and E. Macii and A. Pardo and F. Somenzi},
    title = "{A}lgebraic {D}ecision {D}iagrams and their applications",
    booktitle = "Proc. of ICAD'93",
    pages = "188--191",
    year = "1993",
    OPTurl = "citeseer.ist.psu.edu/bahar93algebraic.html" }

@inproceedings{biere2012,
  author    = {M. J{\"a}rvisalo and
               M. Heule and
               A. Biere},
  title     = {Inprocessing Rules},
  booktitle = {Proc. of IJCAR'12},
  year      = {2012},
  pages     = {355-370},
  OPTee        = {http://dx.doi.org/10.1007/978-3-642-31365-3_28},
  OPTcrossref  = {DBLP:conf/cade/2012},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{chaff,
 author = {Moskewicz, M.W. and Madigan, C.F. and Zhao, Y. and Zhang, L. and Malik, S.},
 title = {Chaff: engineering an efficient {SAT} solver},
 booktitle = {Proc. of DAC'01},
 OPTseries = {DAC '01},
 year = {2001},
 OPTlocation = {Las Vegas, Nevada, USA},
 pages = {530--535},
 OPTnumpages = {6},
 OPTpublisher = {ACM},
 OPTaddress = {New York, NY, USA},
 OPTkeywords = {boolean satisfiability, design verification},
}

@inproceedings{chen05,
title = {Parameterized Compilability},
year = {2005},
author = {H. Chen},
booktitle = {Proc. of IJCAI'05},
pages = {412-417},
}

@article{chen2007,
  author    = {J. Chen},
  title     = {{XORSAT}: An Efficient Algorithm for the DIMACS 32-bit Parity
               Problem},
  journal   = {CoRR},
  volume    = {abs/cs/0703006},
  year      = {2007},
}

@inproceedings{cryptoMiniSAT,
  author    = {M. Soos and
               K. Nohl and
               C. Castelluccia},
  title     = {Extending {SAT} Solvers to Cryptographic Problems},
  booktitle = {Proc. of SAT'09},
  year      = {2009},
  pages     = {244-257},
  OPTee        = {http://dx.doi.org/10.1007/978-3-642-02777-2_24},
  OPTcrossref  = {DBLP:conf/sat/2009},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}

@InProceedings{delVal00,
  author =       {A. del Val},
  title =        {The complexity of restricted consequence finding and abduction},
  booktitle =    {Proc. of AAAI'00},
  year =         {2000},
  address =      {Austin (TX)},
  pages =        {259--264}
}

@Article{delVal05,
 author = {A. del Val},
 title = {First order {LUB} approximations: characterization and algorithms},
 journal = {Artificial Intelligence},
 year = {2005},
 volume = {162},
number = {1-2},
 pages = {7-48}
}

@InProceedings{delVal2000,
  author      = {A. {del Val}},
  title       = {On 2-SAT and Renamable {H}orn},
  booktitle   = {Proc. of AAAI'00},
  year        = {2000},
  pages       = {279--284},
  optcrossref = {AAAI00},
}

@InProceedings{delVal96,
  author =       {A. del Val},
  title =        {Approximate Knowledge Compilation: The First Order Case},
  booktitle =    {Proc. of AAAI'96},
  year =         {1996},
  pages =        {498-503}
}

@InProceedings{delVal99,
  author =       {A. del Val},
  title =        {A new method for consequence finding and compilation in restricted languages},
  booktitle =    {Proc. of AAAI'99},
  year =         {1999},
  OPTaddress =      {Orlando (FL)},
  pages =        {259--264}
}

 @incollection{minisat,
 year={2003},
 OPTisbn={978-3-540-20851-8},
 booktitle={Proc. of SAT'03},
 OPTvolume={2919},
 OPTseries={Lecture Notes in Computer Science},
 OPTeditor={Giunchiglia, Enrico and Tacchella, Armando},
 title={An Extensible {SAT}-solver},
 OPTpublisher={Springer Berlin Heidelberg},
 author={E\'{e}n, N. and S\"{o}rensson, N.},
 pages={502-518}
}

@TECHREPORT{parity,
    author = {J.M. Crawford and M.J. Kearns},
    title = {The Minimal Disagreement Parity Problem as a Hard Satisfiability Problem},
    institution = {},
    year = {1995}
}

@InBook{patoh,
  author    = {Umit V. Cataly{\"{u}}rek and
               Cevdet Aykanat},
  title     = {{PaToH} (Partitioning Tool for Hypergraphs)},
  series = {Encyclopedia of Parallel Computing},
  pages     = {1479--1487},
  year      = {2011},
}

@InProceedings{piette2008,
title = {Vivifying propositional clausal formulae},
booktitle = {Proc. of ECAI'08},
pages = {525-529},
author = {Piette, C. and Hamadi, Y. and Sa\"is, L.},
year = {2008},
OPTmonth = {jul},
OPTaddress = {Patras (Greece)},
}

@inproceedings{trivium,
  author    = {Ch. De Canni{\`e}re},
  title     = {Trivium: A Stream Cipher Construction Inspired by Block
               Cipher Design Principles},
  booktitle = {Proc. of ISC'06},
  year      = {2006},
  pages     = {171-186},
  OPTee        = {http://dx.doi.org/10.1007/11836810_13},
  OPTcrossref  = {DBLP:conf/isw/2006},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}


@Comment{jabref-meta: databaseType:bibtex;}

@Comment{jabref-meta: saveOrderConfig:specified;abstract;false;abstract;false;abstract;false;}