Two simple characterizations of well-founded semantics

DOI10.1007/3-540-55808-X_44zbMath1493.68074OpenAlexW1572420724MaRDI QIDQ5096858

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the relationship between circumscription and negation as failure
• Circumscription - a form of non-monotonic reasoning
• A simple fixed point characterization of three-valued stable model semantics
• Negation as failure using tight derivations for general logic programs

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