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

DOI10.1016/0020-0190(91)90012-7MaRDI QIDQ1183439zbMATH OpenOpenAlexFDO

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

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

stable model semanticswell-founded semantics

Mathematics Subject Classification ID

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

Review text

This paper provides a simple fixed point characterization of the three- valued stable model semantics. Due to results by \textit{T. Przymusinski} [Fundam. Inf. 13 (4), 445-464 (1990; Zbl 0706.68029)] we also obtain a formally identical, but notationally and technically simpler characterization of the three-valued well-founded semantics than the one given in \textit{T. Przymusinski} [Every logic program has a natural stratification and an iterated fixed point model, Proc. 8th Symp. on Principles of Database systems, 11-21 (1989)]. Because of the constructive nature of this new formalization we also find it appropriate as the starting point of an algorithm for execution of restricted classes of logic programs (specifically datalog).

Recommendations

• scientific article; zbMATH DE number 4160107
• Characterizations of the stable semantics by partial evaluation
• scientific article; zbMATH DE number 3848592
• A kripke-kleene semantics for logic programs*
• Thirteen Definitions of a Stable Model

Cites work

• A kripke-kleene semantics for logic programs*
• A lattice-theoretical fixpoint theorem and its applications
• Dualities between alternative semantics for logic programming and nonmonotonic reasoning
• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 4199656 (Why is no real title available?)
• scientific article; zbMATH DE number 4160107 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• Negation in logic programming
• The Semantics of Predicate Logic as a Programming Language
• The well-founded semantics for general logic programs

Cited in

(7)

• What is failure? An approach to constructive negation
• scientific article; zbMATH DE number 3848592 (Why is no real title available?)
• scientific article; zbMATH DE number 4160107 (Why is no real title available?)
• scientific article; zbMATH DE number 1884399 (Why is no real title available?)
• scientific article; zbMATH DE number 1453074 (Why is no real title available?)
• Properties of general semantic operators determined by logic-based systems
• Two simple characterizations of well-founded semantics

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1183439)