ON S L D N F-RESOLUTION IN LOGIC PROGRAMMING WITH NEGATION

Lusine Sargsyan

This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

This work is licensed under Creative Commons Attribution–NonCommercial International License (CC BY-NC 4.0).

Abstract

The paper is devoted to the logic programming with negation and with built-in predicates. General logic programs (logic programs with negation) and general goals (goals with negation) are considered. Modification of SLDNF-resolution for built-in predicates is introduced. The soundness of modified SLDNF-resolution is proved. SLDNF-resolution used in real systems (practical SLDNF-resolution) is considered and the soundness of practical SLDNF-resolution is proved.

Author(s)

Table of Contents

ON S L D N F-RESOLUTION IN LOGIC PROGRAMMING WITH NEGATION

Abstract

Author(s)

Table of Contents

Related Articles

DETERMINATION OF REFRACTIVE INDEX OF HETEROGENEOUS SUBSTANCES FOR X-RAY RADIATION

PLASMONIC MODE CONFINEMENT IN InAs–SiO2–Si WAVEGUIDE IN TERAHERTZ REGION

ON S L D N F-RESOLUTION IN LOGIC PROGRAMMING WITH NEGATION

Abstract

Subscribe to TheGufo Newsletter​

Subscribe to TheGufo Newsletter