Sciweavers

3199 search results - page 292 / 640
» Variability in Automation System Models
Sort
View
170
Voted
LPAR
2005
Springer
16 years 3 days ago
Termination of Fair Computations in Term Rewriting
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
Salvador Lucas, José Meseguer
174
Voted
ASP
2001
Springer
15 years 11 months ago
Useful Transformations in Answer set programming
We define a reduction system Ë¿ which preserves the stable semantics. This system includes two types of transformation rules. One type (which we call ˾) preserves the stable...
Mauricio Osorio, Juan Carlos Nieves, Chris Giannel...
CL
2006
Springer
15 years 6 months ago
Co-evolving code and design with intensional views: A case study
Intensional views and relations have been proposed as a way of actively documenting high-level structural regularities in the source code of a software system. By checking conform...
Kim Mens, Andy Kellens, Frédéric Plu...
LICS
1996
IEEE
15 years 10 months ago
The Theory of Hybrid Automata
Ahybrid automatonis a formalmodelfor a mixeddiscrete-continuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically...
Thomas A. Henzinger
NAACL
2010
15 years 4 months ago
Learning about Voice Search for Spoken Dialogue Systems
In a Wizard-of-Oz experiment with multiple wizard subjects, each wizard viewed automated speech recognition (ASR) results for utterances whose interpretation is critical to task s...
Rebecca J. Passonneau, Susan L. Epstein, Tiziana L...