A mathematical definition of full Prolog

DOI10.1016/0167-6423(95)00006-EzbMath0832.68022OpenAlexW2131540458MaRDI QIDQ1899138

Egon Börger, Dean Rosenzweig

Publication date: 20 February 1996

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(95)00006-e

zbMATH Keywords

logic programmingProlog

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (11)

First-order theories for pure Prolog programs with negation ⋮ Neutralizing Semantic Ambiguities of Function Block Architecture by Modeling with ASM ⋮ A transformation of propositional Prolog programs into classical logic ⋮ A Survey of the Proof-Theoretic Foundations of Logic Programming ⋮ Operational semantics for declarative multi-paradigm languages ⋮ Towards proving type safety of .NET CIL ⋮ Towards proving type safety of \(\mathrm{C}^{\#}\) ⋮ Ibn Sīnā on Analysis: 1. Proof Search. Or: Abstract State Machines as a Tool for History of Logic ⋮ Abstract state machines: a unifying view of models of computation and of system design frameworks ⋮ PROLOG'S CONTROL CONSTRUCTS IN A FUNCTIONAL SETTING — AXIOMS AND IMPLEMENTATION ⋮ Computation on structures. Behavioural theory, logic, complexity

This page was built for publication: A mathematical definition of full Prolog