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 Contributor : Ekaterina KomendantskayaConnect in order to contact the contributor Submitted on : Friday, July 18, 2008 - 2:27:32 PM Last modification on : Thursday, January 20, 2022 - 5:30:44 PM Long-term archiving on: : Tuesday, September 21, 2010 - 5:34:07 PM
Ekaterina Komendantskaya, John Power. Fibrational semantics for many-valued logic programs: grounds for non-groundness.. JELIA, Aug 2008, Dresden, Germany. ⟨inria-00295027v2⟩