Sciweavers

552 search results - page 33 / 111
» On the Complexity of Join Predicates
Sort
View
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 8 months ago
Feedback control logic synthesis for non safe Petri nets
– This paper addresses the problem of forbidden states of non safe Petri Net (PN) modelling discrete events systems. To prevent the forbidden states, it is possible to use condit...
Abbas Dideban, Hassane Alla
CORR
2011
Springer
170views Education» more  CORR 2011»
13 years 5 months ago
On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces
We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates, as well as Boolean operations on regions, interpreted over low-...
Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann,...
JSYML
2007
97views more  JSYML 2007»
13 years 10 months ago
Sublocales in formal topology
The paper studies how the localic notion of sublocale transfers to formal topology. For any formal topology (not necessarily with positivity predicate) we define a sublocale to b...
Steven Vickers
ECSCW
2001
13 years 11 months ago
Harnessing complexity in CSCW
We argue that socio-technical systems can be understood as complex adaptive systems, that is, systems containing component sub-systems interacting such that they co-evolve This vie...
Simon M. Kaplan, Lesley Seebeck
CORR
2006
Springer
122views Education» more  CORR 2006»
13 years 10 months ago
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
XPath is a simple language for navigating an XML-tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various frag...
Frank Neven, Thomas Schwentick