{"type":"ScholarlyArticle","title":"Parameterized Compilability","authors":[{"name":"Hubie Chen","slug":"hubie-chen","given":"Hubie","family":"Chen","affiliation":""}],"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 compilability 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.","doi":null,"url":"https://ijcai.org/proceedings/2005/58","pdf":"https://ijcai.org/proceedings/2005/0058.pdf","markdown":"https://ijcai.org/proceedings/2005/58.md","bibtex":"https://ijcai.org/proceedings/2005/bibtex/58","volume":{"slug":"2005","title":"Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2005","url":"https://ijcai.org/proceedings/2005/","year":2005,"location":"Edinburgh, Scotland, UK","dates":"","editors":"","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":58,"pages":{"first":412,"last":416},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}