A non-definability result for a predicational language with the usual control

DOI10.1142/S0129054101000540MaRDI QIDQ5249265zbMATH OpenFDO

Authors Birgit Elbl

Publication date 30 April 2015

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

controldenotational semanticsexpressivenesspure Prolog

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 1531362
• Denotational and operational semantics for prolog
• scientific article; zbMATH DE number 4078852
• Simple operational and denotational semantics for Prolog with cut
• Comparative semantics for prolog with cut

Cites work

• A Machine-Oriented Logic Based on the Resolution Principle
• A declarative semantics for depth-first logic programs1The research reported here is based on Ref. [12].1
• Denotational and operational semantics for prolog

Cited in

(1)

• The infimal controllable and N-observable superpredicate of a given predicate

This page was built for publication: A non-definability result for a predicational language with the usual control

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249265)