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 semantics 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.
Original language | English |
---|---|
Title of host publication | Logics in Artificial Intelligence 11th European Conference, JELIA 2008, Dresden, Germany, September 28-October 1, 2008. Proceedings |
Place of Publication | Heidelberg |
Publisher | Springer |
Pages | 258-271 |
Number of pages | 14 |
Volume | 5293 |
DOIs | |
Publication status | Published - 2008 |