Adding closed world assumptions to well-founded semantics

DOI10.1016/0304-3975(94)90201-1zbMATH Open0801.68111DBLPjournals/tcs/PereiraAA94OpenAlexW1968333646WikidataQ62039018 ScholiaQ62039018MaRDI QIDQ1314417

Joaquim N. Aparício, Luís Moniz Pereira, José Júlio Alferes

Publication date: 29 November 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10362/64188

zbMATH Keywords

well-founded semanticslogic programsclosed world assumption\(O\)- semantics

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Short note preferred extensions are partial stable models
• The well-founded semantics for general logic programs

Related Items (3)

On the extension of logic programming with negation through uniform proofs ⋮ Unnamed Item ⋮ Annotations on the consistency of the closed world assumption

This page was built for publication: Adding closed world assumptions to well-founded semantics