Soundness of abductive proof procedure with respect to constraint for non-ground abducibles

DOI10.1016/S0304-3975(97)00171-0zbMath0916.68140MaRDI QIDQ1274977

Susumu Yamasaki, Yoshinori Kurose

Publication date: 12 January 1999

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

zbMATH Keywords

abduction in 3-valued logicnon-ground abduciblesrefined alternating fixpoint semantics

Mathematics Subject Classification ID

Related Items (1)

A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Three-valued completion for abductive logic programs
• A non-ground realization of the stable and well-founded semantics
• The alternating fixpoint of logic programs with negation
• A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete
• Properties of substitutions and unifications
• On the relations between stable and well-founded semantics of logic programs
• Dualities between alternative semantics for logic programming and nonmonotonic reasoning
• SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs
• A sound and complete semantics for a version of negation as failure
• Extending negation as failure by abduction: A three-valued stable model semantics
• A kripke-kleene semantics for logic programs*
• Negation as failure. II
• Short note preferred extensions are partial stable models
• The well-founded semantics for general logic programs
• Equivalence of well-founded and stable semantics
• On the equivalence of semantics for normal logic programs
• Abductive Logic Programming

This page was built for publication: Soundness of abductive proof procedure with respect to constraint for non-ground abducibles