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

DOI10.1016/S0304-3975(96)00125-9zbMath0874.68045MaRDI QIDQ673380

Paul Ruet, François Fages

Publication date: 28 February 1997

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

zbMATH Keywords

bilatticeslogic programmingsemanticnegation as failureBelnap's four-valued logicexplicit negationreasoning in the presence of incomplete information

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items

Parametrized semantics of logic programs -- a unifying framework ⋮ Natural dualities through product representations: bilattices and beyond ⋮ Preferences in artificial intelligence ⋮ Multi-valued logic programming semantics An algebraic approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bilattices and the theory of truth
• A kripke-kleene semantics for logic programs*
• Negation in logic programming
• Bilattices and the semantics of logic programming
• The Semantics of Predicate Logic as a Programming Language
• The family of stable models
• Constructive negation by pruning