Pure Prolog Execution in 21 Rules

Simple item page
dc.creatorKulas, Marija
dc.date2003-10-10
dc.date.accessioned2026-07-07T03:20:26Z
dc.date.available2026-07-07T03:20:26Z
dc.descriptionA simple mathematical definition of the 4-port model for pure Prolog is given. The model combines the intuition of ports with a compact representation of execution state. Forward and backward derivation steps are possible. The model satisfies a modularity claim, making it suitable for formal reasoning.
dc.description15 pages. Appeared in Proc. of the 5th Workshop on Rule-Based Constraint Reasoning and Programming (RCoRP'03), within CP'03, Kinsale, September 2003
dc.identifierhttps://arxiv.org/abs/cs/0310020
dc.identifierhttp://arxiv.org/abs/cs/0310020
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31826
dc.subjectProgramming Languages
dc.subjectLogic in Computer Science
dc.subjectF.3.2; F.3.1; D.2.5; I.2.3
dc.titlePure Prolog Execution in 21 Rules
dc.typetext

Files

Collections

arXiv