Fibrational semantics for many-valued logic programs: grounds for non-groundness

Ekaterina Komendantskaya; John Power

doi:10.1007/978-3-540-87803-2_22

Fibrational semantics for many-valued logic programs: grounds for non-groundness

Ekaterina Komendantskaya, John Power

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

4 Citations (Scopus)

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 Artifiicial Intelligence
Subtitle of host publication	11th European Conference, JELIA 2008, Dresden, Germany, September 28-October 1, 2008. Proceedings
Editors	Steffen Hölldobler, Carsten Lutz, Heinrich Wansing
Place of Publication	Berlin
Publisher	Springer
Pages	258-271
Number of pages	14
ISBN (Electronic)	9783540878032
ISBN (Print)	9783540878025
DOIs	https://doi.org/10.1007/978-3-540-87803-2_22
Publication status	Published - 2008
Event	11th European Conference on Logics in Artificial Intelligence - Computer Science Faculty building of Technische Universität Dresden, Dresden, Germany Duration: 28 Sept 2008 → 1 Oct 2008 http://www.jelia.eu/2008/

Publication series

Name	Lecture notes in computer science
Publisher	Springer
Volume	5293
ISSN (Print)	0302-9743

Conference

Conference	11th European Conference on Logics in Artificial Intelligence
Abbreviated title	JELIA 2008
Country/Territory	Germany
City	Dresden
Period	28/09/08 → 1/10/08
Internet address	http://www.jelia.eu/2008/

Keywords

Many-valued logic programs
categorical logic
fibrational semantics
ground semantics
SLD-resolution
DEDUCTION

Access to Document

10.1007/978-3-540-87803-2_22

Cite this

Komendantskaya, E., & Power, J. (2008). Fibrational semantics for many-valued logic programs: grounds for non-groundness. In S. Hölldobler, C. Lutz, & H. Wansing (Eds.), Logics in Artifiicial Intelligence: 11th European Conference, JELIA 2008, Dresden, Germany, September 28-October 1, 2008. Proceedings (pp. 258-271). (Lecture notes in computer science; Vol. 5293). Springer . https://doi.org/10.1007/978-3-540-87803-2_22

Komendantskaya, Ekaterina ; Power, John. / Fibrational semantics for many-valued logic programs : grounds for non-groundness. Logics in Artifiicial Intelligence: 11th European Conference, JELIA 2008, Dresden, Germany, September 28-October 1, 2008. Proceedings. editor / Steffen Hölldobler ; Carsten Lutz ; Heinrich Wansing. Berlin : Springer , 2008. pp. 258-271 (Lecture notes in computer science).

@inproceedings{8b08dd9dcab34c13bfedd149e6338d46,

title = "Fibrational semantics for many-valued logic programs: grounds for non-groundness",

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.",

keywords = "Many-valued logic programs, categorical logic, fibrational semantics, ground semantics, SLD-resolution, DEDUCTION",

author = "Ekaterina Komendantskaya and John Power",

year = "2008",

doi = "10.1007/978-3-540-87803-2_22",

language = "English",

isbn = "9783540878025",

series = "Lecture notes in computer science",

publisher = "Springer ",

pages = "258--271",

editor = "H{\"o}lldobler, {Steffen } and Lutz, {Carsten } and Wansing, {Heinrich }",

booktitle = "Logics in Artifiicial Intelligence",

note = "11th European Conference on Logics in Artificial Intelligence, JELIA 2008 ; Conference date: 28-09-2008 Through 01-10-2008",

url = "http://www.jelia.eu/2008/",

}

Komendantskaya, E & Power, J 2008, Fibrational semantics for many-valued logic programs: grounds for non-groundness. in S Hölldobler, C Lutz & H Wansing (eds), Logics in Artifiicial Intelligence: 11th European Conference, JELIA 2008, Dresden, Germany, September 28-October 1, 2008. Proceedings. Lecture notes in computer science, vol. 5293, Springer , Berlin, pp. 258-271, 11th European Conference on Logics in Artificial Intelligence, Dresden, Germany, 28/09/08. https://doi.org/10.1007/978-3-540-87803-2_22

Fibrational semantics for many-valued logic programs: grounds for non-groundness. / Komendantskaya, Ekaterina; Power, John.
Logics in Artifiicial Intelligence: 11th European Conference, JELIA 2008, Dresden, Germany, September 28-October 1, 2008. Proceedings. ed. / Steffen Hölldobler; Carsten Lutz; Heinrich Wansing. Berlin: Springer , 2008. p. 258-271 (Lecture notes in computer science; Vol. 5293).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Fibrational semantics for many-valued logic programs

T2 - 11th European Conference on Logics in Artificial Intelligence

AU - Komendantskaya, Ekaterina

AU - Power, John

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

KW - Many-valued logic programs

KW - categorical logic

KW - fibrational semantics

KW - ground semantics

KW - SLD-resolution

KW - DEDUCTION

U2 - 10.1007/978-3-540-87803-2_22

DO - 10.1007/978-3-540-87803-2_22

M3 - Conference contribution

SN - 9783540878025

T3 - Lecture notes in computer science

SP - 258

EP - 271

BT - Logics in Artifiicial Intelligence

A2 - Hölldobler, Steffen

A2 - Lutz, Carsten

A2 - Wansing, Heinrich

PB - Springer

CY - Berlin

Y2 - 28 September 2008 through 1 October 2008

ER -

Komendantskaya E, Power J. Fibrational semantics for many-valued logic programs: grounds for non-groundness. In Hölldobler S, Lutz C, Wansing H, editors, Logics in Artifiicial Intelligence: 11th European Conference, JELIA 2008, Dresden, Germany, September 28-October 1, 2008. Proceedings. Berlin: Springer . 2008. p. 258-271. (Lecture notes in computer science). doi: 10.1007/978-3-540-87803-2_22

Fibrational semantics for many-valued logic programs: grounds for non-groundness

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this