We present three examples of the composition of Computer Algebra Systems to illustrate the progress on a composability infrastructure as part of the SCIEnce (Symbolic Computation I...
Sebastian Freundt, Peter Horn, Alexander Konovalov...
This paper presents an algorithm for the synthesis of bounded Petri nets from transition systems. A bounded Petri net is always provided in case it exists. Otherwise, the events ar...
Josep Carmona, Jordi Cortadella, Michael Kishinevs...
Agents are situated autonomous entities that perceive and act in their environment, and communicate with other agents. An agent usually starts a conversation by querying another a...
Boolean Constraint Propagation (BCP) is recognized as one of the most useful technique for efficient satisfiability checking. In this paper a new extension of the scope of boole...
Abstract. Constraint solving problems (CSPs) represent a formalization of an important class of problems in computer science. We propose here a solving methodology based on the nam...