Completeness (knowledge bases)

Completeness (knowledge bases)

A knowledge base KB is complete if there is no formular α such that KB ⊭ α and KB ⊭ ¬α.

Example of knowledge base with incomplete knowledge:

KB := { A ∨ B }

Then we have KB ⊭ A and KB ⊭ ¬A.

In some cases, you can make a consistent knowledge base complete with the closed world assumption - that is, adding all not-entailed literals as negations to the knowledge base. In the above example though, this would not work because it would make the knowledge base inconsistent:

KB' = { A ∨ B, ¬A, ¬B }

In the case you have KB := { P(a), Q(a), Q(b) }, you have KB ⊭ P(b) and KB ⊭ ¬P(b), so with the closed world assumption you would get KB' = { P(a), ¬P(b), Q(a), Q(b) } where you have KB' ⊨ ¬P(b).

See also:

  • Vivid knowledge

Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Completeness (order theory) — In the mathematical area of order theory, completeness properties assert the existence of certain infima or suprema of a given partially ordered set (poset). A special use of the term refers to complete partial orders or complete lattices.… …   Wikipedia

  • Proof of knowledge — In cryptography, a proof of knowledge is an interactive proof in which the prover succeeds convincing a verifier that it knows something. What it means for a machine to know something is defined in terms of computation. A machine knows something …   Wikipedia

  • Cyc — For other uses, see CYC (disambiguation). Cyc Developer(s) Cycorp Written in Lisp, CycL Type Ontology and Inference engine Cyc is an artificial intelligence project that attempts to assemble …   Wikipedia

  • Meta-process modeling — Abstraction level for processes.[1] Meta process modeling is a type of metamodeling used in software engineering and systems engineering for the analysis and construction of models applicable and useful to some predefined problems. Meta process… …   Wikipedia

  • Friedrich Daniel Ernst Schleiermacher — (pronounced|ˈʃlaɪɐmaxɐ) (November 21, 1768 ndash; February 12, 1834) was a German theologian and philosopher known for his impressive attempt to reconcile the criticisms of the Enlightenment with traditional Protestant orthodoxy. He was also… …   Wikipedia

  • Pythagoreans and Eleatics — Edward Hussey PYTHAGORAS AND THE EARLY PYTHAGOREANS Pythagoras, a native of Samos, emigrated to southern Italy around 520, and seems to have established himself in the city of Croton. There he founded a society of people sharing his beliefs and… …   History of philosophy

  • Logic — For other uses, see Logic (disambiguation). Philosophy …   Wikipedia

  • BIBLE — THE CANON, TEXT, AND EDITIONS canon general titles the canon the significance of the canon the process of canonization contents and titles of the books the tripartite canon …   Encyclopedia of Judaism

  • Description logic — (DL) is a family of formal knowledge representation languages. It is more expressive than propositional logic but has more efficient decision problems than first order predicate logic. DL is used in artificial intelligence for formal reasoning on …   Wikipedia

  • HEBREW GRAMMAR — The following entry is divided into two sections: an Introduction for the non specialist and (II) a detailed survey. [i] HEBREW GRAMMAR: AN INTRODUCTION There are four main phases in the history of the Hebrew language: the biblical or classical,… …   Encyclopedia of Judaism

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”