×

Coinductive logic programming with negation. (English) Zbl 1284.68117

De Schreye, Danny (ed.), Logic-based program synthesis and transformation. 19th international symposium, LOPSTR 2009, Coimbra, Portugal, September 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-12591-1/pbk). Lecture Notes in Computer Science 6037, 97-112 (2010).
Summary: We introduce negation into coinductive logic programming (co-LP) via what we term Coinductive SLDNF (co-SLDNF) resolution. We present declarative and operational semantics of co-SLDNF resolution and present their equivalence under the restriction of rationality. Co-LP with co-SLDNF resolution provides a powerful, practical and efficient operational semantics for Fitting’s Kripke-Kleene three-valued logic with restriction of rationality. Further, applications of co-SLDNF resolution are also discussed and illustrated where Co-SLDNF resolution allows one to develop elegant implementations of modal logics. Moreover it provides the capability of non-monotonic inference (e.g., predicate Answer Set Programming) that can be used to develop novel and effective first-order modal non-monotonic inference engines.
For the entire collection see [Zbl 1186.68005].

MSC:

68N17 Logic programming
03B45 Modal logic (including the logic of norms)
03B50 Many-valued logic
68N30 Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
PDFBibTeX XMLCite
Full Text: DOI