Sciweavers

2473 search results - page 333 / 495
» The Logic of Communication Graphs
Sort
View
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
15 years 10 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge
BIRTHDAY
2008
Springer
15 years 8 months ago
A Category of Explicit Fusions
Name passing calculi are nowadays an established field on its own. Besides their practical relevance, they offered an intriguing challenge, since the standard operational, denotati...
Filippo Bonchi, Maria Grazia Buscemi, Vincenzo Cia...
CCIA
2008
Springer
15 years 8 months ago
On Partial Deduction and Conversational Agents
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...
M. Mariela Morveli-Espinoza, Josep Puyol-Gruart
DAGSTUHL
2004
15 years 8 months ago
Bus Scheduling for TDL Components
This paper describes a solution for bus scheduling of distributed multi-mode TDL (Timing Definition Language) components. The TDL component model is based on the concept of Logical...
Emilia Farcas, Wolfgang Pree, Josef Templ
IJCAI
2001
15 years 8 months ago
Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
Patrick Doherty, Witold Lukaszewicz, Andrzej Szala...