A fixed point semantics for logic programs extended with cuts

Wim Vanhoof; Remko Tronçon; Maurice Bruynooghe

doi:10.1007/3-540-45013-0_18

A fixed point semantics for logic programs extended with cuts

Wim Vanhoof, Remko Tronçon, Maurice Bruynooghe

Research output: Contribution in Book/Catalog/Report/Conference proceeding › Chapter

Abstract

In this paper, we develop a bottom-up fixed point semantics for pure Prolog programs extended with !/0 that allows to reconstruct the operational semantics of a particular goal. Our semantics captures both the order in which solutions are computed by SLD-resolution and their multiplicity.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Michael Leuschel
Publisher	Springer Verlag
Pages	238-257
Number of pages	20
Volume	2664
ISBN (Electronic)	9783540404385
DOIs	https://doi.org/10.1007/3-540-45013-0_18
Publication status	Published - 2003
Externally published	Yes

Publication series

Name	Logic Based Program Synthesis and Transformation, LOPSTR 2002

Access to Document

10.1007/3-540-45013-0_18

Cite this

Vanhoof, W., Tronçon, R., & Bruynooghe, M. (2003). A fixed point semantics for logic programs extended with cuts. In M. Leuschel (Ed.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2664, pp. 238-257). (Logic Based Program Synthesis and Transformation, LOPSTR 2002 ). Springer Verlag. https://doi.org/10.1007/3-540-45013-0_18

Vanhoof, Wim ; Tronçon, Remko ; Bruynooghe, Maurice. / A fixed point semantics for logic programs extended with cuts. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Michael Leuschel. Vol. 2664 Springer Verlag, 2003. pp. 238-257 (Logic Based Program Synthesis and Transformation, LOPSTR 2002 ).

@inbook{d59094fd04c14c06a6666e3e297cafa2,

title = "A fixed point semantics for logic programs extended with cuts",

abstract = "In this paper, we develop a bottom-up fixed point semantics for pure Prolog programs extended with !/0 that allows to reconstruct the operational semantics of a particular goal. Our semantics captures both the order in which solutions are computed by SLD-resolution and their multiplicity.",

author = "Wim Vanhoof and Remko Tron{\c c}on and Maurice Bruynooghe",

year = "2003",

doi = "10.1007/3-540-45013-0_18",

language = "English",

volume = "2664",

series = "Logic Based Program Synthesis and Transformation, LOPSTR 2002 ",

publisher = "Springer Verlag",

pages = "238--257",

editor = "Michael Leuschel",

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

address = "Germany",

}

Vanhoof, W, Tronçon, R & Bruynooghe, M 2003, A fixed point semantics for logic programs extended with cuts. in M Leuschel (ed.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 2664, Logic Based Program Synthesis and Transformation, LOPSTR 2002 , Springer Verlag, pp. 238-257. https://doi.org/10.1007/3-540-45013-0_18

A fixed point semantics for logic programs extended with cuts. / Vanhoof, Wim; Tronçon, Remko; Bruynooghe, Maurice.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Michael Leuschel. Vol. 2664 Springer Verlag, 2003. p. 238-257 (Logic Based Program Synthesis and Transformation, LOPSTR 2002 ).

Research output: Contribution in Book/Catalog/Report/Conference proceeding › Chapter

TY - CHAP

T1 - A fixed point semantics for logic programs extended with cuts

AU - Vanhoof, Wim

AU - Tronçon, Remko

AU - Bruynooghe, Maurice

PY - 2003

Y1 - 2003

N2 - In this paper, we develop a bottom-up fixed point semantics for pure Prolog programs extended with !/0 that allows to reconstruct the operational semantics of a particular goal. Our semantics captures both the order in which solutions are computed by SLD-resolution and their multiplicity.

AB - In this paper, we develop a bottom-up fixed point semantics for pure Prolog programs extended with !/0 that allows to reconstruct the operational semantics of a particular goal. Our semantics captures both the order in which solutions are computed by SLD-resolution and their multiplicity.

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

U2 - 10.1007/3-540-45013-0_18

DO - 10.1007/3-540-45013-0_18

M3 - Chapter

VL - 2664

T3 - Logic Based Program Synthesis and Transformation, LOPSTR 2002

SP - 238

EP - 257

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

A2 - Leuschel, Michael

PB - Springer Verlag

ER -

Vanhoof W, Tronçon R, Bruynooghe M. A fixed point semantics for logic programs extended with cuts. In Leuschel M, editor, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2664. Springer Verlag. 2003. p. 238-257. (Logic Based Program Synthesis and Transformation, LOPSTR 2002 ). doi: 10.1007/3-540-45013-0_18

A fixed point semantics for logic programs extended with cuts

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this