Sound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs

Ekaterina Komendantskaya; Anthony Karel Seda

doi:10.1016/j.entcs.2008.12.071

Sound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs

Ekaterina Komendantskaya^*, Anthony Karel Seda

^*Corresponding author for this work

School of Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

We introduce the class of normal bilattice-based annotated first-order logic programs (BAPs) and develop declarative and operational semantics for them. In particular, SLD-resolution for these programs is defined and its soundness and completeness established.

Original language	English
Pages (from-to)	141-159
Number of pages	19
Journal	Electronic Notes in Theoretical Computer Science
Volume	225
Issue number	C
DOIs	https://doi.org/10.1016/j.entcs.2008.12.071
Publication status	Published - 2 Jan 2009

Keywords

Annotated logic programming
bilattices
declarative and operational semantics
SLD-resolution

Access to Document

10.1016/j.entcs.2008.12.071

Cite this

@article{5002457825f348568ef9a37bd24af7cf,

title = "Sound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs",

abstract = "We introduce the class of normal bilattice-based annotated first-order logic programs (BAPs) and develop declarative and operational semantics for them. In particular, SLD-resolution for these programs is defined and its soundness and completeness established.",

keywords = "Annotated logic programming, bilattices, declarative and operational semantics, SLD-resolution",

author = "Ekaterina Komendantskaya and Seda, {Anthony Karel}",

year = "2009",

month = jan,

day = "2",

doi = "10.1016/j.entcs.2008.12.071",

language = "English",

volume = "225",

pages = "141--159",

journal = "Electronic Notes in Theoretical Computer Science",

issn = "1571-0661",

publisher = "Elsevier",

number = "C",

}

TY - JOUR

T1 - Sound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs

AU - Komendantskaya, Ekaterina

AU - Seda, Anthony Karel

PY - 2009/1/2

Y1 - 2009/1/2

N2 - We introduce the class of normal bilattice-based annotated first-order logic programs (BAPs) and develop declarative and operational semantics for them. In particular, SLD-resolution for these programs is defined and its soundness and completeness established.

AB - We introduce the class of normal bilattice-based annotated first-order logic programs (BAPs) and develop declarative and operational semantics for them. In particular, SLD-resolution for these programs is defined and its soundness and completeness established.

KW - Annotated logic programming

KW - bilattices

KW - declarative and operational semantics

KW - SLD-resolution

UR - http://www.scopus.com/inward/record.url?scp=58149301526&partnerID=8YFLogxK

U2 - 10.1016/j.entcs.2008.12.071

DO - 10.1016/j.entcs.2008.12.071

M3 - Article

AN - SCOPUS:58149301526

SN - 1571-0661

VL - 225

SP - 141

EP - 159

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

IS - C

ER -

Sound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

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

Cite this

Sound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Projects

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

Cite this