2022 search results - page 235 / 405 » Complexity of Non-Monotonic Logics |
152
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
Today many formalisms exist for specifying complex Markov chains. In contrast, formalism for specifying the quantitative properties to analyze have remained quite primitive. In th...
190
click to vote
JISBD
2001
15 years 7 months ago
2001
Migration of Legacy Systems to the Web is one of the main concerns of enterprises looking for more flexible distributed application environments. This migration process comprises t...
174
click to vote
PSTV
1993
15 years 7 months ago
1993
We present a new algorithm that can be used for solving the model−checking problem for linear−time temporal logic. This algorithm can be viewed as the combination of two exist...
168
click to vote
GLOBECOM
2008
IEEE
15 years 7 months ago
2008
IEEE
— Nodes forming mobile ad hoc networks (MANET) nodes can be logically partitioned into 1) a selfish user agent serving the interests of the end user (owner) of the mobile device...
164
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...