检索结果-内蒙古大学图书馆

LMNtal as a hierarchical logic programming language

THEORETICAL COMPUTER SCIENCE 2009年第46期410卷 4784-4800页

作者： Ueda, Kazunori Waseda Univ Dept Comp Sci & Engn Shinjuku Ku Tokyo 1698555 Japan

LMNtal (pronounced "elemental") is a simple language model based on hierarchical graph rewriting that uses logical variables to represent connectivity and membranes to represent hierarchy. LMNtal is an outcome of the attempt to unify constraint based concurrency and constraint Handling Rules (CHR), the two notable extensions to concurrent logic programming. LMNtal is intended to be a substrate language of various computational models, especially those addressing concurrency, mobility and multiset rewriting. Although the principal objective of LMNtal was to provide a unifying computational model, it is of interest to equip the formalism with a precise logical interpretation. 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 enables us to call LMNtal a hierarchical, concurrent linear logic language. (C) 2009 Elsevier B.V. All rights reserved.

关键词： LMNtal concurrent logic programming concurrent constraint programming Hierarchical graph rewriting

来源：评论

学校读者我要写书评

暂无评论

On concurrent behaviors and focusing in linear logic

引用

THEORETICAL COMPUTER SCIENCE 2017年 685卷 46-64页

作者： Olarte, Carlos Pimentel, Elaine Univ Fed Rio Grande do Norte Escola Ciencias & Tecnol Natal RN Brazil Univ Fed Rio Grande do Norte Dept Matemat Natal RN Brazil

concurrent constraint programming (CCP) is a simple and powerful model of concurrency where processes interact by telling and asking constraints into a global store of partial information. Since its inception, CCP has been endowed with declarative semantics where processes are interpreted as formulas in a given logic. This allows for the use of logical machinery to reason about the behavior of programs and to prove properties of them. Nevertheless, the logical characterization of CCP programs exhibits normally a weak level of adequacy since proofs in, the logical system may not correspond directly to traces of the program. In this paper, we study different encodings from CCP into intuitionistic linear logic (ILL) and we compare the level of adequacy attained in each. By relying on a focusing discipline, we show that it is possible to give a logical characterization to CCP with the highest level of adequacy. Moreover, we show how to characterize maximal-parallelism semantics for CCP by relying on a multi-focusing discipline for ILL. These results, besides giving proof techniques for CCP, entail (safe) optimizations for the execution of CCP programs. Finally, we show how to interpret CCP procedure calls as fixed points in ILL, thus opening the possibility of reasoning by induction about properties of CCP programs. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Linear logic concurrent constraint programming Proof systems Focusing Multi-focusing Fixed points

来源：评论

学校读者我要写书评

暂无评论

Parallelism, concurrency and distribution in constraint handling rules: A survey

引用

THEORY AND PRACTICE OF LOGIC programming 2018年第5-6期18卷 759-805页

作者： Fruehwirth, Thom Ulm Univ Inst Software Engn & Programming Languages D-89069 Ulm Germany

constraint Handling Rules (CHR) is both an effective concurrent declarative programming language and a versatile computational logic formalism. In CHR, guarded reactive rules rewrite a multi-set of constraints. Concurrency is inherent, since rules can be applied to the constraints in parallel. In this comprehensive survey, we give an overview of the concurrent, parallel as well as distributed CHR semantics, standard and more exotic, that have been proposed over the years at various levels of refinement. These semantics range from the abstract to the concrete. They are related by formal soundness results. Their correctness is proven as a correspondence between parallel and sequential computations. On the more practical side, we present common concise example CHR programs that have been widely used in experiments and benchmarks. We review parallel and distributed CHR implementations in software as well as hardware. The experimental results obtained show a parallel speed-up for unmodified sequential CHR programs. The software implementations are available online for free download and we give the web links. Due to its high level of abstraction, the CHR formalism can also be used to implement and analyse models for concurrency. To this end, the Software Transaction Model, the Actor Model, Colored Petri Nets and the Join-Calculus have been faithfully encoded in CHR. Finally, we identify and discuss commonalities of the approaches surveyed and indicate what problems are left open for future research.

关键词： parallelism concurrency distribution constraint handling rules declarative programming concurrent constraint programming semantics rewriting concurrency models

来源：评论

学校读者我要写书评

暂无评论

Characterizing right inverses for spatial constraint systems with applications to modal logic

引用

THEORETICAL COMPUTER SCIENCE 2018年 744卷 56-77页

