BIROn - Birkbeck Institutional Research Online

    A theory of average-case compilability in knowledge representation

    Chen, Hubie (2003) A theory of average-case compilability in knowledge representation. In: Gottlob, G. and Walsh, T. (eds.) IJCAI-03: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Morgan Kaufmann, pp. 455-460.

    Full text not available from this repository.


    Compilability is a fundamental property of knowledge representation formalisms which captures how succinctly information can be expressed. Although many results concerning compilability have been obtained, they are all "worst-case" results. We develop a theory of average-case compilability which allows for the formal comparison and classification of knowledge representation formalisms "on average."


    Item Type: Book Section
    School: Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
    Depositing User: Sarah Hall
    Date Deposited: 09 Mar 2021 17:11
    Last Modified: 09 Aug 2023 12:50


    Activity Overview
    6 month trend
    6 month trend

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item