Document Open Access Logo

Parameter Compilation

Author Hubie Chen

Thumbnail PDF


  • Filesize: 417 kB
  • 11 pages

Document Identifiers

Author Details

Hubie Chen

Cite AsGet BibTex

Hubie Chen. Parameter Compilation. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 127-137, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)


In resolving instances of a computational problem, if multiple instances of interest share a feature in common,it may be fruitful to compile this feature into a format that allows for more efficient resolution, even if the compilation is relatively expensive. In this article, we introduce a formal framework for classifying problems according to their compilability. The basic object in our framework is that of a parameterized problem, which here is a language along with a parameterization—a map which provides, for each instance, a so-called parameter on which compilation may be performed. Our framework is positioned within the paradigm of parameterized complexity, and our notions are relatable to established concepts in the theory of parameterized complexity. Indeed, we view our framework as playing a unifying role, integrating together parameterized complexity and compilability theory.
  • compilation
  • parameterized complexity


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Simone Bova, Florent Capelli, Stefan Mengel, and Friedrich Slivovsky. Expander cnfs have exponential DNNF size. CoRR, abs/1411.1995, 2014. Google Scholar
  2. Marco Cadoli, Francesco M. Donini, Paolo Liberatore, and Marco Schaerf. Preprocessing of intractable problems. Information and Computation, 176(2):89-120, 2002. Google Scholar
  3. Hubie Chen. A theory of average-case compilability in knowledge representation. In IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, Acapulco, Mexico, August 9-15, 2003, pages 455-460, 2003. Google Scholar
  4. Hubie Chen. Parameterized compilability. In IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30-August 5, 2005, pages 412-417, 2005. Google Scholar
  5. Hubie Chen. On the complexity of existential positive queries. ACM Trans. Comput. Log., 15(1), 2014. Google Scholar
  6. Adnan Darwiche and Pierre Marquis. A knowledge compilation map. J. Artif. Intell. Res. (JAIR), 17:229-264, 2002. Google Scholar
  7. Wenfei Fan, Floris Geerts, and Frank Neven. Making queries tractable on big data with preprocessing. PVLDB, 6(9):685-696, 2013. Google Scholar
  8. J. Flum and M. Grohe. Parameterized Complexity Theory. Springer, 2006. Google Scholar
  9. Goran Gogic, Henry A. Kautz, Christos H. Papadimitriou, and Bart Selman. The comparative linguistics of knowledge representation. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI 95, Montréal Québec, Canada, pages 862-869, 1995. Google Scholar
  10. Paolo Liberatore. The size of MDP factored policies. In 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 267-272, 2002. Google Scholar
  11. Paolo Liberatore and Marco Schaerf. Compilability of propositional abduction. ACM Trans. Comput. Log., 8(1), 2007. Google Scholar
  12. Chee-Keng Yap. Some consequences of non-uniform conditions on uniform classes. Theor. Comput. Sci., 26:287-300, 1983. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail