Implementing Relational Specifications in a Constraint Functional Logic Language

DOI10.1016/j.entcs.2007.01.011zbMath1279.68036OpenAlexW2126395707MaRDI QIDQ2873796

Rudolf Berghammer, Sebastian Fischer

Publication date: 24 January 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.01.011

zbMATH Keywords

relation algebrafunctional programmingconstraint solvingrelational specificationsCurry

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items

Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures ⋮ Functional Logic Programming: From Theory to Curry ⋮ Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures

Uses Software

• RelView
• Haskell
• TituRel
• Curry
• PAKCS

Cites Work

• Relational methods in computer science. 8th international seminar on relational methods in computer science, 3rd international workshop on applications of Kleene algebra, and Workshop of COST Action 274: TARSKI, St. Catharines, ON, Canada, February 22--26, 2005. Selected revised papers.
• Theory and applications of relational structures as knowledge instruments. COST Action 274, TARSKI. Revised papers
• Relational depth-first-search with applications
• Two graph algorithms derived
• Graph-Based Algorithms for Boolean Function Manipulation
• The integration of functions into logic programming: From theory to practice
• Relational Methods in Computer Science
• Semigroupoid Interfaces for Relation-Algebraic Programming in Haskell
• Computer Algebra in Scientific Computing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item