Sciweavers

471 search results - page 48 / 95
» Modals As A Problem For MT
Sort
View
ICALP
2010
Springer
15 years 4 months ago
Model Checking Succinct and Parametric One-Counter Automata
We investigate the decidability and complexity of various model checking problems over one-counter automata. More specifically, we consider succinct one-counter automata, in which...
Stefan Göller, Christoph Haase, Joël Oua...
AMAST
2006
Springer
15 years 3 months ago
Hyperfinite Approximations to Labeled Markov Transition Systems
The problem of finding an approximation to a labeled Markov transition system through hyperfinite transition systems is addressed. It is shown that we can find for each countable ...
Ernst-Erich Doberkat
CORR
2010
Springer
141views Education» more  CORR 2010»
14 years 12 months ago
The complexity of linear-time temporal logic over the class of ordinals
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...
Stéphane Demri, Alexander Rabinovich
DLOG
2003
15 years 1 months ago
Extensions to Description Logics
This chapter considers, on the one hand, extensions of Description Logics by features not available in the basic framework, but considered important for using Description Logics a...
Franz Baader, Ralf Küsters, Frank Wolter
AAAI
1990
15 years 1 months ago
Understanding Natural Language with Diagrams
We describe a program, BEATRIX, that can understand textbook physics problems specified by a combination of English text and a diagram. The result of the understanding process is ...
Gordon S. Novak, William C. Bulko