Sciweavers

234 search results - page 9 / 47
» Deduction, Strategies, and Rewriting
Sort
View
PADL
2001
Springer
14 years 6 hour ago
Specifying Authentication Protocols Using Rewriting and Strategies
Abstract. Programming with rewrite rules and strategies has been already used for describing several computational logics. This paper describes the way the Needham-Schroeder Public...
Horatiu Cirstea
ICLP
1997
Springer
13 years 11 months ago
Parallel Evaluation Strategies for Functional Logic Languages
We introduce novel, sound, complete, and locally optimal evaluation strategies for functional logic programming languages. Our strategies combine, in a non-trivial way, two landma...
Sergio Antoy, Rachid Echahed, Michael Hanus
PODS
2003
ACM
114views Database» more  PODS 2003»
14 years 7 months ago
Soft stratification for magic set based query evaluation in deductive databases
In this paper we propose a new bottom-up query evaluation method for stratified deductive databases based on the Magic Set approach. As the Magic Sets rewriting may lead to unstra...
Andreas Behrend
ENTCS
2008
106views more  ENTCS 2008»
13 years 7 months ago
Towards a Sharing Strategy for the Graph Rewriting Calculus
The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...
Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, C...
EPIA
1993
Springer
13 years 11 months ago
Resolution of Constraints in Algebras of Rational Trees
Abstract. This work presents a constraint solver for the domain of rational trees. Since the problem is NP-hard the strategy used by the solver is to reduce as much as possible, in...
Luís Damas, Nelma Moreira, Sabine Broda