the proceedings contain 18 papers. the special focus in this conference is on constraints, Program Transformation and Analysis. the topics include: the essence of XML;to the gates of HAL;functionallogic design patter...
ISBN:
(纸本)3540442332
the proceedings contain 18 papers. the special focus in this conference is on constraints, Program Transformation and Analysis. the topics include: the essence of XML;to the gates of HAL;functionallogic design patterns;on consistency and width notions for constraint programs with algebraic constraints;solving mixed quantified constraints over a domain based on real numbers and herbrand terms;on the correctness of the factoring transformation;lambda-lifting in quadratic time;the well-founded semantics in normal logic programs with uncertainty;monadic and CPS transformations into the linear lambda calculus;coinductive interpreters for process calculi;descendants and head normalization of higher-order rewrite systems;narrowing failure in functionallogicprogramming;system description and performance evaluation;dynamic-cut with definitional trees;the head condition and polymorphic recursion;structural abstraction and application in logicprogramming and a functional calculus for scientific discovery.
the paper introduces the SILK tool-set, a tool-set based on constraintlogicprogramming techniques for the support of application integration. We focus on the Integrator component of SILK, which provides tools and te...
详细信息
ISBN:
(纸本)3540439307
the paper introduces the SILK tool-set, a tool-set based on constraintlogicprogramming techniques for the support of application integration. We focus on the Integrator component of SILK, which provides tools and techniques to support the process of model evolution: unification of the models of the information sources and their mapping Onto the conceptual models of their user-groups. We present the basic axchitecture of SILK and introduce the SILK Knowledge Base, which stores the meta-information describing the information sources. the SILK Knowledge Base can contain both object-oriented and ontology-based descriptions, annotated withconstraints. the constraints can be used both for expressing the properties of the objects and for providing mappings between them. We give a brief introduction to SILan, the language for Knowledge Base presentation and maintenance. We describe the implementation status of SILK and give a simple example, which shows how constraints and constraint reasoning techniques can be used to support model evolution.
Declarative debugging has been proposed as a suitable technique for developing debuggers in the context of declarative languages. However, to become really useful debuggers must be able to deal withthose parts of the...
详细信息
In this paper, an airport departure scheduling tool for aircraft is presented based on constraint satisfaction techniques. Airports are getting more and more congested withthe available runway configuration as one of...
详细信息
In this paper we present a framework to program autonomous robots in the declarative multi-paradigm language Curry. this is an experiment to use high-level declarative programming languages for the programming of embe...
详细信息
In this work we provide a semantic description of functionallogic languages covering notions like laziness, sharing, and non-determinism. Such a semantic description is essential, for instance, to have appropriate la...
详细信息
A language with a programmable type system is vital for the construction of an embedded domain specific language (EDSL). Driven by the requirements posed by the implementation of an EDSL for server-side Web scripting,...
详细信息
Classical constraint Handling Rules (CHR) provide a powerful tool for specifying and implementing constraint solvers and programs. the rules of CHR rewrite constraints (non-deterministically) into simpler ones until t...
详细信息
Systems biology is a new area in biology that aims at achieving a systems-level understanding of biological systems. While current genome projects provide a huge amount of data on genes or proteins, lots of research i...
详细信息
ISBN:
(纸本)3540439307
Systems biology is a new area in biology that aims at achieving a systems-level understanding of biological systems. While current genome projects provide a huge amount of data on genes or proteins, lots of research is still necessary to understand how the different parts of a biological system interact in order to perform complex biological functions. Computational models that help to analyze, explain or predict the behavior of biological systems play a crucial role in systems biology. the goal of this paper is to show that-hybrid concurrent constraintprogramming [11] may be a promising alternative to existing modeling approaches in systems biology. Hybrid cc is, a declarative compositional programming language with a well-defined semantics. It allows one to model and simulate the dynamics of hybrid systems, which exhibit both discrete and continuous change. We show. that Hybrid cc can be used naturally to model a variety of biological phenomena, such as reaching thresholds, kinetics, gene interaction or biological pathways.
We propose a new way of extending logicprogramming (LP) for reasoning with uncertainty. Probabilistic finite domains (Pfd) capitalise on ideas introduced by constraint LP, on how to extend the reasoning capabilities ...
详细信息
ISBN:
(纸本)3540439307
We propose a new way of extending logicprogramming (LP) for reasoning with uncertainty. Probabilistic finite domains (Pfd) capitalise on ideas introduced by constraint LP, on how to extend the reasoning capabilities of the LP engine. Unlike other approaches to the field, Pfd syntax can be intuitively related to the axioms defining Probability and to the underlying concepts of Probability theory, (PT) such as sample space, events, and probability function. Probabilistic variables are core computational units and have two parts. Firstly, a finite domain, which at each stage holds the collection of possible values that can be assigned to the variable, and secondly a probabilistic function that can be used to assign probabilities to the elements of the domain. the two constituents are kept in isolation from each other. there are two benefits in such an approach. Firstly, that propagation techniques from finite domains research are retained, since a domain’s representation is not altered. thus, a probabilistic variable continues to behave as a finite domain variable. Secondly, that the probabilistic function captures the probabilistic behaviour of the variable in a manner which is, to a large extent, independent of the particular domain values. the notion of events as used in PT can be captured by LP predicates containing probabilistic variables and the derives operator (⊢) as defined in LP. Pfd stores hold conditional constraints which are a computationally useful restriction of conditional probability from PT. Conditional constraints are defined by D1: π1⊕...⊕Dn: πn | Q1 ∧...∧ Qm where, Di and Qj are predicates and each πi is a probability measure (0 ≤ πi ≤ 1, 1 ≤ i ≤ n, 1 ≤ j ≤ m). the conjuction of Qj’s qualifies probabilistic knowledge about Di<
暂无评论