3147 search results - page 371 / 630 » Open-Source Model Checking |
125
click to vote
LPAR
2000
Springer
15 years 8 months ago
2000
Springer
In this paper, we determine the complexity of propositional theory curbing. Theory Curbing is a nonmonotonic technique of common sense reasoning that is based on model minimality b...
105
Voted
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
We present a proof-technique for reducing the nondeterminbstract agent specifications in a BDI framework by means of refinement. We implement the operational semantics of agent sp...
155
click to vote
FORTE
2004
15 years 5 months ago
2004
Numerous specialized ad hoc routing protocols are currently proposed for use, or being implemented. Few of them have been subjected to formal verification. This paper evaluates two...
118
click to vote
COLING
1992
15 years 5 months ago
1992
The main problem arising from the use of complex constraints in Computational Linguists is due to the NP-hardness of checking whether a given set of constraints is satisfiable and...
132
click to vote
JUCS
2006
15 years 4 months ago
2006
: The size and complexity of software systems are continuously increasing, which makes them difficult and labor-intensive to develop, test and evolve. Since concurrent systems are ...