Proving termination properties of prolog programs: A semantic approach

DOI10.1016/0743-1066(92)90045-5zbMath0754.68080OpenAlexW1973337882MaRDI QIDQ4015950

Marianne Baudinet

Publication date: 10 November 1992

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-1066(92)90045-5

zbMATH Keywords

minimizationcutstructural inductionfirst order propertiesfirst order theorem provingfunctional semantics of Prolog

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17)

Related Items (4)

Verifying termination and reduction properties about higher-order logic programs ⋮ MetateM: An introduction ⋮ A logical semantics for depth-first Prolog with ground negation ⋮ Proof methods of declarative properties of definite programs

This page was built for publication: Proving termination properties of prolog programs: A semantic approach