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

^*Corresponding author for this work

School of Computer Science

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

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	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages	258-271
Number of pages	14
Volume	5293 LNAI
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, JELIA 2008 - Dresden, Germany Duration: 28 Sept 2008 → 1 Oct 2008

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5293 LNAI
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Conference

Conference	11th European Conference on Logics in Artificial Intelligence, JELIA 2008
Country/Territory	Germany
City	Dresden
Period	28/09/08 → 1/10/08

Keywords

Categorical logic
Fibrational semantics
Ground semantics
Many-valued logic programs
SLD-resolution

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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5293 LNAI, pp. 258-271). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5293 LNAI). 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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5293 LNAI 2008. pp. 258-271 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{76f1328d10104e64b177993c1ac44b02,

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 = "Categorical logic, Fibrational semantics, Ground semantics, Many-valued logic programs, SLD-resolution",

author = "Ekaterina Komendantskaya and John Power",

year = "2008",

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

language = "English",

isbn = "3540878025",

volume = "5293 LNAI",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "258--271",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

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

}

Komendantskaya, E & Power, J 2008, Fibrational semantics for many-valued logic programs: Grounds for non-groundness. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5293 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5293 LNAI, pp. 258-271, 11th European Conference on Logics in Artificial Intelligence, JELIA 2008, 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.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5293 LNAI 2008. p. 258-271 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5293 LNAI).

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, JELIA 2008

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 - Categorical logic

KW - Fibrational semantics

KW - Ground semantics

KW - Many-valued logic programs

KW - SLD-resolution

UR - https://www.scopus.com/pages/publications/56649109562

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

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

M3 - Conference contribution

AN - SCOPUS:56649109562

SN - 3540878025

SN - 9783540878025

VL - 5293 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 258

EP - 271

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5293 LNAI. 2008. p. 258-271. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). 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

Other files and links

Fingerprint

Fellowship CLANN EP/F044046/1: Computational Logic in Artificial Neural Networks

Cite this

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

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Projects

Fellowship CLANN EP/F044046/1: Computational Logic in Artificial Neural Networks

Cite this