A fixpoint characterization of abductive logic programs

DOI10.1016/0743-1066(95)00119-0MaRDI QIDQ3129498zbMATH OpenOpenAlexFDO

Authors Katsumi Inoue, Chiaki Sakama

Publication date 27 April 1997

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(95)00119-0

zbMATH Keywords

fixpoint semanticsabductive logic programs

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 1696831
• Abduction from logic programs: Semantics and complexity
• Complexity results for abductive logic programming
• Abductive Logic Programming
• A fixpoint semantics for disjunctive logic programs

Cited in

(10)

• The IFF proof procedure for abductive logic programming
• Semi-negative Abductive Logic Programs with Implicative Integrity Constraints: Semantics and Properties
• Brave Induction
• The Seventh Answer Set Programming Competition: Design and Results
• Oscillating behavior of logic programs
• Brave induction: a logical framework for learning from incomplete information
• A Transformation-Based Approach to View Updating in Stratifiable Deductive Databases
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• Prioritized logic programming and its application to commonsense reasoning
• Computing abduction by using TMS with top-down expectation

Describes a project that uses

Uses Software

• SATCHMO

This page was built for publication: A fixpoint characterization of abductive logic programs

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