How can a computer store what it knows and use that knowledge to draw new conclusions? This question has been central to artificial intelligence from the start, but the answers have changed repeatedly. The challenge is not just about storing facts—it is about designing representations that let a machine reason efficiently, handle incomplete or uncertain information, and scale to real-world domains. Over six decades, researchers have built and rebuilt frameworks for knowledge representation, each responding to the limitations of its predecessors while preserving some of their insights.
The earliest and most enduring framework, Logic-Based Knowledge Representation (1958–Present), treats knowledge as a set of sentences in a formal logical language—typically first-order predicate logic—and reasoning as the application of sound inference rules. This approach, championed by John McCarthy and others, made a radical claim: intelligence could be achieved by writing down what is true about the world and then mechanically deriving consequences. The framework's distinctive contribution was its insistence on clear, unambiguous semantics: every logical sentence has a precise meaning, and every inference step is justified by the rules of logic. This commitment to formality distinguished it from earlier, less rigorous attempts at machine reasoning. Logic-based representation remains active today, especially in areas where correctness and verifiability matter, such as formal verification of software and mathematical theorem proving. However, its reliance on monotonic reasoning—where adding new information never retracts old conclusions—soon proved too rigid for domains where knowledge is incomplete or subject to change.
Dissatisfaction with the fragmentation and formality of pure logic led to two graph-inspired frameworks. Semantic Networks (1968–1990) represented knowledge as a graph of nodes (concepts) connected by labeled edges (relations). This structure was intuitive and supported efficient retrieval—for example, answering "What is a canary?" by following links from "canary" to "bird" to "animal." But semantic networks lacked a formal semantics: the meaning of a link depended on the programmer's interpretation, making it hard to guarantee correct reasoning. The framework declined as researchers recognized that intuitive diagrams do not automatically yield reliable inference.
Frame-Based Representation (1974–1995), introduced by Marvin Minsky, bundled knowledge into stereotypical structures called frames. A frame for "bird" might include slots for "color," "diet," and "can fly," each with default values. This design reacted against both the fragmentation of logic (which scattered related facts across many sentences) and the informality of semantic networks. Frames influenced object-oriented programming and expert systems, but they suffered from the same semantic ambiguity as semantic networks: defaults could conflict, and there was no agreed-upon way to resolve contradictions. By the mid-1990s, both semantic networks and frame-based representation had largely been absorbed into more formal frameworks, particularly description logics.
A different response to logic's limitations came from Logic Programming (1974–Present), which turned logical inference into an executable process. In Prolog, the programmer writes facts and rules in a restricted subset of first-order logic, and the system's built-in inference engine (backward chaining with unification) computes answers by searching for proofs. This framework merged knowledge representation with control: the same logical statements served as both the knowledge base and the program. Logic programming remains active in areas like natural language processing, constraint solving, and bioinformatics, where its declarative style simplifies complex reasoning tasks. It coexists with logic-based representation, but narrows the expressiveness of full first-order logic to achieve efficient, automated deduction.
Rule-Based Knowledge Systems (1976–1995) took a more pragmatic approach. Instead of general logical inference, they used collections of IF-THEN rules, often with certainty factors or other ad hoc mechanisms for handling uncertainty. The MYCIN medical diagnosis system exemplified this framework: its rules encoded expert knowledge directly, and the system could explain its reasoning by tracing which rules fired. Rule-based systems were widely deployed in industry, but they lacked formal semantics and became difficult to maintain as rule sets grew. By the mid-1990s, they were largely replaced by more structured approaches, though the rule-based style survives in business rule engines and some expert system shells.
A major limitation of classical logic is monotonicity: once a conclusion is drawn, it cannot be withdrawn even if new information contradicts it. Nonmonotonic Reasoning (1980–Present) addressed this by developing logics that allow conclusions to be retracted when new evidence arrives. Default logic, circumscription, and autoepistemic logic each offered different mechanisms for representing "typically true" statements—for example, "birds typically fly"—while allowing exceptions. This framework transformed the field by showing that formal reasoning could accommodate incomplete information without abandoning logical rigor. Nonmonotonic reasoning remains active in knowledge representation theory, providing the foundation for reasoning about action and change, belief revision, and commonsense reasoning.
At roughly the same time, Probabilistic Knowledge Representation (1988–Present) took a different route: instead of modifying logic, it replaced logical certainty with probability. Bayesian networks and related graphical models represent knowledge as a set of variables and their probabilistic dependencies, enabling reasoning under uncertainty through efficient algorithms for computing posterior probabilities. This framework absorbed insights from earlier work on uncertainty in expert systems but gave them a solid mathematical foundation. Today, probabilistic knowledge representation is a leading framework for applications involving noisy data, sensor fusion, and decision making under uncertainty. It coexists with nonmonotonic reasoning, each addressing different aspects of incomplete knowledge: nonmonotonic logic handles qualitative defaults, while probabilistic methods handle quantitative uncertainty.
Description Logics (1985–Present) emerged from efforts to give semantic networks and frame-based systems a formal logical foundation. The KL-ONE system was a landmark: it defined a family of logics that could represent concepts, roles, and individuals, with decidable reasoning procedures for classification and subsumption. Description logics preserved the intuitive structure of frames—concepts organized in a hierarchy with properties—but added precise semantics and tractable inference. This framework became the backbone of the Semantic Web (via the OWL language) and remains a leading approach for representing structured knowledge in domains like biomedicine, where large ontologies require automated consistency checking and classification.
Ontologies (1993–Present) extended the idea of formal concept hierarchies to the problem of knowledge sharing and reuse. An ontology is a shared specification of a conceptualization: a set of terms, their definitions, and the relationships between them, typically expressed in a description logic or a related formalism. The Ontolingua and later OWL standards enabled communities to build and align ontologies for domains ranging from genetics to e-commerce. Ontologies are not a replacement for earlier frameworks but rather an infrastructure layer that builds on description logics and logic-based representation. They provide the vocabulary that other systems can use, making knowledge portable across applications.
Today, six frameworks remain active: Logic-Based Knowledge Representation, Logic Programming, Nonmonotonic Reasoning, Description Logics, Probabilistic Knowledge Representation, and Ontologies. They agree on several core principles: knowledge should be represented explicitly and symbolically; reasoning should be based on formal, well-defined semantics; and different domains may require different representational choices. They disagree, however, on the right balance between expressiveness and tractability. Logic-based representation and nonmonotonic reasoning prioritize expressive power, even if inference is computationally hard. Description logics and probabilistic graphical models deliberately restrict expressiveness to achieve efficient, scalable reasoning. Ontologies and logic programming sit in between, offering practical compromises. Another major disagreement concerns how to handle uncertainty: nonmonotonic logics treat it as a matter of default assumptions, while probabilistic approaches treat it as a matter of degree. These are not competing for a single throne; they are specialized tools for different aspects of the knowledge representation problem.
In practice, the active frameworks divide the work of knowledge representation. Description logics and ontologies dominate the Semantic Web and biomedical informatics, where large, shared concept hierarchies need automated classification. Probabilistic knowledge representation leads in robotics, sensor networks, and any domain where data is noisy. Logic programming remains strong in natural language processing and constraint solving, where its search-based inference is a natural fit. Nonmonotonic reasoning provides the theoretical foundation for reasoning about action and change in AI planning and commonsense reasoning. Logic-based representation continues in formal verification and theorem proving, where correctness is paramount. These frameworks often complement each other: an ontology might use description logic for its terminological component while relying on probabilistic methods for uncertain data, or a logic program might incorporate nonmonotonic rules for default reasoning. The history of knowledge representation is not a story of one framework replacing all others, but of a growing toolkit, each piece designed for a specific kind of representational challenge.