Two simple characterizations of well-founded semantics

DOI10.1007/3-540-55808-X_44MaRDI QIDQ5096858zbMATH OpenOpenAlexFDO

Authors Teodor C. Przymusinski

Publication date 18 August 2022

Published in Mathematical Foundations of Computer Science 1992 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-55808-x_44

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Cites work

• A simple fixed point characterization of three-valued stable model semantics
• Circumscription - a form of non-monotonic reasoning
• scientific article; zbMATH DE number 4199656 (Why is no real title available?)
• scientific article; zbMATH DE number 4155872 (Why is no real title available?)
• scientific article; zbMATH DE number 4160107 (Why is no real title available?)
• scientific article; zbMATH DE number 4166939 (Why is no real title available?)
• scientific article; zbMATH DE number 3755910 (Why is no real title available?)
• scientific article; zbMATH DE number 25192 (Why is no real title available?)
• Negation as failure using tight derivations for general logic programs
• On the relationship between circumscription and negation as failure

This page was built for publication: Two simple characterizations of well-founded semantics

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