Kripke–Kleene semantics in logic programming
E504786
fixed-point semantics
non-classical logic semantics
semantics for logic programs
three-valued semantics
Kripke–Kleene semantics in logic programming is a three-valued, fixed-point-based approach to interpreting logic programs that captures partial or undefined information without committing to classical true/false evaluations.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Kripke–Kleene semantics in logic programming canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T5234079 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Kripke–Kleene semantics in logic programming Context triple: [Melvin Fitting, knownFor, Kripke–Kleene semantics in logic programming]
-
A.
Kleene strong three-valued logic
Kleene strong three-valued logic is a non-classical logical system that extends classical logic with a third truth value to rigorously handle indeterminate or partially defined statements.
-
B.
The Logic of Computer Programming
The Logic of Computer Programming is a foundational textbook in theoretical computer science that rigorously develops methods for specifying, proving, and reasoning about the correctness of computer programs.
-
C.
Logical Methods in Computer Science
Logical Methods in Computer Science is a peer-reviewed open-access journal focusing on theoretical computer science, particularly logic and its applications to computer science.
-
D.
"The Complexity of Theorem-Proving Procedures"
"The Complexity of Theorem-Proving Procedures" is Stephen Cook’s landmark 1971 paper that introduced the concept of NP-completeness and proved the Boolean satisfiability problem (SAT) to be NP-complete, laying the foundation for modern computational complexity theory.
-
E.
Kripke fixed-point theory of truth
The Kripke fixed-point theory of truth is a semantic framework developed by Saul Kripke that uses partial truth predicates and fixed points to consistently handle self-referential sentences and semantic paradoxes like the liar paradox.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Kripke–Kleene semantics in logic programming Target entity description: Kripke–Kleene semantics in logic programming is a three-valued, fixed-point-based approach to interpreting logic programs that captures partial or undefined information without committing to classical true/false evaluations.
-
A.
Kleene strong three-valued logic
Kleene strong three-valued logic is a non-classical logical system that extends classical logic with a third truth value to rigorously handle indeterminate or partially defined statements.
-
B.
The Logic of Computer Programming
The Logic of Computer Programming is a foundational textbook in theoretical computer science that rigorously develops methods for specifying, proving, and reasoning about the correctness of computer programs.
-
C.
Logical Methods in Computer Science
Logical Methods in Computer Science is a peer-reviewed open-access journal focusing on theoretical computer science, particularly logic and its applications to computer science.
-
D.
"The Complexity of Theorem-Proving Procedures"
"The Complexity of Theorem-Proving Procedures" is Stephen Cook’s landmark 1971 paper that introduced the concept of NP-completeness and proved the Boolean satisfiability problem (SAT) to be NP-complete, laying the foundation for modern computational complexity theory.
-
E.
Kripke fixed-point theory of truth
The Kripke fixed-point theory of truth is a semantic framework developed by Saul Kripke that uses partial truth predicates and fixed points to consistently handle self-referential sentences and semantic paradoxes like the liar paradox.
- F. None of above. chosen
Statements (42)
| Predicate | Object |
|---|---|
| instanceOf |
fixed-point semantics
ⓘ
non-classical logic semantics ⓘ semantics for logic programs ⓘ three-valued semantics ⓘ |
| aimsTo | provide a skeptical semantics for logic programs ⓘ |
| appliesTo |
logic programs with negation
ⓘ
normal logic programs ⓘ |
| assumes | closed-world assumption in a three-valued way ⓘ |
| basedOn |
fixed-point theory
ⓘ
three-valued logic ⓘ |
| captures |
partial information
ⓘ
undefined information ⓘ |
| characterizedBy | least fixed point of an immediate consequence operator ⓘ |
| comparedWith | well-founded semantics as a refinement ⓘ |
| computationalProperty | can be obtained by iterating an operator from the least interpretation ⓘ |
| computes | least three-valued model of a logic program ⓘ |
| defines | three-valued interpretation for each atom ⓘ |
| doesNotCommitTo | classical two-valued evaluations ⓘ |
| ensures | monotonicity of the immediate consequence operator in the three-valued setting ⓘ |
| framework | non-monotonic logic programming ⓘ |
| generalizes | least Herbrand model semantics for definite programs ⓘ |
| influencedBy |
Saul Kripke
NERFINISHED
ⓘ
Stephen Cole Kleene NERFINISHED ⓘ |
| is |
less informative than stable model semantics
ⓘ
more cautious than stable model semantics ⓘ |
| modelType | partial model of a logic program ⓘ |
| originatesFrom |
Kleene’s strong three-valued logic
NERFINISHED
ⓘ
Kripke semantics NERFINISHED ⓘ |
| relatedTo |
partial stable model semantics
ⓘ
stable model semantics ⓘ well-founded semantics NERFINISHED ⓘ |
| semanticGoal | represent what is definitely true, definitely false, or undetermined ⓘ |
| supports | undefined truth value for atoms involved in cycles through negation ⓘ |
| treatsNegationAs | negation-as-failure under three-valued interpretation ⓘ |
| usedFor |
non-monotonic reasoning
ⓘ
reasoning with incomplete information ⓘ |
| usedIn |
formal analysis of non-monotonic reasoning systems
ⓘ
knowledge representation research ⓘ theoretical studies of logic programming semantics ⓘ |
| usesTruthValues |
false
ⓘ
true ⓘ undefined ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Kripke–Kleene semantics in logic programming Description of subject: Kripke–Kleene semantics in logic programming is a three-valued, fixed-point-based approach to interpreting logic programs that captures partial or undefined information without committing to classical true/false evaluations.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.