2302 search results - page 317 / 461 » Basic Description Logics |
230
click to vote
KESAMSTA
2011
Springer
14 years 8 months ago
2011
Springer
Creating modular behaviours in JADE using a traditional method such as the FSM (Finite State Machine) can be a difficult task to achieve. The first issue with FSMs is that they do...
134
click to vote
CICLING
2003
Springer
15 years 10 months ago
2003
Springer
In setting up a formal system to specify a grammar formalism, the conventional (mathematical) wisdom is to start with primitives (basic primitive structures) as simple as possible...
143
click to vote
HYBRID
2010
Springer
15 years 11 months ago
2010
Springer
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...
126
click to vote
APSEC
2005
IEEE
15 years 10 months ago
2005
IEEE
We report on a case study in which the Maude model checker has been used to analyze the Suzuki-Kasami distributed mutual exclusion algorithm with respect to the mutual exclusion p...
134
Voted
AMAI
2004
Springer
15 years 10 months ago
2004
Springer
We introduce a general formalism of production inference relations that posses both a standard monotonic semantics and a natural nonmonotonic semantics. The resulting nonmonotonic...