Sciweavers

1650 search results - page 48 / 330
» The HOM problem is decidable
Sort
View
FOSSACS
2007
Springer
14 years 1 months ago
Complexity Results on Balanced Context-Free Languages
Abstract. Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such ...
Akihiko Tozawa, Yasuhiko Minamide
ENTCS
2010
136views more  ENTCS 2010»
13 years 5 months ago
A Solver for Modal Fixpoint Logics
We present MLSolver, a tool for solving the satisfiability and validity problems for modal fixpoint logics. The underlying technique is based on characterisations of satisfiabilit...
Oliver Friedmann, Martin Lange
PROPOR
2012
Springer
272views Languages» more  PROPOR 2012»
12 years 3 months ago
Automatic Generation of Cloze Question Stems
Fill-in-the-blank questions are one of the main assessment devices in REAP.PT tutoring system. The problem of automatically generating the stems, i.e. the sentences that serve as b...
Rui Correia, Jorge Baptista, Maxine Eskenazi, Nuno...
JMLR
2012
11 years 10 months ago
Hierarchical Relative Entropy Policy Search
Many real-world problems are inherently hierarchically structured. The use of this structure in an agent’s policy may well be the key to improved scalability and higher performa...
Christian Daniel, Gerhard Neumann, Jan Peters
ILC
2007
Springer
14 years 1 months ago
Towards Model-Checking Programs with Lists
Abstract. We aim at checking safety and temporal properties over models representing the behavior of programs manipulating dynamic singly-linked lists. The properties we consider n...
Alain Finkel, Étienne Lozes, Arnaud Sangnie...