Abstract : We introduce a fibrational semantics for many-valued logic programming, use it to define an SLD-resolution for annotation-free many valued logic programs as defined by Fitting, and prove a soundness and completeness result relating the two. We show that fibrational se- mantics corresponds with the traditional declarative (ground) semantics and deduce a soundness and completeness result for our SLD-resolution algorithm with respect to the ground semantics.
https://hal.inria.fr/inria-00295027
Contributeur : Ekaterina Komendantskaya
<>
Soumis le : vendredi 18 juillet 2008 - 14:27:32
Dernière modification le : jeudi 11 janvier 2018 - 16:19:44
Document(s) archivé(s) le : mardi 21 septembre 2010 - 17:34:07
Ekaterina Komendantskaya, John Power. Fibrational semantics for many-valued logic programs: grounds for non-groundness.. JELIA, Aug 2008, Dresden, Germany. 2008. 〈inria-00295027v2〉
