183 search results - page 37 / 37 » Exemplaric Expressivity of Modal Logics |
149
click to vote
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
One of the most challenging aspects of reasoning, planning, and acting in a multi-agent domain is reasoning about what the agents know about the knowledge of their fellows, and to...
146
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
158
click to vote
MFCS
1991
Springer
15 years 7 months ago
1991
Springer
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still w...