Implementing relational specifications in a constraint functional logic language

DOI10.1016/J.ENTCS.2007.01.011MaRDI QIDQ2873796zbMATH OpenOpenAlexFDO

Authors 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

constraint solvingCurryfunctional programmingrelation algebrarelational specifications

Mathematics Subject Classification ID

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

Recommendations

• Relational Methods in Computer Science
• Functional Logic Programming: From Theory to Curry
• scientific article; zbMATH DE number 1630028
• Constraint functional logic programming over finite domains
• From relational specifications to logic programs

Cites work

• Computer Algebra in Scientific Computing
• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 1692898 (Why is no real title available?)
• scientific article; zbMATH DE number 5007864 (Why is no real title available?)
• scientific article; zbMATH DE number 1952947 (Why is no real title available?)
• scientific article; zbMATH DE number 1954119 (Why is no real title available?)
• scientific article; zbMATH DE number 234018 (Why is no real title available?)
• Relational depth-first-search with applications
• Relational Methods in Computer Science
• 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
• Semigroupoid Interfaces for Relation-Algebraic Programming in Haskell
• The integration of functions into logic programming: From theory to practice
• Theory and applications of relational structures as knowledge instruments. COST Action 274, TARSKI. Revised papers
• Two graph algorithms derived

Cited in

(11)

• Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
• Relational constraint solving in SMT
• Handling relations over finite domains in the rule-based system ELAN
• From relational specifications to logic programs
• Simple rectangle-based functional programs for computing reflexive-transitive closures
• Functional Logic Programming: From Theory to Curry
• The additional difficulties for the automatic synthesis of specifications posed by logic features in functional-logic languages
• An Institution for Imperative RSL Specifications
• Implication and Axiomatization of Functional Constraints on Patterns with an Application to the RDF Data Model
• Semigroupoid Interfaces for Relation-Algebraic Programming in Haskell
• A functorial framework for constraint normal logic programming

Describes a project that uses

Uses Software

• RelView
• Haskell
• TituRel
• Curry
• PAKCS

This page was built for publication: Implementing relational specifications in a constraint functional logic language

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