Sciweavers

815 search results - page 148 / 163
» Algebraic Recognizability of Languages
Sort
View
DALT
2005
Springer
15 years 3 months ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki
ADBIS
2004
Springer
124views Database» more  ADBIS 2004»
15 years 2 months ago
Vague Spatial Data Types, Set Operations, and Predicates
Many geographical applications deal with spatial objects that cannot be adequately described by determinate, crisp concepts because of their intrinsically indeterminate and vague n...
Alejandro Pauly, Markus Schneider
110
Voted
BIRTHDAY
2004
Springer
15 years 2 months ago
Retracing the Semantics of CSP
CSP was originally introduced as a parallel programming language in which sequential imperative processes execute concurrently and communicate by synchronized input and output. The...
Stephen D. Brookes
GG
2004
Springer
15 years 2 months ago
Fundamental Theory for Typed Attributed Graph Transformation
The concept of typed attributed graph transformation is most significant for modeling and meta modeling in software engineering and visual languages, but up to now there is no ade...
Hartmut Ehrig, Ulrike Prange, Gabriele Taentzer
64
Voted
DOLAP
2003
ACM
15 years 2 months ago
Implementing operations to navigate semantic star schemas
In the last years, lots of work have been devoted to multidimensional modeling, star shape schemas and OLAP operations. However, “drill-across” has not captured as much attent...
Alberto Abelló, José Samos, Fè...