A declarative approach for first-order built-in's of Prolog

DOI10.1007/BF01190828zbMATH Open0815.68035MaRDI QIDQ1328181FDOQ1328181

Authors: Krzysztof R. Apt, Elena Marchiori, Catuscia Palamidessi 

Publication date: 4 July 1994

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Recommendations

• Proving termination properties of prolog programs: A semantic approach
• Towards a logical semantics for pure Prolog
• scientific article; zbMATH DE number 19144
• scientific article; zbMATH DE number 65740
• scientific article; zbMATH DE number 3924108

zbMATH Keywords

Prolog programsnon-standard declarative semantic

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• The Semantics of Predicate Logic as a Programming Language
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reasoning about termination of pure Prolog programs
• A declarative approach for first-order built-in's of Prolog
• A new definition of SLDNF-resolution
• Declarative modeling of the operational behavior of logic languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• A declarative approach for first-order built-in's of Prolog
• Termination of floating-point computations
• Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl)
• On proving confluence modulo equivalence for Constraint Handling Rules
• The BinProlog experience: architecture and implementation choices for continuation passing Prolog and first-class logic engines

This page was built for publication: A declarative approach for first-order built-in's of Prolog

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