Sciweavers

500 search results - page 31 / 100
» ACD Term Rewriting
Sort
View
FROCOS
2009
Springer
15 years 4 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
CIE
2008
Springer
14 years 11 months ago
Union of Reducibility Candidates for Orthogonal Constructor Rewriting
We revisit Girard's reducibility candidates by proposing a general of the notion of neutral terms. They are the terms which do not interact with some contexts called eliminati...
Colin Riba
CIKM
2010
Springer
14 years 8 months ago
Query optimization for ontology-based information integration
In recent years, there has been an explosion of publicly available RDF and OWL data sources. In order to effectively and quickly answer queries in such an environment, we present...
Yingjie Li, Jeff Heflin
92
Voted
CORR
2006
Springer
120views Education» more  CORR 2006»
14 years 9 months ago
Termination orders for 3-dimensional rewriting
Abstract: This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource ma...
Yves Guiraud
ESWS
2008
Springer
14 years 11 months ago
Viewing and Querying Topic Maps in terms of RDF
Both Topic Maps and RDF are popular semantic web standards designed for machine processing of web documents. Since these representations were originally created for different purpo...
Silvia Stefanova, Tore Risch