Sciweavers

13 search results - page 2 / 3
» Complete Axiomatization of an Algebraic Construction of Grap...
Sort
View
LICS
2000
IEEE
14 years 3 days ago
Computational Complexity of Some Problems Involving Congruences on Algebras
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
Clifford Bergman, Giora Slutzki
ICRA
2005
IEEE
134views Robotics» more  ICRA 2005»
14 years 1 months ago
Towards Decentralization of Multi-robot Navigation Functions
—We present a navigation function through which a group of mobile agents can be coordinated to achieve a particular formation, both in terms of shape and orientation, while avoid...
Herbert G. Tanner, Amit Kumar
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 7 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
LPNMR
1990
Springer
13 years 11 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote
AAAI
2008
13 years 10 months ago
Dormant Independence
The construction of causal graphs from non-experimental data rests on a set of constraints that the graph structure imposes on all probability distributions compatible with the gr...
Ilya Shpitser, Judea Pearl