Sciweavers

882 search results - page 88 / 177
» A Taste of Rewrite Systems
Sort
View
WOLLIC
2010
Springer
14 years 1 months ago
Reduction of the Intruder Deduction Problem into Equational Elementary Deduction for Electronic Purse Protocols with Blind Signa
Abstract. The intruder deduction problem for an electronic purse protocol with blind signatures is considered. The algebraic properties of the protocol are modeled by an equational...
Daniele Nantes Sobrinho, Mauricio Ayala-Rinc&oacut...
PLILP
1993
Springer
14 years 27 days ago
A Demand Driven Computation Strategy for Lazy Narrowing
Many recent proposals for the integration of functional and logic programming use conditional term rewriting systems (CTRS) as programs and narrowing as goal solving mechanism. Thi...
Rita Loogen, Francisco Javier López-Fraguas...
POPL
1994
ACM
14 years 27 days ago
A Needed Narrowing Strategy
Abstract: The narrowing relation over terms constitutes the basis of the most important operational semantics of languages that integrate functional and logic programming paradigms...
Sergio Antoy, Rachid Echahed, Michael Hanus
NAACL
2007
13 years 10 months ago
A Case For Shorter Queries, and Helping Users Create Them
Information retrieval systems are frequently required to handle long queries. Simply using all terms in the query or relying on the underlying retrieval model to appropriately wei...
Giridhar Kumaran, James Allan
APBC
2004
154views Bioinformatics» more  APBC 2004»
13 years 10 months ago
Dispensation Order Generation for Pyrosequencing
This article describes a dispensation order generation algorithm for genotyping using the Pyrosequencing method. The input template of the algorithm is a slightly restricted regul...
Mats Carlsson, Nicolas Beldiceanu