Sciweavers

882 search results - page 115 / 177
» A Taste of Rewrite Systems
Sort
View
RTA
2004
Springer
14 years 2 months ago
Automated Termination Proofs with AProVE
We describe the system AProVE, an automated prover to verify (innermost) termination of term rewrite systems (TRSs). For this system, we have developed and implemented efficient al...
Jürgen Giesl, René Thiemann, Peter Sch...
FLOPS
1999
Springer
14 years 1 months ago
Typed Higher-Order Narrowing without Higher-Order Strategies
We describe a new approach to higher-order narrowing computations in a class of systems suitable for functional logic programming. Our approach is based on a translation of these s...
Sergio Antoy, Andrew P. Tolmach
CORR
2011
Springer
185views Education» more  CORR 2011»
13 years 3 months ago
Sound and Complete Query Answering in Intensional P2P Data Integration
Contemporary use of the term ’intension’ derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intens...
Zoran Majkic
IHI
2010
198views Healthcare» more  IHI 2010»
13 years 3 months ago
Large-scale multimodal mining for healthcare with mapreduce
Recent advances in healthcare and bioscience technologies and proliferation of portable medical devices are producing massive amounts of multimodal data. The need for parallel pro...
Fei Wang, Vuk Ercegovac, Tanveer Fathima Syeda-Mah...
ICLP
2005
Springer
14 years 2 months ago
A Type System for CHR
Abstract. We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule language for implementing constraint solvers. CHR being a high-level extension ...
Emmanuel Coquery, François Fages