Making assumptions in the automated derivation

DOI10.1016/J.INS.2003.09.009MaRDI QIDQ707362zbMATH OpenOpenAlexFDO

Authors Faye F. Liu

Publication date 9 February 2005

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2003.09.009

zbMATH Keywords

PT-resolutionSLD-resolutionLogic programmingConditional proof

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• On automatic differentiation
• Publication:3474197
• Automatic evaluation of derivatives
• scientific article; zbMATH DE number 4080744
• Automated inequality proving and discovering
• A mathematical view of automatic differentiation
• The if-problem in automatic differentiation
• scientific article; zbMATH DE number 852360
• On the implementation of automatic differentiation tools
• Combining assisted and automated deduction

Cites work

• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• A new definition of SLDNF-resolution
• A procedural semantics for well-founded negation in logic programs
• A theoretical evaluation of selected backtracking algorithms.
• An effective fixpoint semantics for linear logic programs
• An implementation of Kripke-Kleene semantics
• Classes of terminating logic programs
• Loop checking in partial deduction
• Preferred answer sets for extended logic programs
• Resolution versus search: Two strategies for SAT

Cited in

(2)

• Logic between expressivity and complexity
• Argumentation within deductive reasoning

This page was built for publication: Making assumptions in the automated derivation

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