A simple fixed point characterization of three-valued stable model semantics

DOI10.1016/0020-0190(91)90012-7zbMath0749.68050OpenAlexW2011895230MaRDI QIDQ1183439

T. Näslund, Ulf S. Nilsson, Staffan Bonnier

Publication date: 28 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90012-7

zbMATH Keywords

well-founded semanticsstable model semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17) Inductive definability (03D70)

Related Items (3)

What is failure? An approach to constructive negation ⋮ Two simple characterizations of well-founded semantics ⋮ Properties of General Semantic Operators Determined by Logic-Based Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dualities between alternative semantics for logic programming and nonmonotonic reasoning
• A lattice-theoretical fixpoint theorem and its applications
• A kripke-kleene semantics for logic programs*
• Negation in logic programming
• The Semantics of Predicate Logic as a Programming Language
• The well-founded semantics for general logic programs

This page was built for publication: A simple fixed point characterization of three-valued stable model semantics