Adding closed world assumptions to well-founded semantics

DOI10.1016/0304-3975(94)90201-1MaRDI QIDQ1314417zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Luís Moniz Pereira, Joaquim N. Aparício, 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

\(O\)- semanticsclosed world assumptionlogic programswell-founded semantics

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 970713
• Any-world assumptions in logic programming
• On the relationship between CWA, minimal model, and minimal herbrand model semantics
• Closed world assumptions having precedence in predicates
• The well-founded semantics for general logic programs

Cites work

• scientific article; zbMATH DE number 4155872 (Why is no real title available?)
• Short note preferred extensions are partial stable models
• The well-founded semantics for general logic programs

Cited in

(6)

• Any-world assumptions in logic programming
• Annotations on the consistency of the closed world assumption
• On the extension of logic programming with negation through uniform proofs
• scientific article; zbMATH DE number 970713 (Why is no real title available?)
• MICAI 2004: Advances in Artificial Intelligence
• Closed world assumptions having precedence in predicates

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

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