Sciweavers

4353 search results - page 37 / 871
» Expressiveness of Process Algebras
Sort
View
JUCS
2006
93views more  JUCS 2006»
14 years 9 months ago
Generic Process Algebra: A Programming Challenge
: Emerging interaction paradigms, such as service-oriented computing, and new technological challenges, such as exogenous component coordination, suggest new roles and application ...
Paula R. Ribeiro, Marco Antonio Barbosa, Luí...
IJCAI
1997
14 years 11 months ago
Towards a Complete Classification of Tractability in Allen's Algebra
We characterise the set of subalgebras of Allen's algebra which have a tractable satisfiability problem, and in addition contain certain basic relations. The conclusion is th...
Thomas Drakengren, Peter Jonsson
ISSAC
1997
Springer
105views Mathematics» more  ISSAC 1997»
15 years 1 months ago
Guarded Expressions in Practice
Computer algebra systems typically drop some degenerate cases when evaluating expressions, e.g., x=x becomes 1 dropping the case x = 0. We claim that it is feasible in practice to...
Andreas Dolzmann, Thomas Sturm
SIGMOD
1993
ACM
140views Database» more  SIGMOD 1993»
15 years 1 months ago
Second-Order Signature: A Tool for Specifying Data Models, Query Processing, and Optimization
Abstract: We propose a framework for the specification of extensible database systems. A particular goal is to implement a software component for parsing and rule-based optimizatio...
Ralf Hartmut Güting
ICDT
2007
ACM
143views Database» more  ICDT 2007»
15 years 3 months ago
Database Query Processing Using Finite Cursor Machines
We introduce a new abstract model of database query processing, finite cursor machines, that incorporates certain data streaming aspects. The model describes quite faithfully what...
Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole...