{
  "id": "knowledge-representation-and-reasoning",
  "title": "Knowledge Representation and Reasoning",
  "lang": "en",
  "source_lang": "en",
  "summary": "The study of how computational systems encode knowledge and use it to derive conclusions, explain observations, and guide action.",
  "category": "computer-science",
  "subcategory": "artificial-intelligence",
  "type": "concept",
  "aliases": [
    "KRR",
    "KR&R",
    "KR²",
    "knowledge representation and inference"
  ],
  "generated_at": "2026-10-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/knowledge-representation-and-reasoning/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/knowledge-representation-and-reasoning/",
      "json": "https://aiwiki.page/zh/knowledge-representation-and-reasoning.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "Knowledge representation and reasoning is a field of artificial intelligence concerned with expressing information about the world in computationally usable forms and developing methods for drawing conclusions from it. Representation determines what a system can describe and what its descriptions mean; reasoning determines how those descriptions support answers, explanations, and decisions. The field encompasses logical, structured, probabilistic, and hybrid approaches, rather than a single language or reasoning technique. Its central problem is to connect meaningful descriptions of a domain with effective computation. (cs.ubc.ca)"
    },
    {
      "heading": "Foundations",
      "text": "A representation is not simply a collection of stored facts. It provides conventions for describing entities, properties, relationships, events, and other features of a domain, together with an account of how those descriptions can be interpreted and manipulated. A knowledge base contains particular statements expressed using such conventions; a representation formalism supplies the language and its associated reasoning framework. (cs.ubc.ca)\n\nIn an influential 1993 analysis, Randall Davis, Howard Shrobe, and Peter Szolovits identified five roles of a knowledge representation:\n\n- A surrogate for the world: it enables reasoning about situations without directly acting in them.\n- A set of ontological commitments: it determines which kinds of things and distinctions the system recognizes.\n- A partial theory of intelligent reasoning: it specifies which inferences are permitted or encouraged.\n- A medium for efficient computation: its organization affects which conclusions can be reached economically.\n- A medium of human expression: it enables people to communicate knowledge to a computational system.\n\nThese roles can conflict. A representation convenient for human explanation may not be the most computationally efficient, while a highly restricted language may make useful domain distinctions difficult to express. (groups.csail.mit.edu)\n\nSyntax, semantics, and inference\n\nFormal representation systems distinguish three components:\n\n- Syntax defines permissible symbols and expressions.\n- Semantics specifies what those expressions mean and when they are satisfied.\n- Inference procedures manipulate expressions to answer questions or obtain conclusions.\n\nFor example, a language might permit the expression LocatedIn(parcel, warehouse). Its syntax determines whether this is a well-formed expression; its semantics determines how the named objects and relationship are interpreted. An inference procedure might combine it with other statements to determine where the parcel can be collected. Precise semantics makes it possible to assess reasoning independently of a particular implementation. (people.cs.pitt.edu)"
    },
    {
      "heading": "Logical representation and deduction",
      "text": "Logic supplies languages in which statements and their relationships can be defined precisely. Propositional logic treats propositions as units that may be true or false. First-order logic additionally describes individuals, predicates, variables, and quantification, allowing general statements about objects and their relationships. (artint.info)\n\nConsider an illustrative knowledge base:\n\n\\[\\forall x\\;(\\operatorname{Warehouse}(x)\\rightarrow \\operatorname{Building}(x))\\]\n\n\\[\\operatorname{Warehouse}(w).\\]\n\nIt follows that:\n\n\\[\\operatorname{Building}(w).\\]\n\nThe general rule and the particular fact jointly support a conclusion that need not have been stored explicitly. This is an instance of deductive reasoning. The conclusion follows from the premises; the derivation does not independently establish that the premises accurately describe the real world. (cs.unca.edu)\n\nA fundamental distinction separates logical consequence from derivability:\n\n\\[K \\models \\varphi\\]\n\nmeans that the statement \\(\\varphi\\) is true in every interpretation satisfying the knowledge base \\(K\\), whereas\n\n\\[K \\vdash \\varphi\\]\n\nmeans that an inference system can derive \\(\\varphi\\) from \\(K\\). Soundness requires that derived conclusions be logical consequences. Completeness, relative to a specified language and semantics, requires that all logical consequences be derivable. These are properties of a reasoning system, not guarantees that its domain assumptions are correct. (cl.cam.ac.uk)"
    },
    {
      "heading": "Major representation approaches",
      "text": "Rules and logic programs\n\nRule-based representations express relationships between conditions and conclusions. A rule can state, for example, that an item is eligible for dispatch if it is packed and has an assigned destination. Reasoners can apply such rules to facts and intermediate conclusions. (artint.info)\n\nTwo common strategies are forward chaining, which starts from available facts and derives consequences, and backward chaining, which starts from a query and searches for supporting rules and premises. Their usefulness depends on the structure of the knowledge base and the questions being asked. Rule systems also differ in their treatment of negation, missing information, and assumptions; similar-looking rule notation does not by itself establish equivalent meanings. (cs.ubc.ca)\n\nFrames and semantic networks\n\nA frame organizes knowledge around a structured description of an object or stereotypical situation. Its slots can describe participants, attributes, expected values, or associated procedures. Marvin Minsky’s 1974 proposal emphasized larger, interconnected structures combining factual and procedural knowledge, rather than representing everything as isolated statements. (mit.edu)\n\nSemantic networks organize concepts or individuals as nodes connected by labeled relationships. Hierarchical links can support inheritance, but the consequences of a link depend on its defined meaning: a subclass relationship is not the same as membership, physical containment, or part–whole structure. A diagram becomes a formal reasoning representation only when the interpretation of its relationships is specified. (groups.csail.mit.edu)\n\nOntologies and description logics\n\nAn ontology specifies concepts and relationships used to describe a domain. It can provide a shared vocabulary and formal axioms that support interpretation across independently developed systems. Ontology engineering therefore involves decisions about meaning and domain structure, not merely assigning labels to data. (artint.info)\n\nDescription logics provide formal languages for describing classes, individuals, and relationships. Associated reasoning tasks include determining whether one class is a subclass of another, whether an individual belongs to a class, and whether a collection of axioms is consistent. The Web Ontology Language, particularly OWL 2 DL, provides standardized ontology modeling grounded in this tradition. (w3.org)\n\nKnowledge graphs\n\nA knowledge graph represents entities and relationships in graph form. It may contain instance-level facts, schema information, and links between sources. Its reasoning capabilities depend on the semantics and methods attached to it: graph connectivity alone does not determine which new statements follow. (artint.info)\n\nA useful distinction separates logical inference, which derives consequences of specified axioms, from graph completion, which predicts potentially missing relationships using learned patterns. A predicted relationship may be plausible without being logically entailed. (arxiv.org)\n\nProbabilistic representations\n\nWhen information is uncertain, a system can represent degrees of belief rather than only categorical assertions. Probabilistic graphical models, including Bayesian networks, describe dependencies among variables and support inference about unobserved quantities from evidence. Such models distinguish uncertainty about a proposition from the logical structure of that proposition. (cl.cam.ac.uk)\n\nProbabilistic and logical approaches can be combined. A system may use explicit relationships and rules to describe a domain while assigning uncertainty to observations, hypotheses, or relationships. Their integration requires a clear account of how the logical and probabilistic components interact. (arxiv.org)"
    },
    {
      "heading": "Forms of reasoning",
      "text": "Reasoning in this field extends beyond deduction:\n\n- Abduction identifies hypotheses that could explain observations in conjunction with background knowledge. An explanation is not automatically established as true.\n- Induction develops generalizations from examples or observations.\n- Probabilistic inference updates or computes beliefs given evidence.\n- Constraint reasoning searches for assignments satisfying restrictions.\n- Planning uses descriptions of states, actions, and goals to find suitable courses of action.\n\nThese activities answer different questions. Asking what necessarily follows from a model is different from asking what could explain an observation, what is probable, or which action sequence achieves a goal. (artint.info)\n\nMonotonic and nonmonotonic reasoning\n\nClassical logical consequence is monotonic: adding premises does not invalidate previously entailed conclusions. Everyday reasoning often depends on assumptions that may need revision. Nonmonotonic reasoning formalizes this defeasible character. For example, a system may assume that a scheduled delivery proceeds normally unless evidence of cancellation becomes available. (cs.ubc.ca)\n\nDefault rules must therefore be distinguished from universal implications. “Deliveries normally proceed as scheduled” allows exceptions; “every scheduled delivery proceeds” does not. Confusing the two changes the consequences of the representation. (arxiv.org)"
    },
    {
      "heading": "Missing information, identity, and change",
      "text": "Open-world and closed-world assumptions\n\nUnder an open-world assumption, absence of a statement does not establish its falsity. OWL uses this approach: an ontology that does not state whether an individual has a particular relationship may simply be incomplete. Under a closed-world assumption, a system treats information not established within a designated scope as false. The appropriate choice depends on whether that scope is intended to contain complete information. (w3.org)\n\nIdentity is another separate modeling choice. OWL does not automatically assume that two different names denote different individuals. Distinctness must be established when it matters. Otherwise, information sources using different identifiers may still refer to the same entity. (w3.org)\n\nActions and the frame problem\n\nRepresenting actions requires describing both what changes and what remains unchanged. The frame problem concerns the efficient representation of persistence: moving an object may change its position without changing its color or ownership. A system needs a principled way to capture these non-effects without enumerating every unaffected property for every action. (cl.cam.ac.uk)\n\nRelated difficulties include the qualification problem, concerning potentially numerous conditions that prevent an action from having its expected effect, and the ramification problem, concerning indirect consequences. These problems show why action representation requires more than a list of immediate effects. (cl.cam.ac.uk)"
    },
    {
      "heading": "Historical development",
      "text": "Logical representation was an early direction in symbolic artificial intelligence. In Programs with Common Sense, published in 1959, John McCarthy proposed an “Advice Taker” that would use formally expressed information to reason about what to do. This approach made explicit knowledge and inference central to intelligent behavior. (www-formal.stanford.edu)\n\nDuring the 1970s, structured approaches investigated how knowledge could be organized around familiar objects and situations. Minsky’s A Framework for Representing Knowledge, issued as an MIT memorandum in June 1974 and reprinted in 1975, became an influential statement of the frame approach. (mit.edu)\n\nSubsequent work developed formal ontology languages, reasoning under uncertainty, defeasible inference, and combinations of representation with learning. OWL illustrates the standardization of explicit ontology languages, while research connecting KRR with machine learning explores complementary uses of knowledge, data, and learned representations. (w3.org)"
    },
    {
      "heading": "Applications and integration with learning",
      "text": "Knowledge-based systems use representation and reasoning for tasks such as explaining observations, answering questions, integrating information sources, checking domain constraints, and planning actions. Explicit representations can make assumptions and inference steps inspectable, particularly when explanations identify the facts and rules supporting a conclusion. (cs.ubc.ca)\n\nMachine learning can acquire relationships or rules from examples, predict missing information, or guide search within a reasoner. Conversely, explicit knowledge can constrain learning and help explain its outputs. The division is therefore not simply between systems that “learn” and systems that “reason”; individual systems can do both. (arxiv.org)\n\nNeuro-symbolic artificial intelligence studies combinations of neural and symbolic methods. Approaches include translating symbolic knowledge into neural representations and connecting learned components with explicit reasoning systems. An important technical issue is whether such translations preserve the intended semantics. A useful prediction or numerical approximation is not, without further conditions, equivalent to a sound logical inference. (doi.org)"
    },
    {
      "heading": "Limitations and design trade-offs",
      "text": "Expressiveness and computational cost are closely connected. General first-order reasoning is only semidecidable: a suitable proof procedure can eventually find a proof when a consequence holds, but it need not terminate when no proof exists. Restricting a representation language can improve decidability or tractability, at the cost of limiting what can be expressed directly. (cl.cam.ac.uk)\n\nModel construction and maintenance remain substantial difficulties. Knowledge from different sources may use incompatible terminology, entity boundaries, or assumptions. Systems also evolve, introducing distinctions that their original designers did not anticipate. Consistency within a formal model does not resolve disagreements about how the domain should be modeled. (artint.info)\n\nExplanation and correctness must be distinguished. An inference trace can show how a conclusion follows from premises, but it cannot by itself establish that those premises are true, complete, or appropriate to the situation. Evaluation consequently concerns both the reasoning mechanism and the representation’s adequacy for its intended domain and tasks. (artint.info)"
    }
  ],
  "links": [
    "artificial-intelligence",
    "knowledge-base",
    "syntax",
    "semantics",
    "logic",
    "propositional-logic",
    "first-order-logic",
    "deductive-reasoning",
    "logical-consequence",
    "soundness",
    "ontology-computer-science",
    "knowledge-graph",
    "probabilistic-graphical-model",
    "bayesian-network",
    "abductive-reasoning",
    "inductive-reasoning",
    "nonmonotonic-reasoning",
    "symbolic-artificial-intelligence",
    "john-mccarthy",
    "machine-learning",
    "neuro-symbolic-artificial-intelligence"
  ],
  "sources": [
    {
      "title": "What is a Knowledge Representation?",
      "url": "https://groups.csail.mit.edu/medg/ftp/psz/k-rep.html"
    },
    {
      "title": "Artificial Intelligence — 1.4 Knowledge Representation",
      "url": "https://www.cs.ubc.ca/~poole/aibook/html1e/ArtInt_8.html"
    },
    {
      "title": "Introduction to Knowledge Representation and State Space Search",
      "url": "https://people.cs.pitt.edu/~wiebe/courses/CS475/Fall97/lec3.html"
    },
    {
      "title": "Introduction to knowledge representation and reasoning",
      "url": "https://www.cl.cam.ac.uk/teaching/2004/ArtInt1/knowledge.pdf"
    },
    {
      "title": "Introduction to Knowledge Representation",
      "url": "https://www.cs.unca.edu/~bruce/Spring98/csci373/ch6/lecture.html"
    },
    {
      "title": "Chapter 5 Propositions and Inference",
      "url": "https://www.artint.info/3e/html/ArtInt3e.Ch5.html"
    },
    {
      "title": "Artificial Intelligence — 5 Propositions and Inference",
      "url": "https://www.cs.ubc.ca/~poole/aibook/html1e/ArtInt_100.html"
    },
    {
      "title": "Artificial Intelligence — 5.3 Knowledge Representation Issues",
      "url": "https://artint.info/html1e/ArtInt_111.html"
    },
    {
      "title": "Artificial Intelligence, Third Edition, Python Code",
      "url": "https://artint.info/AIPython/aipython.pdf"
    },
    {
      "title": "Part II Reasoning and Planning with Certainty",
      "url": "https://artint.info/3e/html/ArtInt3e.Pt2.html"
    },
    {
      "title": "Artificial Intelligence — 13.3 Ontologies and Knowledge Sharing",
      "url": "https://artint.info/html1e/ArtInt_316.html"
    },
    {
      "title": "OWL 2 Web Ontology Language Primer (Second Edition)",
      "url": "https://www.w3.org/TR/2012/REC-owl2-primer-20121211/"
    }
  ],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}