Solving Combinatorial Problems with a Constraint Functional Logic Language

Fernández, Antonio J.; Hortalá-González, Teresa; Sáenz-Pérez, Fernando

doi:10.1007/3-540-36388-2_22

Cited by 14 publications

(9 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Furthermore, T OY(F D) is around one and three times faster than PAKCS, its closer CF LP (F D) implementation. Practical applications of T OY(F D) can be found in (Fernández et al 2002;Fernández et al 2003).…”

Section: Discussionmentioning

confidence: 99%

Constraint functional logic programming over finite domains

Fernández¹,

Hortalá-González²,

Sáenz-Pérez³

et al. 2007

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CF LP (FD) ) with a lazy functional logic programming language which seamlessly embodies finite domain (FD) constraints. This proposal increases the expressiveness and power of constraint logic programming over finite domains (CLP (FD) ) by combining functional and relational notation, curried expressions, higher-order functions, patterns, partial applications, non-determinism, lazy evaluation, logical variables, types, domain variables, constraint composition, and finite domain constraints.We describe the syntax of the language, its type discipline, and its declarative and operational semantics. We also describe T OY(FD), an implementation for CF LP (FD) , and a comparison of our approach with respect to CLP (FD) from a programming point of view, showing the new features we introduce. And, finally, we show a performance analysis which demonstrates that our implementation is competitive with respect to existing CLP (FD) systems and that clearly outperforms the closer approach to CF LP (FD) .

show abstract

Section: Discussionmentioning

confidence: 99%

Constraint functional logic programming over finite domains

Fernández¹,

Hortalá-González²,

Sáenz-Pérez³

et al. 2007

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…Planned applications will focus on practical instances of the CF LP (D) scheme, supporting arithmetic constraints over the real numbers and finite domain constraints. In particular, we plan to formalize the work started in [10] as an instance of the CF LP (D) scheme, and to investigate practical constraint solving methods and applications of the resulting language.…”

Section: Discussionmentioning

confidence: 99%

A lazy narrowing calculus for declarative constraint programming

López-Fraguas

Rodríguez-Artalejo

Vírseda

2004

Proceedings of the 6th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming

View full text Add to dashboard Cite

The new generic scheme CF LP (D) has been recently proposed in [24] as a logical and semantic framework for lazy constraint functional logic programming over a parametrically given constraint domain D. In this paper we extend such framework with a suitable operational semantics, which relies on a new constrained lazy narrowing calculus for goal solving parameterized by a constraint solver over the given domain D. This new calculus is sound and strongly complete w.r.t. the declarative semantics of CF LP (D) programs, which was formalized in [24] by means of a Constraint Rewriting Logic CRW L(D).

show abstract

“…Thus, typical applications of constraint logic programming can be covered and combined with features of lazy higherorder programming [10,19,30,31,67,70,77]. As an example demonstrating the compactness obtained by combining constraint programming with higher-order features, consider a solver for SuDoku puzzles 6 with finite domain constraints.…”

Section: Constraintsmentioning

confidence: 99%

Multi-paradigm Declarative Languages

Hanus¹

Logic Programming

View full text Add to dashboard Cite

Abstract. Declarative programming languages advocate a programming style expressing the properties of problems and their solutions rather than how to compute individual solutions. Depending on the underlying formalism to express such properties, one can distinguish different classes of declarative languages, like functional, logic, or constraint programming languages. This paper surveys approaches to combine these different classes into a single programming language.

show abstract

Solving Combinatorial Problems with a Constraint Functional Logic Language

Cited by 14 publications

References 7 publications

Constraint functional logic programming over finite domains

Constraint functional logic programming over finite domains

A lazy narrowing calculus for declarative constraint programming

Multi-paradigm Declarative Languages

Contact Info

Product

Resources

About