Sciweavers

4767 search results - page 5 / 954
» Structures for Abstract Rewriting
Sort
View
GEOS
2009
Springer
14 years 2 days ago
SPARQL Query Re-writing Using Partonomy Based Transformation Rules
Abstract. Often the information present in a spatial knowledge base is represented at a different level of granularity and abstraction than the query constraints. For querying onto...
Prateek Jain, Peter Z. Yeh, Kunal Verma, Cory A. H...
AGTIVE
1999
Springer
13 years 11 months ago
DiTo - A Distribution Tool Based on Graph Rewriting
Abstract. In the paper Support for Design Patterns through Graph Transformation Tools in this volume, we have already outlined the global structure of a tool that allows for the an...
Ansgar Radermacher
PPDP
2009
Springer
14 years 2 months ago
Set functions for functional logic programming
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
Sergio Antoy, Michael Hanus
WADT
1998
Springer
13 years 11 months ago
Complete Strategies for Term Graph Narrowing
Abstract. Narrowing is a method for solving equations in the equational theories of term rewriting systems. Unification and rewriting, the central operations in narrowing, are ofte...
Annegret Habel, Detlef Plump
SIGCSE
1999
ACM
93views Education» more  SIGCSE 1999»
13 years 11 months ago
Patterns for decoupling data structures and algorithms
In order to build a data structure that is extensible and reusable, it is necessary to decouple the intrinsic and primitive behavior of the structure from the application specific...
Dung Zung Nguyen, Stephen B. Wong