Combining explicit negation and negation by failure via Belnap's logic

DOI10.1016/S0304-3975(96)00125-9zbMATH Open0874.68045MaRDI QIDQ673380FDOQ673380

Authors: Paul Ruet, François Fages 

Publication date: 28 February 1997

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

Recommendations

• scientific article; zbMATH DE number 591001
• scientific article
• scientific article; zbMATH DE number 25190

zbMATH Keywords

bilatticessemanticnegation as failurelogic programmingBelnap's four-valued logicexplicit negationreasoning in the presence of incomplete information

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Semantics of Predicate Logic as a Programming Language
• Bilattices and the semantics of logic programming
• Constructive negation by pruning
• A kripke-kleene semantics for logic programs*
• Bilattices and the theory of truth
• Negation in logic programming
• The family of stable models
• Title not available (Why is that?)

Cited In (8)

• Belnap's epistemic states and negation-as-failure
• Multi-valued logic programming semantics An algebraic approach
• Title not available (Why is that?)
• Title not available (Why is that?)
• Natural dualities through product representations: bilattices and beyond
• Preferences in artificial intelligence
• Imperfect information representation through extended logic programs in bilattices
• Parametrized semantics of logic programs -- a unifying framework

This page was built for publication: Combining explicit negation and negation by failure via Belnap's logic

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