다중혈관 관상동맥 환자에서 y-문합을 이용하여 양쪽 내흉동맥만을 사용한 우회술의 조기 성적

Stochastic Constraint Satisfaction Problems (SCSPs) are a powerful modeling framework for problems under uncertainty. To solve them is a P-Space task. The only solution approach to date compiles down SCSPs into classical CSPs. This allows the reuse of classical constraint solvers to solve SCSPs, but at the cost of increased space requirements and weak constraint propagation. This paper tries to overcome some of these drawbacks by automatically synthesizing filtering algorithms for global chance-constraints. These filtering algorithms are parameterized by propagators for the deterministic version of the chance-constraints. This approach allows the reuse of existing propagators in current constraint solvers and it enhances constraint propagation. Experiments show the benefits of this novel approach.

Synthesizing Filtering Algorithms for Global Chance-Constraints

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

/pdf/multi-paradigm-declarative-languages-4p36bxl5x6.pdf

Multi-paradigm declarative languages

A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems

Functional logic programming languages combine the most important declarative programming paradigms, and attempts to combine these paradigms have a long history. The declarative multi-paradigm language Curry is influenced by recent advances in the foundations and implementation of functional logic languages. The development of Curry is an international initiative intended to provide a common platform for the research, teaching, and application of integrated functional logic languages. This paper surveys the foundations of functional logic programming that are relevant for Curry, the main features of Curry, and extensions and applications of Curry and functional logic programming.

/pdf/functional-logic-programming-from-theory-to-curry-z3o4zjyc3r.pdf

Functional Logic Programming: From Theory to Curry

In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP(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 TOY(FD), an implementation for CFLPFD(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 CFLP(FD).

Constraint Functional Logic Programming over Finite Domains

The logic programming language Datalog has been extensively researched as a query language for deductive databases. Although similar to Prolog, the Datalog operational mechanisms are more intricate, leading to computations quite hard to debug by traditional approaches. In this paper, we present a theoretical framework for debugging Datalog programs based on the ideas of declarative debugging. In our setting, a debugging session starts when the user detects an unexpected answer for some query, and ends with the debugger pointing to either an erroneous predicate or to a set of mutually recursive predicates as the cause of the unexpected answer. Instead of representing the computations by means of trees, as usual in declarative debugging, we propose graphs as a more convenient structure in the case of Datalog, proving formally the soundness and completeness of the debugging technique. We also present a debugging tool implemented in the publicly available deductive database system DES following this theoretical framework.

/pdf/a-theoretical-framework-for-the-declarative-debugging-of-1i5qqkrp2q.pdf

A Theoretical Framework for the Declarative Debugging of Datalog Programs

This paper describes a proposal to incorporate finite domain constraints in a functional logic system. The proposal integrates functions, higher-order patterns, partial applications, non-determinism, logical variables, currying, types, lazyness, domain variables, constraints and finite domain propagators.The paper also presents TOY(FD), an extension of the functional logic language TOYthat provides FD constraints, and shows, by examples, that TOY(FD) combines the power ofconstraint logic programming with the higher-order characteristics of functional logic programming.

/pdf/solving-combinatorial-problems-with-a-constraint-functional-25vwsj3r4z.pdf

Solving Combinatorial Problems with a Constraint Functional Logic Language

http://www.fdi.ucm.es/profesor/fernan/fsp/Sae11a.pdf

DES: A Deductive Database System

In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP(ℱ&#119863;) with a lazy functional logic programming language which seamlessly embodies finite domain (ℱ&#119863;) constraints. This proposal increases the expressiveness and power of constraint logic programming over finite domains (CLP(ℱ&#119863;) 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 &#119879;&#119874;&#119884; (ℱ&#119863;), an implementation for CFLP(ℱ&#119863;), and a comparison of our approach with respect to CLP(ℱ&#119863;) 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(ℱ&#119863;) systems and that clearly outperforms the closer approach to CFLP(ℱ&#119863;).

/pdf/constraint-functional-logic-programming-over-finite-domains-2is2e26b48.pdf

Fernando Sáenz-Pérez

Papers

Constraint Functional Logic Programming over Finite Domains

A Theoretical Framework for the Declarative Debugging of Datalog Programs

Solving Combinatorial Problems with a Constraint Functional Logic Language

DES: A Deductive Database System

Constraint functional logic programming over finite domains