2540 search results - page 282 / 508 » Abstract Logics as Dialgebras |
WOLLIC
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Database design aims to find a database schema that permits the efficient processing of common types of queries and updates on future database instances. Full first-ord...
131
Voted
ARGMAS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Several recent works in the area of Artificial Intelligence focus on computational models of argumentation-based negotiation. However, even if computational models of ar...
94
Voted
CALCO
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Labelled Markov processes are continuous-state fully probabilistic labelled transition systems. They can be seen as co-algebras of a suitable monad on the category of mea...
113
Voted
CSL
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. For a two-variable formula B(X,Y) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of a finite-state operator Y=F(X) ...
80
Voted
ER
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Current Web applications embed sophisticated user interfaces and business logic. The original interaction paradigm of the Web based on static content pages that are brows...