Sciweavers

201 search results - page 7 / 41
» Declaring Numbers
Sort
View
WFLP
2009
Springer
277views Algorithms» more  WFLP 2009»
14 years 4 months ago
Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
Stephan Falke, Deepak Kapur
DEBU
1999
85views more  DEBU 1999»
13 years 9 months ago
Specifying Database Transformations in WOL
WOL is a Horn-clause language for specifying transformations involving complex types and recursive data-structures. Its declarative syntax makes programs easy to modify in respons...
Susan B. Davidson, Anthony Kosky
IDEAS
1999
IEEE
130views Database» more  IDEAS 1999»
14 years 2 months ago
A Heuristics-Based Approach to Query Optimization in Structured Document Databases
The number of documents published via WWW in form of SGML/HTML has been rapidly growing for years. Efficient, declarative access mechanisms for this type of documents
Dunren Che, Karl Aberer
APLAS
2005
ACM
14 years 3 months ago
Using Datalog with Binary Decision Diagrams for Program Analysis
Many problems in program analysis can be expressed naturally and concisely in a declarative language like Datalog. This makes it easy to specify new analyses or extend or compose e...
John Whaley, Dzintars Avots, Michael Carbin, Monic...
SDM
2009
SIAM
130views Data Mining» more  SDM 2009»
14 years 7 months ago
Grammar Mining.
We introduce the problem of grammar mining, where patterns are context-free grammars, as a generalization of a large number of common pattern mining tasks, such as tree, sequence ...
Luc De Raedt, Siegfried Nijssen