2911 search results - page 490 / 583 » A Logic of Graph Constraints |
105
Voted
ATVA
2007
Springer
15 years 6 months ago
2007
Springer
Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed...
142
Voted
PODS
1994
ACM
15 years 4 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
144
click to vote
ERSHOV
2009
Springer
15 years 4 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
140
click to vote
TLDI
2010
ACM
15 years 24 days ago
2010
ACM
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...
118
Voted
INFORMS
1998
15 years 8 days ago
1998
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generatio...