Logic program semantics and circumscription of autoepistemic theories

DOI10.1016/0020-0190(94)00018-2zbMath0807.68017OpenAlexW1966372434MaRDI QIDQ1327306

Li Yan Yuan

Publication date: 15 June 1994

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

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00018-2

zbMATH Keywords

nonmonotonic reasoningcircumscriptionautoepistemic theoriesGelfond-Lifschitz transformation

Mathematics Subject Classification ID

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

Related Items (1)

Autoepistemic logic of first order and its expressive power

Cites Work

• Unnamed Item
• Stable and extension class theory for logic programs and default logics
• Autoepistemic circumscription and logic programming
• Short note preferred extensions are partial stable models
• The well-founded semantics for general logic programs

This page was built for publication: Logic program semantics and circumscription of autoepistemic theories