2875 search results - page 196 / 575 » Model checking agentspeak |
168
click to vote
CHARME
2001
Springer
15 years 10 months ago
2001
Springer
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
197
click to vote
LPNMR
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
196
click to vote
AGP
2003
IEEE
15 years 11 months ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
169
click to vote
FMCAD
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We consider the problem of refinement checking for asynchronous processes where refinement corresponds to stutter-closed language inclusion. Since an efficient algorithmi...
187
click to vote
DKE
2002
15 years 6 months ago
2002
Object-Oriented modeling and design methodologies have been receiving a significant attention since they allow a quick and easy-to-gasp overview about a complex model. However, in...