A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Foundations of logic programming
Foundations of logic programming
PARLOG: parallel programming in logic
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Specification-oriented semantics for communicating processes
Acta Informatica
Parallel logic programming in PARLOG: the language and its implementation
Parallel logic programming in PARLOG: the language and its implementation
The concurrent logic programming language CP: Definition and operational semantics
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Algebraic theory of processes
Parallel program design: a foundation
Parallel program design: a foundation
Detecting stable properties of networks in concurrent logic programming languages
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Strand: new concepts in parallel programming
Strand: new concepts in parallel programming
Concurrent constraint programming
Concurrent constraint programming
A Discipline of Programming
Lectures on a Calculus for Communicating Systems
Seminar on Concurrency, Carnegie-Mellon University
Partial correctness semantics for CP [ , | , &]
Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
A lattice theoretic approach to computation based on a calculus of partially ordered type structures (property inheritance, semantic nets, graph unification)
Actors as a special case of concurrent constraint (logic) programming
OOPSLA/ECOOP '90 Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications
The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Replay, recovery, replication, and snapshots of nondeterministic concurrent programs
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
A customizable substrate for concurrent languages
PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proving concurrent constraint programs correct
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Functions as passive constraints in LIFE
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel logic programming systems
ACM Computing Surveys (CSUR)
A transformation system for CLP with dynamic scheduling and CCP
PEPM '97 Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Proving concurrent constraint programs correct
ACM Transactions on Programming Languages and Systems (TOPLAS)
From logic to stochastic processes (abstract only)
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Transformations of CCP programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Truly concurrent constraint programming
Theoretical Computer Science
A logical view of concurrent constraint programming
Nordic Journal of Computing
Proving the Equivalence of CLP Programs
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Propagation Completeness of Reactive Constraints
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Programming Deep Concurrent Constraint Combinators
PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
Resource-Passing Concurrent Programming
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Indeed: Interactive Deduction on Horn Clause Theories
IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
A Pure Meta-interpreter for Flat GHC, a Concurrent Constraint Language
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Implementing Declarative Concurrency in Java
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Proving Correctness of Timed Concurrent Constraint Programs
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Quantitative Observables and Averages in Probabilistic Constraint Programming
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
A denotational semantics for Timed Linda
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
A fully abstract model for the exchange of information in multi-agent systems
Theoretical Computer Science
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Foundations of Multi-Agent Systems: Techniques, Tools and Theory
The Knowledge Engineering Review
Deterministic consistency checking of LP constraints
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Logic programming in the context of multiparadigm programming: the Oz experience
Theory and Practice of Logic Programming
Termination of simply moded logic programs with dynamic scheduling
ACM Transactions on Computational Logic (TOCL)
Proving correctness of timed concurrent constraint programs
ACM Transactions on Computational Logic (TOCL)
Abstractions for fault-tolerant global computing
Theoretical Computer Science - Special issue: Foundations of wide area network computing
Turing machines, transition systems, and interaction
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
A compositional semantics for CHR
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Automatic verification of timed concurrent constraint programs
Theory and Practice of Logic Programming
A Timed Linda Language and its Denotational Semantics
Fundamenta Informaticae
A new generic scheme for functional logic programming with constraints
Higher-Order and Symbolic Computation
A collaboration specification language
DSL'99 Proceedings of the 2nd conference on Conference on Domain-Specific Languages - Volume 2
Service Discovery and Negotiation With COWS
Electronic Notes in Theoretical Computer Science (ENTCS)
Tchr: A framework for tabled clp
Theory and Practice of Logic Programming
Model-Checking Large Finite-State Systems and Beyond
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
A Nonmonotonic Soft Concurrent Constraint Language for SLA Negotiation
Electronic Notes in Theoretical Computer Science (ENTCS)
Structured Communications with Concurrent Constraints
Trustworthy Global Computing
Capturing Fair Computations on Concurrent Constraint Language
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Oz: a programming language for multi-agent systems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
LMNtal as a hierarchical logic programming language
Theoretical Computer Science
Constraint Functional Logic Programming Revisited
Electronic Notes in Theoretical Computer Science (ENTCS)
Refining the Undecidability Border of Weak Bisimilarity
Electronic Notes in Theoretical Computer Science (ENTCS)
Turing machines, transition systems, and interaction
Information and Computation
Intersection reporting on two collections of disjoint sets
Information Sciences: an International Journal
CC-Pi: a constraint-based language for specifying service level agreements
ESOP'07 Proceedings of the 16th European conference on Programming
Integer optimization by local search: a domain-independent approach
Integer optimization by local search: a domain-independent approach
Programming constraint services: high-level programming of standard and new constraint services
Programming constraint services: high-level programming of standard and new constraint services
Open bisimulation for the concurrent constraint pi-calculus
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Transactional service level agreement
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Concurrent and reactive constraint programming
A 25-year perspective on logic programming
Deriving labels and bisimilarity for concurrent constraint programming
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
CC-Pi: a constraint language for service negotiation and composition
Rigorous software engineering for service-oriented systems
Parallelizing union-find in constraint handling rules using confluence analysis
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Compositional verification of asynchronous processes via constraint solving
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A toolkit for the realization of constraint-based multiagent systems
ProMAS'04 Proceedings of the Second international conference on Programming Multi-Agent Systems
Specialization of concurrent guarded multi-set transformation rules
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
The attributed pi-calculus with priorities
Transactions on Computational Systems Biology XII
A secure coordination of agents with nonmonotonic soft Concurrent Constraint Programming
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Partition refinement for bisimilarity in CCP
Proceedings of the 27th Annual ACM Symposium on Applied Computing
A survey of constraint-based programming paradigms
Computer Science Review
A Nonmonotonic Soft Concurrent Constraint Language to Model the Negotiation Process
Fundamenta Informaticae
Constraints for service contracts
TGC'11 Proceedings of the 6th international conference on Trustworthy Global Computing
A Timed Linda Language and its Denotational Semantics
Fundamenta Informaticae
Executing Suspended Logic Programs
Fundamenta Informaticae
Securely accessing shared resources with concurrent constraint programming
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
Combining declarative and procedural views in the specification and analysis of product families
Proceedings of the 17th International Software Product Line Conference co-located workshops
Hi-index | 0.00 |
This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of computing with partial information, and the concomitant notions of consistency and entailment.1 In this framework, computation emerges from the interaction of concurrently executing agents that communicate by placing, checking and instantiating constraints on shared variables. Such a view of computation is interesting in the context of programming languages because of the ability to represent and manipulate partial information about the domain of discourse, in the context of concurrency because of the use of constraints for communication and control, and in the context of AI because of the availability of simple yet powerful mechanisms for controlling inference, and the promise that very rich representational/programming languages, sharing the same set of abstract properties, may be possible.To reflect this view of computation, [Sar89] develops the cc family of languages. We present here one member of the family, cc(↓, →) (pronounced “cc with Ask and Choose”) which provides the basic operations of blocking Ask and atomic Tell and an algebra of behaviors closed under prefixing, indeterministic choice, interleaving, and hiding, and provides a mutual recursion operator. cc(↓, →) is (intentionally!) very similar to Milner's CCS, but for the radically different underlying concept of communication, which, in fact, provides a general—and elegant—alternative approach to “value-passing” in CCS. At the same time it adequately captures the framework of committed choice concurrent logic programming languages. We present the rules of behavior for cc agents, motivate a notion of “visible action” for them, and develop the notion of c-trees and reactive congruence analogous to Milner's synchronization trees and observational congruence. We also present an equational characterization of reactive congruence for Finitary cc(↓, →).