Making assumptions in the automated derivation

Authors:
Faye F. Liu
Affiliations:
Department of Computer Science & Computer Engineering, La Trobe University, Bundoora, Melbourne, Vic., 3083, Australia
Venue:
Information Sciences: an International Journal
Year:
2004

Citing 11
Cited 0

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
A procedural semantics for well-founded negation in logic programs

Journal of Logic Programming
Splitting a logic program

Proceedings of the eleventh international conference on Logic programming
Computing stable models by program transformation

Proceedings of the eleventh international conference on Logic programming
A theoretical evaluation of selected backtracking algorithms

Artificial Intelligence
An implementation of Kripke-Kleene semantics

Information Sciences—Informatics and Computer Science: An International Journal
Efficient reasoning

ACM Computing Surveys (CSUR)
Complexity and expressive power of logic programming

ACM Computing Surveys (CSUR)
Resolution versus Search: Two Strategies for SAT

Journal of Automated Reasoning
Classes of terminating logic programs

Theory and Practice of Logic Programming
An effective fixpoint semantics for linear logic programs

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.07

Visualization

Abstract

This paper proposes a mechanism to integrate conditional proof, which is an important proof technique in deductive logic, into logic programming to enhance the power of deduction. Concentrating on two existing resolution strategies--SLD-resolution and PT-resolution, it analyses the necessity and feasibility of the integration, and formulates the procedure.