In this paper we study the semantics of Coinductive Logic Programming and clarify its intrinsic computational limits, which prevent, in particular, the definition of a complete, computable, operational semantics. We propose a new operational semantics that allows a simple correctness result and the definition of a simple meta-interpreter. We compare, and prove the equivalence, with the operational semantics defined and used in other papers on this topic.
A Theoretical Perspective of Coinductive Logic Programming
DOVIER, Agostino
Membro del Collaboration Group
2015-01-01
Abstract
In this paper we study the semantics of Coinductive Logic Programming and clarify its intrinsic computational limits, which prevent, in particular, the definition of a complete, computable, operational semantics. We propose a new operational semantics that allows a simple correctness result and the definition of a simple meta-interpreter. We compare, and prove the equivalence, with the operational semantics defined and used in other papers on this topic.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
fi-AD-2015.pdf
non disponibili
Descrizione: Articolo principale
Tipologia:
Versione Editoriale (PDF)
Licenza:
Non pubblico
Dimensione
776.55 kB
Formato
Adobe PDF
|
776.55 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
