Sciweavers

23201 search results - page 61 / 4641
» Rewriting Systems with Data
Sort
View
RR
2010
Springer
15 years 3 months ago
Query-Based Access Control for Ontologies
Role-based access control is a standard mechanism in information systems. Based on the role a user has, certain information is kept from the user even if requested. For ontologies ...
Martin Knechtel, Heiner Stuckenschmidt
FSTTCS
2006
Springer
15 years 8 months ago
Context-Sensitive Dependency Pairs
Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although there is a good number of techniques for proving termination of co...
Beatriz Alarcón, Raúl Gutiérr...
CSJM
2008
112views more  CSJM 2008»
15 years 5 months ago
About Precise Characterization of Languages Generated by Hybrid Networks of Evolutionary Processors with One Node
A hybrid network of evolutionary processors (an HNEP) is a graph where each node is associated with an evolutionary processor (a special rewriting system), a set of words, an inpu...
Artiom Alhazov, Yurii Rogozhin
BIRTHDAY
2005
Springer
15 years 10 months ago
Reducing Right-Hand Sides for Termination
We propose two transformations on term rewrite systems (TRSs) based on reducing right hand sides: one related to the transformation order and a variant of dummy elimination. Under ...
Hans Zantema
CSR
2009
Springer
15 years 9 months ago
The Reachability Problem over Infinite Graphs
Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is centra...
Wolfgang Thomas