A CSP implementation of the bigraph embedding problem
A crucial problem for many results and tools about bigraphs and bigraphical reactive systems is bigraph embedding. An embedding is more informative than a bigraph matching, since it keeps track of the correspondence between the various components of the redex (guest) within the agent (host). In this paper, we present an algorithm for computing embeddings based on a reduction to a constraint satisfaction problem. This algorithm, that we prove to be sound and complete, has been successfully implemented in LibBig, a library for manipulating bigraphical reactive systems. This library can be used for implementing a wide range of tools, and it can be adapted to various extensions of bigraphs.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
ArbiGraph: Arbitrarily Scalable Verifiable Task Graphs for Evaluating Context Management
We introduce ARBIGRAPH, a benchmark generator for evaluating whether tool-assisted language agents can retain, update, compose, and discard task-relevant context across extended reasoning workflows. ARBIGRAPH represents …
Mixed Integer Programming for Searching Maximum Quasi-Bicliques
This paper is related to the problem of finding the maximal quasi-bicliques in a bipartite graph (bigraph). A quasi-biclique in the bigraph is its "almost" complete subgraph. The relaxation of completeness can be underst…
Bigraph Matching Weighted with Learnt Incentive Function for Multi-Robot Task Allocation
Most real-world Multi-Robot Task Allocation (MRTA) problems require fast and efficient decision-making, which is often achieved using heuristics-aided methods such as genetic algorithms, auction-based methods, and bipart…
Decision MakingGraph MatchingHierarchical Bipartite Graph Convolution Networks
Recently, graph neural networks have been adopted in a wide variety of applications ranging from relational representations to modeling irregular data domains such as point clouds and social graphs. However, the space of…
Graph Neural NetworkHierarchical BiGraph Neural Network as Recommendation Systems
Graph neural networks emerge as a promising modeling method for applications dealing with datasets that are best represented in the graph domain. In specific, developing recommendation systems often require addressing sp…
Recommendation Systems