Semantics of Input-Consuming Logic Programs

J. Lloyd; Annalisa Bossi; Sandro Etalle; V. Dahl; U. Furbach; Sabina Rossi; M. Kerber; K.K. Lau; C. Palamidessi; L. Moniz Pereira; Y. Sagiv; P.J. Stuckey

doi:10.1007/3-540-44957-4_13

Semantics of Input-Consuming Logic Programs

J. Lloyd (Editor), Annalisa Bossi, Sandro Etalle, V. Dahl (Editor), U. Furbach (Editor), Sabina Rossi, M. Kerber (Editor), K.K. Lau (Editor), C. Palamidessi (Editor), L. Moniz Pereira (Editor), Y. Sagiv (Editor), P.J. Stuckey (Editor)

Research output: Contribution to conference › Paper › peer-review

4 Citations (Scopus)

139 Downloads (Pure)

Abstract

Input-consuming programs are logic programs with an additional restriction on the selectability (actually, on the resolvability) of atoms. This class of programs arguably allows to model logic programs employing a dynamic selection rule and constructs such as delay declarations: as shown also in [5], a large number of them are actually input-consuming. In this paper we show that - under some syntactic restrictions - the S-semantics of a program is correct and fully abstract also for input-consuming programs. This allows us to conclude that for a large class of programs employing delay declarations there exists a model-theoretic semantics which is equivalent to the operational one.

Original language	Undefined
Pages	194-208
Number of pages	15
DOIs	https://doi.org/10.1007/3-540-44957-4_13
Publication status	Published - 2000
Event	Computational Logic (CL) - London, UK Duration: 1 Jan 2000 → 1 Jan 2000

Conference

Conference	Computational Logic (CL)
Period	1/01/00 → 1/01/00

Keywords

Semantics
Dynamic scheduling
Logic Programming
EWI-983
IR-56162

Access to Document

10.1007/3-540-44957-4_13

Input-Consuming_-_bossi

Cite this

@conference{f6181af0af5f4b7f9582173b4f1357a5,

title = "Semantics of Input-Consuming Logic Programs",

abstract = "Input-consuming programs are logic programs with an additional restriction on the selectability (actually, on the resolvability) of atoms. This class of programs arguably allows to model logic programs employing a dynamic selection rule and constructs such as delay declarations: as shown also in [5], a large number of them are actually input-consuming. In this paper we show that - under some syntactic restrictions - the S-semantics of a program is correct and fully abstract also for input-consuming programs. This allows us to conclude that for a large class of programs employing delay declarations there exists a model-theoretic semantics which is equivalent to the operational one.",

keywords = "Semantics, Dynamic scheduling, Logic Programming, EWI-983, IR-56162",

author = "J. Lloyd and Annalisa Bossi and Sandro Etalle and V. Dahl and U. Furbach and Sabina Rossi and M. Kerber and K.K. Lau and C. Palamidessi and {Moniz Pereira}, L. and Y. Sagiv and P.J. Stuckey",

note = "Imported from DIES; Computational Logic (CL) ; Conference date: 01-01-2000 Through 01-01-2000",

year = "2000",

doi = "10.1007/3-540-44957-4_13",

language = "Undefined",

pages = "194--208",

}

TY - CONF

T1 - Semantics of Input-Consuming Logic Programs

AU - Bossi, Annalisa

AU - Etalle, Sandro

AU - Rossi, Sabina

A2 - Lloyd, J.

A2 - Dahl, V.

A2 - Furbach, U.

A2 - Kerber, M.

A2 - Lau, K.K.

A2 - Palamidessi, C.

A2 - Moniz Pereira, L.

A2 - Sagiv, Y.

A2 - Stuckey, P.J.

N1 - Imported from DIES

PY - 2000

Y1 - 2000

N2 - Input-consuming programs are logic programs with an additional restriction on the selectability (actually, on the resolvability) of atoms. This class of programs arguably allows to model logic programs employing a dynamic selection rule and constructs such as delay declarations: as shown also in [5], a large number of them are actually input-consuming. In this paper we show that - under some syntactic restrictions - the S-semantics of a program is correct and fully abstract also for input-consuming programs. This allows us to conclude that for a large class of programs employing delay declarations there exists a model-theoretic semantics which is equivalent to the operational one.

AB - Input-consuming programs are logic programs with an additional restriction on the selectability (actually, on the resolvability) of atoms. This class of programs arguably allows to model logic programs employing a dynamic selection rule and constructs such as delay declarations: as shown also in [5], a large number of them are actually input-consuming. In this paper we show that - under some syntactic restrictions - the S-semantics of a program is correct and fully abstract also for input-consuming programs. This allows us to conclude that for a large class of programs employing delay declarations there exists a model-theoretic semantics which is equivalent to the operational one.

KW - Semantics

KW - Dynamic scheduling

KW - Logic Programming

KW - EWI-983

KW - IR-56162

U2 - 10.1007/3-540-44957-4_13

DO - 10.1007/3-540-44957-4_13

M3 - Paper

SP - 194

EP - 208

T2 - Computational Logic (CL)

Y2 - 1 January 2000 through 1 January 2000

ER -