1995 · 122 citations · 22 references
ComputingComputer ScienceComputational LinguisticsKnowledge RepresentationLogicKnowledge Base DesignPredicate LogicConjunctive Normal FormDefault LogicDisjunctive Normal FormKnowledge Representation ModelingNormal FormsPropositional Knowledge Representation
We develop a methodology for comparing knowledge representation formalisms in terms of their "representational succinctness," that is, their ability to express knowledge situations relatively efficiently. We use this framework for comparing many important formalisms for knowledge base representation: propositional logic, default logic, circumscription, and model preference defaults; and, at a lower level, Horn formulas, characteristic models, decision trees, disjunctive normal form, and conjunctive normal form. We also show that adding new variables improves the effective expressibility of certain knowledge representation formalisms. 1 Introduction Many important knowledge representation formalisms have been proposed, used, and studied during the past fifteen years, including various forms of propositional logic, nonmonotonic formalisms, decision trees, and so on. There is now a host of methods available for representing complex knowledge, and for reasoning about it. An interesting qu...
22
The complexity of theorem-proving procedures
Stephen Cook · 1971 · 6.2K citations · Full text
Raymond Reiter · Artificial Intelligence · 1980 · 3.9K citations
Circumscription—A form of non-monotonic reasoning
John McCarthy · Artificial Intelligence · 1980 · 2K citations
Almost optimal lower bounds for small depth circuits
Johan Håstad · 1986 · 630 citations