Filters








8,206 Hits in 4.6 sec

Residuation and Guarded Rules for Constraint Logic Programming [chapter]

Gert Smolka
1992 TEUBNER-TEXTE zur Informatik  
In this paper we present two concepts, residuation and guarded rules, for further strengthening determinate reduction.  ...  Residuation is a control strategy giving priority to determinate reductions. Guarded rules are logical consequences of programs adding otherwise unavailable determinate reductions.  ...  The research reported in this paper was inspired by my collaboration with Hassan Ait-Kaci and Andreas Podelski on the semantics of LIFE.  ... 
doi:10.1007/978-3-322-95233-2_24 fatcat:cgxmdubdijbx5mx26hc5aamjy4

Page 5089 of Mathematical Reviews Vol. , Issue 93i [page]

1993 Mathematical Reviews  
{For the entire collection see MR 92m:68006.} Lawrence S. Moss (1-IN) 93i:68040 68N17 Smolka, Gert (D-DFK]) Residuation and guarded rules for constraint logic programming.  ...  In this paper we present two concepts, residuation and guarded rules, for further strengthening determinate reduction.  ... 

Using CHRs to Generate Functional Test Cases for the Java Card Virtual Machine [chapter]

Sandrine-Dominique Gouraud, Arnaud Gotlieb
2005 Lecture Notes in Computer Science  
We also propose several test purposes based on rewriting rules coverage and automatic non-conformity detection.  ...  In our work, we investigate the use of Constraint Handling Rules (CHRs) to automate functional test cases generation based on a formal model.  ...  Starting from an algebraic specification, test sets were selected using equational logic programming (Horn clause logic). A few years ago, Constraint Logic Programming was explored by Gotlieb and al.  ... 
doi:10.1007/11603023_1 fatcat:kaotb6w2jvgvtf26yzevtwf4rm

Teaching functional and logic programming with a single computation model [chapter]

Michael Hanus
1997 Lecture Notes in Computer Science  
Taking into account recent developments in the integration of functional and logic programming, it is possible to teach the ideas of modern functional languages like Haskell and logic programming on the  ...  Functional and logic programming are often taught in different courses so that students often do not understand the relationships between these declarative programming paradigms.  ...  This generalizes concurrent computation models for residuating logic programs [1, 21] to functional logic programs.  ... 
doi:10.1007/bfb0033854 fatcat:tq22j666wbe73frg6gvvtvnqwa

Constraint Handling Rules with Multiset Comprehension Patterns [article]

Edmund S. L. Lam, Iliano Cervesato
2014 arXiv   pre-print
CHR is a declarative, concurrent and committed choice rule-based constraint programming language.  ...  This enables writing more readable, concise and declarative code for algorithms that coordinate large amounts of data or require aggregate operations. We call this extension CHR^cp.  ...  Introduction CHR is a declarative, concurrent and committed choice rule-based constraint programming language.  ... 
arXiv:1406.2121v1 fatcat:yklzaf3ynzc2tjxcin7lpkkh4e

Constraint-Based Concurrency and Beyond

Kazunori Ueda
2006 Electronical Notes in Theoretical Computer Science  
Constraint-based concurrency is a simple and elegant formalism of concurrency with monotonic mobile channels, whose history started in early 1980's as a subfield of logic programming.  ...  In this paper we try to convey the essence of constraint-based concurrency to the process calculi community.  ...  LMNtal is an outcome of the attempt to unify CBC and Constraint Handling Rules, the two notable extensions to concurrent logic programming.  ... 
doi:10.1016/j.entcs.2005.12.103 fatcat:5jqgehgecned3actq5dppgp7my

LMNtal as a hierarchical logic programming language

Kazunori Ueda
2009 Theoretical Computer Science  
LMNtal is an outcome of the attempt to unify constraintbased concurrency and Constraint Handling Rules (CHR), the two notable extensions to concurrent logic programming.  ...  In this paper, we show that it is possible to give LMNtal a simple logical interpretation based on intuitionistic linear logic and a flattening technique.  ...  This work is partially supported by Grant-In-Aid for Scientific Research ((B)(2) 16300009; Priority Areas (C)(2)13324050, (B)(2)14085205 and 04560009), MEXT and JSPS.  ... 
doi:10.1016/j.tcs.2009.07.043 fatcat:swb3tox2l5hsnbm3wwzb7t2zdi

Realizing evaluation strategies by hierarchical graph rewriting [article]

Petra Hofstedt
2010 arXiv   pre-print
We discuss the realization of evaluation strategies for the concurrent constraint-based functional language CCFL within the translation schemata when compiling CCFL programs into the hierarchical graph  ...  The support of LMNtal to express local computations and to describe the migration of processes and rules between local computation spaces allows a clear and simple encoding of typical evaluation strategies  ...  PE 07542 from the Japan Society for the Promotion of Science (JSPS).  ... 
arXiv:1009.3770v1 fatcat:psvjhi4vpvdepclo5jyntjwtyi

