๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The complexity of deciding controllability

โœ Scribed by Matthias Kawski

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
405 KB
Volume
15
Category
Article
ISSN
0167-6911

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the decidability and complexity of re
On the decidability and complexity of reasoning about only knowing
โœ Riccardo Rosati ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 205 KB

We study reasoning in Levesque's logic of only knowing. In particular, we first prove that extending a decidable subset of first-order logic with the ability of reasoning about only knowing preserves decidability of reasoning, as long as quantifying-in is not allowed in the language, and define a ge

Decidability and complexity of event det
Decidability and complexity of event detection problems for ODEs
โœ Keijo Ruohonen ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 182 KB ๐Ÿ‘ 2 views

The ability of ordinary differential equations (ODEs) to simulate discrete machines with a universal computing power indicates a new source of difficulties for event detection problems. Indeed, nearly any kind of event detection is algorithmically undecidable for infinite or finite half-open time in