Guarded horn clauses

Ueda, Kazunori

doi:10.1007/3-540-16479-0_17

Cited by 202 publications

(78 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…• a concurrent logic language based on Ueda's GHC [122] was used in the Japanese Fifth-Generation Computing Project…”

Section: Brief Backgroundmentioning

confidence: 99%

Constraints meet concurrency

Mauro

2015

Constraints

View full text Add to dashboard Cite

We investigate the benefits that emerge when the fields of constraint programming and concurrency meet. On one hand, constraints can be use in concurrency theory to increase the conciseness and the expressive power of concurrent languages from a pragmatic point of view. On the other hand, problems modeled by using constraints can be solved faster and more efficiently using a concurrent system. We explore both directions providing two separate lines of contribution. Firstly we study the expressive power of a concurrent language, namely Constraint Handling Rules, that supports constraints as a primitive construct. We show what features of this language make it Turing powerful. Then we propose a framework to solve constraint problems that is intended to be deployed on a concurrent system. For the development of this framework we used the concurrent language Jolie following the Service Oriented paradigm. Based on this experience, we also propose an extension to Service Oriented Languages to overcome some of their limitations and to improve the development of concurrent applications. Needless to say, I am also in debt with my coauthors:

show abstract

“…• a concurrent logic language based on Ueda's GHC [122] was used in the Japanese Fifth-Generation Computing Project…”

Section: Brief Backgroundmentioning

confidence: 99%

Constraints meet concurrency

Mauro

2015

Constraints

View full text Add to dashboard Cite

show abstract

“…In the CCP framework (including GHC [14] and Oz [13]), processes communicate by interacting with a set of shared variables in a store on which they can either post ("tell") or test ("ask") for the presence of some constraint. These languages also use committed choice for non-determinism.…”

Section: Related Workmentioning

confidence: 99%

Coordination of Many Agents

2005

View full text Add to dashboard Cite

Abstract. This paper presents a reactive programming and triggering framework for the coordination of a large number of distributed agents with shared knowledge. At the heart of this framework is a highly structured shared store in the form of a constraint logic program (CLP), which is used as a knowledge base and being reacted to by agents through the use of "reactors". The biggest challenge arising from such a reactive programming framework using CLP is to develop a trigger mechanism that allows efficient "wakeup" of blocked reactors. This paper addresses the architecture of this open framework, and discusses a general methodology for doing triggering of logic conditions using views and abstractions.

show abstract

“…Relational Language [7], the first concrete proposal of a concurrent logic language, was followed by a succession of proposals, namely Concurrent Prolog [20], PARLOG [8] and Guarded Horn Clauses (GHC) [27]. KL1 [29], the Kernel Language of the Fifth Generation Computer Systems (FGCS) project [22], was designed based on GHC by featuring (among others) mapping constructs for concurrent processes.…”

Section: Concurrency and Logic Programmingmentioning

confidence: 99%

“…While Concurrent Prolog employed read-only annotations as a synchronization primitive, GHC replaced it with the rule that no bindings (constraints) can be published from the guard (including the head) of a clause to the caller of the clause. Figure 2 shows a GHC interpreter in GHC in [27]. Here it is assumed that a built-in predicate clauses/2 returns in a frozen form [16] a list of all clauses whose heads are potentially unifiable with the given goal.…”

Section: Previous Workmentioning

confidence: 99%

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

Ueda

2002

Computational Logic: Logic Programming and Beyond

Self Cite

View full text Add to dashboard Cite

Abstract. This paper discusses the construction of a meta-interpreter of Flat GHC, one of the simplest and earliest concurrent constraint languages. 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, and so on. Our objective, in contrast, is to design the pair of (i) a representation of programs suitable for code mobility and (ii) a pure interpreter (or virtual machine) of the represented code, bearing networked applications of concurrent constraint programming in mind. This is more challenging than it might seem; indeed, meta-interpreters of many programming languages achieved their objectives by adding small primitives into the languages and exploiting their functionalities. A metainterpreter in a pure, simple concurrent language is useful because it is fully amenable to theoretical support including partial evaluation. After a number of trials and errors, we have arrived at treecode, a groundterm representation of Flat GHC programs that can be easily interpreted, transmitted over the network, and converted back to the original syntax. The paper describes how the interpreter works, where the subtleties lie, and what its design implies. It also describes how the interpreter, given the treecode of a program, is partially evaluated to the original program by the unfold/fold transformation system for Flat GHC.

show abstract

Guarded horn clauses

Cited by 202 publications

References 6 publications

Constraints meet concurrency

Constraints meet concurrency

Coordination of Many Agents

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

Contact Info

Product

Resources

About