A Pure Meta-interpreter for Flat GHC, a Concurrent Constraint Language [chapter]

Kazunori Ueda
2002 Lecture Notes in Computer Science  
Meta-interpretation has a long history in logic programming, and has been applied extensively to building programming systems, adding functionalities, modifying operational semantics and evaluation strategies  ...  applications of concurrent constraint programming in mind.  ...  One of the motivations of the work is to use concurrent logic/constraint programming as a concise tool for networked applications.  ... 
doi:10.1007/3-540-45628-7_7 fatcat:l6catykusrdt3k6uxhac46uhpa

Stochastic Behavior and Explicit Discrete Time in Concurrent Constraint Programming [chapter]

Jesús Aranda, Jorge A. Pérez, Camilo Rueda, Frank D. Valencia
2008 Lecture Notes in Computer Science  
We address the inclusion of stochastic information into an explicitly timed concurrent constraint process language. An operational semantics is proposed as a preliminary result.  ...  Concurrent constraint programming (CCP) [1] is a declarative model for concurrency with strong ties to logic. In CCP, systems are described by pieces of partial information called constraints.  ...  Timed concurrent constraint programming (tcc) [2] is a declarative framework for reactive systems.  ... 
doi:10.1007/978-3-540-89982-2_57 fatcat:a3apgv4dp5celcku2zjnnh4ynu

Concurrent and Reactive Constraint Programming [chapter]

Maurizio Gabbrielli, Catuscia Palamidessi, Frank D. Valencia
2010 Lecture Notes in Computer Science  
The Italian Logic Programming community has given several contributions to the theory of Concurrent Constraint Programming.  ...  Additionally, concurrent constraint programming embodies an explicit characterization of the control mechanisms for communication and synchronization by means of the introduction of two kinds of actions  ...  logic programming both for program synthesis and for program specialization and optimization.  ... 
doi:10.1007/978-3-642-14309-0_11 fatcat:jo4qnuehvfggfn3fkugqgmsqpu

Optimized Compilation of Multiset Rewriting with Comprehensions [chapter]

Edmund Soon Lee Lam, Iliano Cervesato
2014 Lecture Notes in Computer Science  
In this paper, we formalize the operational semantics of CHR cp and define a low-level optimizing compilation scheme based on join ordering for the efficient execution of programs.  ...  This paper was made possible by grant NPRP 09-667-1-100, Effective Programming for Large Distributed Ensembles, from the Qatar National Research Fund (a member of the Qatar Foundation).  ...  Given a CHR cp program P, for each rule body constraint B in P, if for every head constraint comprehension pattern M : j and rule guard g in P, B is not unifiable with M while satisfying g (denoted g M  ... 
doi:10.1007/978-3-319-12736-1_2 fatcat:sakf7e3275cdjhxb6bf4o3petu

Extending constructive negation for partial functions in lazy functional-logic languages [chapter]

Juan José Moreno-Navarro
1996 Lecture Notes in Computer Science  
Furthermore, when the goal has variables the evaluation mechanism provides constraints to the variables to make the default rule applicable.  ...  In this paper the mechanism of Default Rules for narrowingbased languages proposed in 24] is adapted to lazy narrowing. Every partial de nition of a function can be completed with a default rule.  ...  The rst one introduces a general framework to integrate functional programming, logic programming and constraints. 17] presents a method to compute equality and disequality constraints over the (innitary  ... 
doi:10.1007/3-540-60983-0_15 fatcat:66f3bhxubzdhhnndp6ypukjfyu

Models and emerging trends of concurrent constraint programming

Carlos Olarte, Camilo Rueda, Frank D. Valencia
2013 Constraints  
Constraints and Agents Concurrent Constraint Programming (CCP) [181, 186, 187] has emerged as a simple but powerful paradigm for concurrency tied to logic.  ...  Concurrent Constraint Programming (CCP) has been used over the last two decades as an elegant and expressive model for concurrent systems.  ...  This work has been partially supported by grant 1251-521-28471 from Colciencias (Colombia), and by Digiteo and DGAR (École Polytechnique) funds for visitors.  ... 
doi:10.1007/s10601-013-9145-3 fatcat:7mx6xnyfcjad7musa373vockne

A confluent calculus for concurrent constraint programming

Kim Marriott, Martin Odersky
1997 Theoretical Computer Science  
We show that it is possible to give a natural confluent calculus for concurrent constraint programs, if the syntactic domain is extended by a blind choice operator and a special constant standing for a  ...  Confluence is an important and desirable property as it allows the program to be understood by considering any desired scheduling rule, rather than having to consider all possible schedulings.  ...  Acknowledgements We thank the referees of CP'95 and TCS for their detailed comments.  ... 
doi:10.1016/s0304-3975(96)00196-x fatcat:fvxytybgcjb6fbs37wrtnedt2m
« Previous Showing results 1 — 15 out of 8,206 results