Constraint logic programming with a relational machine

DOI10.1007/s00165-016-0369-zzbMath1355.68035OpenAlexW2340975840MaRDI QIDQ511023

Emilio Jesús Gallego Arias, Julio Mariño, James Lipton

Publication date: 14 February 2017

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-016-0369-z

zbMATH Keywords

relation algebrarewritingsemanticslogic programmingconstraint programming

Mathematics Subject Classification ID

Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Solving quantifier-free first-order constraints over finite sets and binary relations

Uses Software

• CoALP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the algebraic structure of declarative programming languages
• C-expressions: A variable-free calculus for equational logic programming
• A new framework for declarative programming
• Nominal unification
• Uniform proofs as a foundation for logic programming
• First-order unification using variable-free relational algebra
• Coalgebraic Derivations in Logic Programming
• Declarative Compilation for Constraint Logic Programming
• Logic Programming
• Logic Programming in Tabular Allegories

This page was built for publication: Constraint logic programming with a relational machine