181 search results - page 20 / 37 » Effective characterizations of tree logics |
FTCS
1994
13 years 8 months ago
1994
This paper examines architectural techniques for providing concurrent error detection in self-timed VLSI pipelines. Signal pairs from Differential Cascode Voltage Switch Logic are...
AAAI
2010
13 years 8 months ago
2010
Approaches to reasoning about knowledge in imperfect information games typically involve an exhaustive description of the game, the dynamics characterized by a tree and the incomp...
JLP
2007
13 years 7 months ago
2007
This work faces the problem of web service selection and composition, discussing the advantages that derive from the inclusion, in a web service declarative description, of the hi...
EJC
2008
13 years 7 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...