Sciweavers

226 search results - page 4 / 46
» Extensional Theories and Rewriting
Sort
View
TCS
2002
15 years 2 months ago
ELAN from a rewriting logic point of view
ELAN implements computational systems, a concept that combines two first class entities: rewrite rules and rewriting strategies. ELAN can be used either as a logical framework or ...
Peter Borovanský, Claude Kirchner, Hé...
144
Voted
EDBT
2010
ACM
177views Database» more  EDBT 2010»
15 years 10 months ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu
PROCOMET
1998
15 years 4 months ago
Bisimulations in the join-calculus
We develop a theory of bisimulations in the join-calculus. We introduce a refined operational model that makes interactions with the environment explicit, and discuss the impact o...
Michele Boreale, Cédric Fournet, Cosimo Lan...
FSTTCS
2001
Springer
15 years 7 months ago
Rewrite Closure for Ground and Cancellative AC Theories
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
Ashish Tiwari
CADE
2012
Springer
13 years 5 months ago
Rewriting Induction + Linear Arithmetic = Decision Procedure
Abstract. This paper presents new results on the decidability of inductive validity of conjectures. For these results, a class of term rewrite systems (TRSs) with built-in linear i...
Stephan Falke, Deepak Kapur