Sciweavers

882 search results - page 14 / 177
» A Taste of Rewrite Systems
Sort
View
RTA
1997
Springer
13 years 11 months ago
Innocuous Constructor-Sharing Combinations
Abstract. We investigate conditions under which con uence and or termination are preserved for constructor-sharing and hierarchical combinations of rewrite systems, one of which is...
Nachum Dershowitz
CTRS
1992
13 years 11 months ago
Decidability of Regularity and Related Properties of Ground Normal Form Languages
ded abstract of this paper is published in the proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems, Pont- -Mousson, 1992 1
Gregory Kucherov, Mohamed Tajine
FROCOS
2009
Springer
14 years 2 months ago
Automating Theories in Intuitionistic Logic
Deduction modulo consists in applying the inference rules of a deductive system modulo a rewrite system over terms and formulæ. This is equivalent to proving within a so-called co...
Guillaume Burel
WFLP
2009
Springer
277views Algorithms» more  WFLP 2009»
14 years 2 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
SEMWEB
2009
Springer
14 years 2 months ago
Practical Aspects of Query Rewriting for OWL 2
Abstract. Query answering for the QL profile of OWL 2 and a substantial fragment of the EL profile can be implemented via query rewriting. In our previous work, we presented RQR...
Héctor Pérez-Urbina, Ian Horrocks, B...