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

DOI10.1007/BF01190828zbMath0815.68035MaRDI QIDQ1328181

Krzysztof R. Apt, Catuscia Palamidessi, Elena Marchiori

Publication date: 4 July 1994

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

zbMATH Keywords

Prolog programsnon-standard declarative semantic

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (3)

A declarative approach for first-order built-in's of Prolog ⋮ Termination of floating-point computations ⋮ On proving confluence modulo equivalence for Constraint Handling Rules

Cites Work

• Declarative modeling of the operational behavior of logic languages
• Reasoning about termination of pure Prolog programs
• A declarative approach for first-order built-in's of Prolog
• The Semantics of Predicate Logic as a Programming Language
• A new definition of SLDNF-resolution
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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