Making assumptions in the automated derivation

DOI10.1016/J.INS.2003.09.009zbMATH Open1094.68089OpenAlexW1987400528MaRDI QIDQ707362FDOQ707362

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)

Cites Work

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

   Recommendations

• On automatic differentiation 👍 👎
• Title not available (Why is that?) 👍 👎
• Automatic evaluation of derivatives 👍 👎
• Title not available (Why is that?) 👍 👎
• Automated Inequality Proving and Discovering 👍 👎
• A mathematical view of automatic differentiation 👍 👎
• The if-problem in automatic differentiation 👍 👎
• Title not available (Why is that?) 👍 👎
• On the implementation of automatic differentiation tools 👍 👎
• Combining assisted and automated deduction 👍 👎

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)