A Theory of Average-Case Compilability in Knowledge Representation
Abstract
Compilability is a fundamental property of knowledge representation formalisms which captures \nhow succinctly information can be expressed. Although many results concerning compilability have \nbeen obtained, they are all "worst-case" results. \nWe develop a theory of average-case compilability \nwhich allows for the formal comparison and classification of knowledge representation formalisms \n"on average."
Cite
Text
Chen. "A Theory of Average-Case Compilability in Knowledge Representation." International Joint Conference on Artificial Intelligence, 2003.Markdown
[Chen. "A Theory of Average-Case Compilability in Knowledge Representation." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/chen2003ijcai-theory/)BibTeX
@inproceedings{chen2003ijcai-theory,
title = {{A Theory of Average-Case Compilability in Knowledge Representation}},
author = {Chen, Hubie},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2003},
pages = {455-460},
url = {https://mlanthology.org/ijcai/2003/chen2003ijcai-theory/}
}