Sciweavers

552 search results - page 30 / 111
» Languages Modulo Normalization
Sort
View
ICIW
2008
IEEE
14 years 4 months ago
XML Semantic Filtering via Ontology Reasoning
In this paper, we present an extension of PHIL, a declarative language for filtering information from XML data. The proposed approach allows us to extract relevant data as well a...
Michele Baggi, Moreno Falaschi, Demis Ballis
EMSOFT
2007
Springer
14 years 4 months ago
E-FRP with priorities
E-FRP is declarative language for programming resourcebounded, event-driven systems. The original high-level semantics of E-FRP requires that each event handler execute atomically...
Roumen Kaiabachev, Walid Taha, Angela Yun Zhu
RTA
2005
Springer
14 years 3 months ago
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, ...
LISP
2008
105views more  LISP 2008»
13 years 10 months ago
Proving operational termination of membership equational programs
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
Francisco Durán, Salvador Lucas, Claude Mar...
PVLDB
2010
105views more  PVLDB 2010»
13 years 8 months ago
Destabilizers and Independence of XML Updates
Independence analysis is the problem of determining whether an update affects the result of a query, e.g. a constraint or materialized view. We develop a new, modular framework fo...
Michael Benedikt, James Cheney