Constraint functional logic programming over finite domains

DOI10.1017/S1471068406002924zbMATH Open1129.68020MaRDI QIDQ5309079FDOQ5309079

A. J. Fernández, F. Sáenz-Pérez, R. del Vado Vírseda, T. Hortalá-González

Publication date: 9 October 2007

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

performance analysis

Mathematics Subject Classification ID

Logic programming (68N17) Functional programming and lambda calculus (68N18)

Cites Work

• A needed narrowing strategy
• Narrowing based procedures for equational disunification
• Compiling constraints in clp(FD)
• A deterministic lazy narrowing calculus
• Towards a meaning of life
• An approach to declarative programming based on a rewriting logic
• Logic programming in the context of multiparadigm programming: the Oz experience

Cited In (7)

• Programmed search in a timetabling problem over finite domains
• Title not available (Why is that?)
• A functorial framework for constraint normal logic programming
• Functional Logic Programming: From Theory to Curry
• A proposal for the cooperation of solvers in constraint functional logic programming
• A fully sound goal solving calculus for the cooperation of solvers in the CFLP scheme
• Title not available (Why is that?)

Uses Software

• Prolog

This page was built for publication: Constraint functional logic programming over finite domains

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