Abstract
We present a proof theoretic approach to the problem of negation in logic programming. We introduce a quantifier-free sequent calculus which is sound for Negation as Failure. Some extensions of the calculus have 3-valued or intuitionistic interpretations.
Cite
CITATION STYLE
APA
Stärk, R. F. (1990). A quantifier-free completion of logic programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 440 LNCS, pp. 384–395). Springer Verlag. https://doi.org/10.1007/3-540-52753-2_53
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free