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.
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 ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.