Sémantique logique et dénotationnelle des interpréteurs PROLOG
From MaRDI portal
Publication:3798220
DOI10.1051/ita/1988220100031zbMath0652.68025OpenAlexW2398856364MaRDI QIDQ3798220
Publication date: 1988
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92298
Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)
Related Items (3)
Complete extension of general logic programs ⋮ Négation constructive et axiomatique interne ⋮ Is there an axiomatic semantics for standard pure Prolog?
Cites Work
- Unnamed Item
- Closures and fairness in the semantics of programming logic
- The recursion-theoretic complexity of the semantics of predicate logic as a programming language
- A kripke-kleene semantics for logic programs*
- Top-down semantics of fair computations of logic programs
- A deterministic prolog fixpoint semantics
- The consistency of negation as failure
- Negation as failure. II
- Contributions to the Theory of Logic Programming
- The Semantics of Predicate Logic as a Programming Language
- A Machine-Oriented Logic Based on the Resolution Principle
This page was built for publication: Sémantique logique et dénotationnelle des interpréteurs PROLOG