Semantics for Prolog with Cut – Revisited

Kriener, Jael; King, Andy

doi:10.1007/978-3-319-07151-0_17

Cited by 3 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, the application of certified/mechanized approaches came into focus as well. In particular, in [19] the equivalence of a few differently defined operational semantics for pure Prolog is proven, and in [18] a denotational semantics for Prolog with cut is presented; both works provide Coq-mechanised proofs. It is interesting that the former one also advocates the use of higher-order abstract syntax.…”

Section: Related Workmentioning

confidence: 99%

Certified Semantics for Relational Programming

Rozplokhas¹,

Vyatkin²,

Boulytchev³

2020

Preprint

View full text Add to dashboard Cite

We present a formal study of semantics for relational programming language miniKanren. First, we formulate denotational semantics which corresponds to the minimal Herbrand model for definite logic programs. Second, we present operational semantics which models the distinctive feature of miniKanren implementation -interleaving, -and prove its soundness and completeness w.r.t. the denotational semantics. Our development is supported by a Coq specification, from which a reference interpreter can be extracted. We also derive from our main result a certified semantics (and a reference interpreter) for SLD resolution with cut and prove its soundness.

show abstract

Section: Related Workmentioning

confidence: 99%

Certified Semantics for Relational Programming

Rozplokhas¹,

Vyatkin²,

Boulytchev³

2020

Preprint

View full text Add to dashboard Cite

show abstract

“…Usually the semantics of the cut is described in terms of explicit representation of computation states, stacks of backtrack points, numerical labels related to cut invocations etc, like in [Bil90, dV89, SGS + 10, And03]. Some approaches require transforming programs into a special syntax [Bil90,KK14], or restrict the class of programs dealt with ([KK14] requires so-called cutstratification). Some approaches describe only approximations of the semantics.…”

Section: Introductionmentioning

confidence: 99%

“…The semantics of [SGS + 10] does not distinguish success from failure, as the purpose of the semantics is termination analysis. The semantics of [KK14] may describe answers which actually are not computed; such inaccuracy is acceptable as the semantics is intended as a basis for abstract interpretation, which introduces inaccuracies anyway. Of course such semantics is inadequate for reasoning about program completeness.…”

Section: Introductionmentioning

confidence: 99%

Proving completeness of logic programs with the cut

Drabent

2017

Form. Asp. Comput.

View full text Add to dashboard Cite

Abstract. Completeness of a logic program means that the program produces all the answers required by its specification. The cut is an important construct of programming language Prolog. It prunes part of the search space, this may result in a loss of completeness. This paper proposes a way of proving completeness of programs with the cut. The semantics of the cut is formalized by describing how SLD-trees are pruned. A sufficient condition for completeness is presented, proved sound, and illustrated by examples.

show abstract