A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Comparative semantics for prolog with cut
1990
Science of Computer Programming
Preserved Fulltext
Interpretation and refinement of the models of 1 lead to a Plotkin-style operational semantics and an equivalent denotational semantics for PKOLOG with cut. 0167.6423/90/$03.50 @) 1990-Elsevier Science ...
An abstract language 4 embodying the flow of control component of PROLOG including the cut operator is considered. ...
Acknowledgement Thanks are due to Jaco de Bakker, Frank de Boer, Arie de Bruin, Joost Kok, John-Jules Meyer and Jan Rutten for the fruitful discussions on preliminary versions of this paper in the seminar ...
doi:10.1016/0167-6423(90)90072-l
fatcat:2chgmw5wjnbwxkwwqghfscgbse
Continuation semantics for PROLOG with cut
[chapter]
1989
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Our aim is to provide a denotational semantics for PROLOG with cut and to prove this semantics equivalent to an operational one. ...
We present a denotational continuation semantics for PROLOG with cut. First a uniform language ,~ is studied, which captures the control flow aspects of PROLOG. ...
We thank Aart Middeldorp and the referees for reading the manuscript. We are indebted to M279 for the hospitality the authors received during the preparation of this paper. ...
doi:10.1007/3-540-50939-9_132
fatcat:grq2fyosvbbytfb2dqlanyg6bq
Page 3856 of Mathematical Reviews Vol. , Issue 98F
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
{For the entire collection see MR 98e:68003. }
98f:68050 68N17 68Q55
Stroetmann, Karl (D-SIEMRD; Munich);
Glab, Thomas (D-SIEMRD; Munich)
A declarative semantics for the PROLOG cut operator. ...
If the cut is used to implement functional predicates and if, furthermore, a certain discipline in its use is adhered to, then programs using the cut operator do possess a declarative semantics.” ...
Page 2814 of Mathematical Reviews Vol. , Issue 91E
[page]
1991
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “We present research work on the formal study of the widely-used cut operator properties in Prolog. ...
91¢:68102
91e:68102 68Q55 68N17 68T25
Billaud, Michel (F-BORD-LI)
Simple operational and denotational semantics for Prolog with cut. Theoret. Comput. Sci. 71 (1990), no. 2, 193-208. ...
From Interpreter to Logic Engine by Defunctionalization
2004
BRICS Report Series
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Starting from a continuation-based interpreter for a simple logic programming language, propositional Prolog with cut, we derive the corresponding logic engine in the form of an abstract machine. ...
Additionally, we present a direct-style interpreter of propositional Prolog expressed with control operators for delimited continuations. ...
Acknowledgments: We are grateful to Mads Sig Ager, Ma lgorzata Biernacka, Jan Midtgaard, and the anonymous referees for their comments. ...
doi:10.7146/brics.v11i5.21830
fatcat:qyrqxly2dncbrkwliamws3mesi
From Interpreter to Logic Engine by Defunctionalization
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Starting from a continuation-based interpreter for a simple logic programming language, propositional Prolog with cut, we derive the corresponding logic engine in the form of an abstract machine. ...
Additionally, we present a direct-style interpreter of propositional Prolog expressed with control operators for delimited continuations. ...
Acknowledgments We are grateful to Mads Sig Ager, Ma lgorzata Biernacka, Jan Midtgaard, and the anonymous referees for their comments. ...
doi:10.1007/978-3-540-25938-1_13
fatcat:bozadqotlzhghms3ufjadrodoe
From Interpreter to Logic Engine by Defunctionalization
2003
BRICS Report Series
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Starting from a continuation-based interpreter for a simple logic programming language, propositional Prolog with cut, we derive the corresponding logic engine in the form of an abstract machine. ...
Additionally, we present a direct-style interpreter of propositional Prolog expressed with control operators for delimited continuations.<br /><br />Superseded by BRICS-RS-04-5. ...
Acknowledgments We are grateful to Mads Sig Ager, Ma lgorzata Biernacka, Jan Midtgaard, and the anonymous referees for their comments. ...
doi:10.7146/brics.v10i25.21954
fatcat:mmeqvg54zjbnjpnb4ou3ahtwqi
A structured alternative to Prolog with simple compositional semantics
2011
Theory and Practice of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
A simple interpreter for Prolog in the alternative language, and a definition ofuntilin Prolog, establish the identical expressive power of the two languages. ...
We propose instead to redesign Prolog around structured alternatives to the cut and clauses, keeping the expressive power and computation model but with a compositional denotational semantics over much ...
cut we write an interpreter for Prolog in our cut-free language. ...
doi:10.1017/s1471068411000202
fatcat:w35de7cjm5g3jkpi7pof4g2d4e
Page 8274 of Mathematical Reviews Vol. , Issue 2001K
[page]
2001
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Moreover, some strictly sequential operators such as cuts may not be handled as easily as in Prolog. In this paper, we propose a hybrid method to resolve infinite loops and redundant computations. ...
cuts as effectively as Prolog; and (2) it is sound and complete for positive logic programs with the bounded-term-size property. ...
Denotational and operational semantics for prolog
1988
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Operational Semantics for PROLOG with Cut The interpreter has to be modified slightly to deal with cut. ...
Operational Semantics for Cut-Free PROLOG The operational semantics is given by an interpreter that repeatedly transforms a state encoding a "leftmost" SLD tree traversed as follows: At any point, select ...
Thus, the theorem holds. (4) \k # nil A 7cJrago: Then, from (T2.5) in the definition of trun, (D) reduces to ...
doi:10.1016/0743-1066(88)90007-6
fatcat:y23b2e2cijagje5pewczsjwgrm
Choice Disjunctive Queries in Logic Programming
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
One of the long-standing research problems on logic programming is to treat the cut predicate in a logical, high-level way. ...
These goals have the following intended semantics: choose the true disjunct G_i and execute G_i where i (= 0 or 1), while discarding the unchosen disjunct. ...
Of course, we can specify mutually exclusive goals using cut in Prolog, but it is well-known that cuts complicates the declarative meaning of the program. ...
arXiv:1211.6940v3
fatcat:itd2jwqxk5hjlfmblae6vpk76i
Compositional operational semantics for Prolog programs
1992
New generation computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
To relate operational semantics of logic programs to its declarative semantics, we have to rely on SLD-trees. ...
In this way, SLD-boxes connect the semantics of Prolog programs to the Box Model, the most widely used aid in tracing Prolog programs. ...
We are grateful to the referees for suggestions for improvement. ...
doi:10.1007/bf03037941
fatcat:x2pqwfxadjau5hadc5qqnsvwuu
Proving termination properties of prolog programs: A semantic approach
1992
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This proof does not extend directly to Prolog programs with cuts. For Prolog with cut, we would need a more sophisticated operational semantics. ...
Jones and Mycroft's motivation for providing a formal operational semantics for Prolog is its potential use for deriving correct Prolog compilers. Both semantics are extended to handle the cut. ...
doi:10.1016/0743-1066(92)90045-5
fatcat:5jzibg4plnhrbn3ydzjjnjk3ju
Measuring Coverage of Prolog Programs Using Mutation Testing
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we introduce a framework for Prolog programs measuring test coverage using mutations. We elaborate the main ideas of mutation testing and transfer them to logic programs. ...
To do so, we discuss the usefulness of different mutations in the context of Prolog and empirically evaluate them in a new mutation testing framework on different examples. ...
In Prolog, there are two kinds of cuts: A cut is called red, when its removal would create a semantically non-equivalent program. ...
arXiv:1808.07725v1
fatcat:nygxqcf7tjfdvigm6qcicraf3a
Page 1651 of Mathematical Reviews Vol. , Issue 94c
[page]
1994
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The cut operator is responsible for introducing unsoundness into the declarative semantics of Prolog. ...
In the paper a pre- scriptive specification of a new cut operator is given to guarantee the soundness of Prolog. ...
« Previous
Showing results 1 — 15 out of 2,302 results