Parameterized Compilability
Abstract
Compilability is a measure of how effectively compilation (or preprocessing) can be applied to knowledge bases specified in a particular knowledge representation formalism; the aim of compilation is to allow for efficient, on-line query processing. A theory of has been established for organizing knowledge representation formalisms according to a scheme of compilability classes, and bears strong analogies to the classical theory of complexity, which permits the organization of computational problems according to complexity classes. We develop a novel theory of compilability, called parameterized compilability, which incorporates the notion of parameterization as used in parameterized complexity and permits for refined analysis of compilability.
Cite
Text
Chen. "Parameterized Compilability." International Joint Conference on Artificial Intelligence, 2005.Markdown
[Chen. "Parameterized Compilability." International Joint Conference on Artificial Intelligence, 2005.](https://mlanthology.org/ijcai/2005/chen2005ijcai-parameterized/)BibTeX
@inproceedings{chen2005ijcai-parameterized,
title = {{Parameterized Compilability}},
author = {Chen, Hubie},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2005},
pages = {412-417},
url = {https://mlanthology.org/ijcai/2005/chen2005ijcai-parameterized/}
}