作者： Guzman, Michell Perchy, Salim Rueda, Camilo Valencia, Frank D. Ecole Polytech Paris INRIA LIX Paris France INRIA Grand Est Loria Villers Les Nancy France Pontificia Univ Javeriana Cali Cali Colombia Ecole Polytech Paris CNRS Paris France Ecole Polytech Paris LIX Paris France

Spatial constraint systems are algebraic structures from concurrent constraint programming to specify spatial and epistemic behavior in multi-agent systems. In this paper spatial constraint systems are used to give an abstract characterization of the notion of normality in modal logic and to derive right inverse/reverse operators for modal languages. In particular, a necessary and sufficient condition for the existence of right inverses is identified and the abstract notion of normality is shown to correspond to the preservation of finite suprema. Furthermore, a taxonomy of normal right inverses is provided, identifying the greatest normal right inverse as well as the complete family of minimal right inverses. These results are applied to existing modal languages such as the weakest normal modal logic, Hennessy-Milner logic, and linear-time temporal logic. Some implications of these results are also discussed in the context of modal concepts such as bisimilarity and inconsistency invariance. (C) 2018 Elsevier B.V. All rights reserved.

关键词： constraint systems concurrent constraint programming Concurrency theory Modal logic Inverse operators

来源：评论

学校读者我要写书评

暂无评论

引用

SCIENCE OF COMPUTER programming 2015年 100卷 84-104页

作者： Pino, Luis F. Aristizabal, Andres Bonchi, Filippo Valencia, Frank Ecole Polytech INRIA DGA LIX F-91128 Palaiseau France Ecole Polytech UMR X CNRS 7161 F-91128 Palaiseau France Pontificia Univ Javeriana Cali Cali Colombia Univ Lyon ENS Lyon LIP UMR CNRS ENS Lyon UCBL INRIA 5668 F-69364 Lyon France Ecole Polytech CNRS F-91128 Palaiseau France Ecole Polytech LIX UMR X CNRS 7161 F-91128 Palaiseau France

concurrent constraint programming (CCP) is a well-established model for concurrency that singles out the fundamental aspects of asynchronous systems whose agents (or processes) evolve by posting and querying (partial) information in a global medium. Bisimilarity is a standard behavioral equivalence in concurrency theory. However, only recently a well-behaved notion of bisimilarity for CCP, and a CCP partition refinement algorithm for deciding the strong version of this equivalence have been proposed. Weak bisimilarity is a central behavioral equivalence in process calculi and it is obtained from the strong case by taking into account only the actions that are observable in the system. Typically, the standard partition refinement can also be used for deciding weak bisimilarity simply by using Milner's reduction from weak to strong bisimilarity;a technique referred to as saturation. In this paper we demonstrate that, because of its involved labeled transitions, the above-mentioned saturation technique does not work for CCP. We give an alternative reduction from weak CCP bisimilarity to the strong one that allows us to use the CCP partition refinement algorithm for deciding this equivalence. (C) 2014 Elsevier B.V. All rights reserved.

关键词： concurrent constraint programming Weak bisimilarity Partition refinement

来源：评论

学校读者我要写书评

暂无评论

Modelling musical structures

引用

constraints 2001年第1期6卷 53-83页

作者： Zimmermann, D. Private Fern-Fachhochschule Darmstadt Postfach 10 01 64 D-64201 Darmstadt Germany

Modelling musical structures is a research field prominent among mathematicians and computer scientists as well as musicologists, psychomusicologists and musicians. constraint programming has been proved to be a highly appropriate technique in this field. For the task of automated music composition, in particular, constraints have been shown to describe composition principles in a declarative, natural, and, above all, efficient way since music composition knowledge is in fact a collection of conditions rather than a sort of cookery-book. Unfortunately, many approaches stress the technical aspects of applying constraints and do not think about the concrete role of constraints, i.e. about what music really should be. In general, the composer as an artist is more concerned about what he wants to say through his music than with theoretically (or socially or psychologically) established rules. This means that automated music composition needs practical goals in order to make sense. The role of those goals as well as musical constraints and constraint technologies that help to realize the goals are to be shown in this article. As a modelling example the system COPPELIA is introduced. It generates music on the basis of the structures, goals, and contents of given multimedia presentations. In this relatively young field of constraint application that does not supply such ideal, well-defined and closed sets of conditions as technical applications do, we find it very important to also present general thoughts about the sense of our application, about the development of composition constraints and the conditions under which these constraints work effectively.

关键词： Automatic music composition concurrent constraint programming Creativity Multimedia Music-rhetorical grammar Musical intentions Oz programming environment

