Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

33

IJCAI
2003

favoriteEmaildiscussreport

102views Artificial Intelligence» more IJCAI 2003»

A Theory of Average-Case Compilability in Knowledge Representation

14 years 7 days ago

A Theory of Average-Case Compilability in Knowledge Representation

Download ijcai.org

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."

Hubie Chen

Real-time Traffic

Average-case Compilability | Fundamental Property | IJCAI 2003 | IJCAI 2007 | Knowledge Representation Formalisms |

claim paper

Related Content

» Knowledge compilation meets database theory compiling queries to decision diagrams

» Knowledge Base Reformation Preparing FirstOrder Theories for Efficient Propositional Reaso...

» Compiling Reasoning with and about Preferences into Default Logic

» plp A Generic Compiler for Ordered Logic Programs

» A Critique of the Valiant Model

» A provably sound TAL for backend optimization

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2003
Where	IJCAI
Authors	Hubie Chen

Comments (0)