125 search results - page 20 / 25 » Boolean Satisfiability with Transitivity Constraints |
ICRA
2003
IEEE
14 years 3 months ago
2003
IEEE
−−−− Ordinary t-timed Petri Nets are used for modeling, analysis and synthesis of random topology production systems and networks. Each production system is first decompose...
ECEASST
2006
13 years 9 months ago
2006
This paper contributes in two directions. First, several concepts of our matrix approach to graph transformation [1,2] such as coherence and minimal initial digraph are applied to ...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
We present role logic, a notation for describing properties of relational structures in shape analysis, databases, and knowledge bases. We construct role logic using the ideas of ...
TC
2008
13 years 9 months ago
2008
Recently, high-energy consumption has become a serious concern for both storage servers and data centers. Recent research studies have utilized the short transition times of multis...
LOGCOM
2007
13 years 9 months ago
2007
We consider the problem of incorporating arbitrary preferences in planning systems. A preference may be seen as a goal or constraint that is desirable, but not necessary, to satis...