the Timed Concurrent constraint Language tccp is a declarative synchronous concurrent language, particularly suitable for modelling reactive systems. In tccp, agents communicate and synchronise through a global constr...
详细信息
the Timed Concurrent constraint Language tccp is a declarative synchronous concurrent language, particularly suitable for modelling reactive systems. In tccp, agents communicate and synchronise through a global constraint store. It supports a notion of discrete time that allows all non-blocked agents to proceed withtheir execution simultaneously. In this paper, we present a modular architecture for the simulation of tccp programs. the tool comprises three main components. First, a set of basic abstract instructions able to model the tccp agent behaviour, the memory model needed to manage the active agents and the state of the store during the execution. Second, the agent interpreter that executes the instructions of the current agent iteratively and calculates the new agents to be executed at the next time instant. Finally, the constraint solver components which are the modules that deal withconstraints. In this paper, we describe the implementation of these components and present an example of a real system modelled in tccp.
the proceedings contain 11 papers. the special focus in this conference is on constraint, logicprogramming and functionalprogramming. the topics include: Using constraintlogicprogramming to schedule solar array op...
ISBN:
(纸本)9783319282275
the proceedings contain 11 papers. the special focus in this conference is on constraint, logicprogramming and functionalprogramming. the topics include: Using constraintlogicprogramming to schedule solar array operations on the international space station;the kb paradigm and its application to interactive configuration;a GPU implementation of the asp computation;generic matching of tree regular expressions over Haskell data types;a size-proportionate bijective encoding of lambda terms as Catalan objects endowed with arithmetic operations;simplifying probabilistic programs using computer algebra;a remote monad for programmingthe arduino and from monads to effects and back.
Solar arrays are the main source of energy at the international Space Station (ISS). Most of the time they automatically track the sun, but some ISS operations impose additional constraints on the arrays and the array...
详细信息
this book constitutes the proceedings of the Kiel Declarative programming Days, KDPD 2013, unifying the following conferences: the 20thinternational Conference on Applications of Declarative programming and Knowledge...
ISBN:
(数字)9783319089096
ISBN:
(纸本)9783319089089
this book constitutes the proceedings of the Kiel Declarative programming Days, KDPD 2013, unifying the following conferences: the 20thinternational Conference on Applications of Declarative programming and Knowledge Management (INAP 2013), the 22nd internationalworkshop on functional and (constraint) logicprogramming (WFLP 2013) and the 27thworkshop on logicprogramming (WLP 2013), held in Kiel, Germany, in September 2013. the 15 papers presented were carefully and reviewed and selected for inclusion in this book. they cover the following topics: logicprogramming, constraint problem solving, programmable logic solvers, functionalprogramming and constraintprogramming.
this tutorial provides an overview and introduction to declarative programming exploiting multiple paradigms, in particular, functional, logic, and constraintprogramming. To demonstrate the possibility to support the...
详细信息
this tutorial provides an overview and introduction to declarative programming exploiting multiple paradigms, in particular, functional, logic, and constraintprogramming. To demonstrate the possibility to support these paradigms within a single programming model, we survey the features of the declarative multi-paradigm language Curry.
Curry is a successful, general-purpose, functionallogicprogramming language that predefines a singleton type Success explicitly to support its logic component. We take the likely-controversial position that without ...
详细信息
Curry is a successful, general-purpose, functionallogicprogramming language that predefines a singleton type Success explicitly to support its logic component. We take the likely-controversial position that without Success Curry would be as much logic or more. We draw a short history and motivation for the existence of this type and justify why its elimination could be advantageous. Furthermore, we propose a new interpretation of rule application which is convenient for programming and increases the similarity between the functional component of Curry and functionalprogramming as in Haskell. We outline some related theoretical (semantics) and practical (implementation) consequences of our proposal.
Graph algorithms that are based on the computation of one or more paths are often written in an implicitly non-deterministic way, which suggests that the result of the algorithm does not depend on a particular path, b...
详细信息
Graph algorithms that are based on the computation of one or more paths are often written in an implicitly non-deterministic way, which suggests that the result of the algorithm does not depend on a particular path, but any paththat satisfies a given property. Such algorithms provide an additional challenge in typical implementations, because one needs to replace the non-determinism with an actual implementation. In this paper we explore the effects of using non-determinism explicitly in the functionallogicprogramming language Curry. To that end we consider three algorithms and implement them in a prototypically non-deterministic fashion.
We describe the design, implementation, and empirical evaluation of some automated exercises that we are using in a lecture on constraintprogramming. Topics are propositional satisfiability, resolution, the DPLL algo...
详细信息
We describe the design, implementation, and empirical evaluation of some automated exercises that we are using in a lecture on constraintprogramming. Topics are propositional satisfiability, resolution, the DPLL algorithm, with extension to DPLL(T), and FD solving with arc consistency. the automation consists of a program for grading student answers, and in most cases also a program for generating random problem instances. the exercises are part of the autotool Eassessment framework. the implementation language is Haskell. You can try them at https://***/cgi-bin/Trial. cgi?lecture=199.
the CO4 language is a Haskell-like language for specifying constraint systems over structured finite domains. A CO4 constraint system is solved by an automatic transformation into a satisfiability problem in propositi...
详细信息
the CO4 language is a Haskell-like language for specifying constraint systems over structured finite domains. A CO4 constraint system is solved by an automatic transformation into a satisfiability problem in propositional logicthat is handed to an external SAT solver. We investigate the problem of predicting the size of formulas produced by the CO4 compiler. the goal is to help the programmer in understanding the resource consumption of CO4 on his *** present a basic cost model, with some experimental data, and discuss ongoing work towards static analysis. It turns out that analysis steps will use constraint systems as well.
the proceedings contain 12 papers. the topics discussed include: embedding defeasible logic programs into generalized logic programs;describing and measuring the complexity of SAT encodings for constraint programs;PPI...
the proceedings contain 12 papers. the topics discussed include: embedding defeasible logic programs into generalized logic programs;describing and measuring the complexity of SAT encodings for constraint programs;PPI - a portable prolog interface for Java;declarative evaluation of ontologies with rules;automated exercises for constraintprogramming;complex certainty factors for rule based systems - detecting inconsistent argumentations;declarative multi-paradigm programming;interpreting XPath by iterative pattern matching with paisley;exploring non-determinism in graph algorithms;curry without success;a partial evaluator for curry;and automatic testing of operation invariance.
暂无评论