Making assumptions in the automated derivation

DOI10.1016/J.INS.2003.09.009zbMath1094.68089OpenAlexW1987400528MaRDI QIDQ707362

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

Logic programmingSLD-resolutionPT-resolutionConditional proof

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

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

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