Three-valued completion for abductive logic programs

DOI10.1016/0304-3975(96)00044-8zbMATH Open0872.68020OpenAlexW2119966759MaRDI QIDQ671511FDOQ671511

Authors: Frank Teusink 

Publication date: 27 February 1997

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

Full work available at URL: https://ir.cwi.nl/pub/2192

Recommendations

• scientific article; zbMATH DE number 1761893
• A Complete Axiomatization of the Three valued Completion of Logic Programs
• The IFF proof procedure for abductive logic programming

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• Abductive Logic Programming
• Model theory.
• Title not available (Why is that?)
• Title not available (Why is that?)
• A kripke-kleene semantics for logic programs*
• Title not available (Why is that?)
• Negation in logic programming
• Title not available (Why is that?)
• On the Relationship Between Abduction and Deduction
• SLDNFA: An abductive procedure for abductive logic programs
• Short note preferred extensions are partial stable models
• Title not available (Why is that?)
• Representing Incomplete Knowledge in Abductive Logic Programming

Cited In (6)

• A Complete Axiomatization of the Three valued Completion of Logic Programs
• Soundness of abductive proof procedure with respect to constraint for non-ground abducibles
• A core method for the weak completion semantics with skeptical abduction
• Title not available (Why is that?)
• Title not available (Why is that?)
• A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics

This page was built for publication: Three-valued completion for abductive logic programs

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