A Fixed Point Semantics for Logic Programs Extended with Cuts | Zendy

Wim Vanhoof | Zendy; Remko Tronçon | Zendy; Maurice Bruynooghe | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Fixed Point Semantics for Logic Programs Extended with Cuts

Author(s) -

Wim Vanhoof,

Remko Tronçon,

Maurice Bruynooghe

Publication year - 2003

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-40438-4

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

Subject(s) - computer science , operational semantics , prolog , programming language , semantics (computer science) , well founded semantics , action semantics , first order logic , formal semantics (linguistics) , fixed point , logic programming , denotational semantics , algorithm , theoretical computer science , mathematics , mathematical analysis

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.status: publishe

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research