Sciweavers

383 search results - page 41 / 77
» Abstracting Complex Languages through Transformation and Com...
Sort
View
ICDT
2003
ACM
126views Database» more  ICDT 2003»
15 years 6 months ago
Typechecking Top-Down Uniform Unranked Tree Transducers
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...
Wim Martens, Frank Neven
POPL
1995
ACM
15 years 4 months ago
Default Timed Concurrent Constraint Programming
d Abstract) We extend the model of [VRV94] to express strong time-outs (and pre-emption): if an event A does not happen through time t, cause event B to happen at time t. Such con...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta
PADL
2000
Springer
15 years 5 months ago
Transformation-by-Example for XML
Abstract. xml is a language for describing markup languages for structured data. A growing number of applications that process xml documents are transformers, i.e., programs that c...
Shriram Krishnamurthi, Kathryn E. Gray, Paul T. Gr...
DLOG
2001
15 years 2 months ago
Preserving Modularity in XML Encoding of Description Logics
Description logics have been designed and studied in a modular way. This has allowed a methodic approach to complexity evaluation. We present a way to preserve this modularity in ...
Jérôme Euzenat
VL
2006
IEEE
15 years 7 months ago
Sketching with Conceptual Metaphors to Explain Computational Processes
To explore how people conceptualize a complex system, 232 university students were asked to sketch how a search engine works. While the sketches reveal a diverse range of visual a...
David G. Hendry