2875 search results - page 196 / 575 » Model checking agentspeak |
123
click to vote
CHARME
2001
Springer
15 years 7 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...
152
Voted
LPNMR
2004
Springer
15 years 8 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...
156
Voted
AGP
2003
IEEE
15 years 8 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 ...
137
click to vote
FMCAD
2000
Springer
15 years 7 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...
147
Voted
DKE
2002
15 years 3 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...