来源：评论

学校读者我要写书评

暂无评论

PARALLEL LOGIC programming SYSTEMS

引用

ACM COMPUTING SURVEYS 1994年第3期26卷 295-336页

作者： DEKERGOMMEAUX, JC CODOGNET, P INRIA F-78153 LE CHESNAYFRANCE

Parallelizing logic programming has attracted much interest in the research community, because of the intrinsic OR- and AND-parallelisms of logic programs. One research stream aims at transparent exploitation of parallelism in existing logic programming languages such as Prolog, while the family of concurrent logic languages develops language constructs allowing programmers to express the concurrency-that is, the communication and synchronization between parallel processes-within their algorithms. This article concentrates mainly on transparent exploitation of parallelism and surveys the most mature solutions to the problems to be solved in order to obtain efficient implementations. These solutions have been implemented, and the most efficient parallel logic programming systems reach effective speedups over state-of-the-art sequential Prolog implementations. The article also addresses current and prospective research issues in extending the applicability and the efficiency of existing systems, such as models merging the transparent parallelism and the concurrent logic languages approaches, combination of constraint logic programming with parallelism, and use of highly parallel architectures.

关键词： AND-PARALLELISM BINDING ARRAYS concurrent constraint programming constraintS GUARD, HASH WINDOWS LOAD BALANCING MASSIVE PARALLELISM MEMORY MANAGEMENT MULTISEQUENTIAL IMPLEMENTATION TECHNIQUES NONDETERMINISM OR-PARALLELISM PROLOG SCHEDULING PARALLEL TASKS STATIC ANALYSIS WARREN ABSTRACT MACHINE

来源：评论

学校读者我要写书评

暂无评论

constraint-Based Concurrency and Beyond

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2006年第1期162卷 327-331页

作者： Ueda, Kazunori Waseda Univ Dept Comp Sci Shinjuku Ku 4-1Okubo 3 Chome Tokyo 1698555 Japan

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. Although it has hardly been recognized as process calculi, there is a close connection between them. In this paper we try to convey the essence of constraint-based concurrency to the process calculi community. We also describe how it smoothly evolved into LMNtal (pronounced "elemental"), a language model based on hierarchical graph rewriting.

关键词： constraint-based concurrency concurrent constraint programming concurrent logic programming mobility hierarchical graph rewriting multiset rewriting LMNtal

来源：评论

学校读者我要写书评

暂无评论

A Demonstration of ToonTalk where Children Build Programs by Demonstration in a Game World 16

A Demonstration of ToonTalk where Children Build Programs by...

引用

15th International ACM Conference on Interaction Design and Children (IDC)

作者： Kahn, Ken Univ Oxford Oxford OX2 6NN England

ISBN: (纸本)9781450343138

Desktop ToonTalk was first released twenty years ago and was successfully used by children as young as 3 to construct computer programs. Uniquely these programs are constructed by demonstration using game elements such as robots, birds, trucks, boxes, and magic wands. The user's avatar inhabits a town where computations can be created and executed in an animated manner. ToonTalk Reborn is a re-conceptualization of ToonTalk for the web. It runs in any modern browser without any plugins. The move to become a web-based tool for web programming has resulted in much being gained and lost.

关键词： Computer programming programming languages programming languages for children programming by demonstration animated programming concurrent constraint programming

来源：评论

学校读者我要写书评

暂无评论

Declarative Interpretations of Session-Based Concurrency 15

Declarative Interpretations of Session-Based Concurrency

引用

17th International Symposium on Principles and Practice of Declarative programming (PPDP)

作者： Cano, Mauricio Rueda, Camilo Lopez, Hugo A. Perez, Jorge A. Pontificia Univ Javeriana Cali Cali Colombia Tech Univ Denmark Lyngby Denmark Univ Lisbon LaSIGE Lisbon Portugal Univ Groningen Groningen Netherlands

ISBN: (纸本)9781450335164

Session-based concurrency is a type-based approach to the analysis of communication-intensive systems. Correct behavior in these systems may be specified in an operational or declarative style: the former defines how interactions are structured;the latter defines governing conditions. In this paper, we investigate the relationship between operational and declarative models of session-based concurrency. We propose two interpretations of session pi-calculus processes as declarative processes in linear concurrent constraint programming (1cc). They offer a basis on which both operational and declarative requirements can be specified and reasoned about. By coupling our interpretations with a type system for 1cc, we obtain robust declarative encodings of pi-calculus mobility.

关键词： concurrency pi-calculus concurrent constraint programming session types expressiveness

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：