Sciweavers

1000 search results - page 56 / 200
» Nominal rewriting systems
Sort
View
RTA
1995
Springer
13 years 11 months ago
Prototyping Completion with Constraints Using Computational Systems
We use computational systems to express a completion with constraints procedure that gives priority to simplifications. Computational systems are rewrite theories enriched by stra...
Hélène Kirchner, Pierre-Etienne More...
MP
2006
87views more  MP 2006»
13 years 7 months ago
A Robust Optimization Approach to Dynamic Pricing and Inventory Control with no Backorders
In this paper, we present a robust optimization formulation for dealing with demand uncertainty in a dynamic pricing and inventory control problem for a make-to-stock manufacturing...
Elodie Adida, Georgia Perakis
ENTCS
2002
128views more  ENTCS 2002»
13 years 7 months ago
Rewriting Calculus with(out) Types
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
Horatiu Cirstea, Claude Kirchner, Luigi Liquori
MKM
2009
Springer
14 years 2 months ago
Exploring a Quantum Theory with Graph Rewriting and Computer Algebra
Graphical languages provide a powerful tool for describing the behaviour of quantum systems. While the use of graphs vastly reduces the complexity of many calculations [4,10], manu...
Aleks Kissinger
FROCOS
2005
Springer
14 years 1 months ago
Proving Liveness with Fairness Using Rewriting
Abstract. In this paper we combine rewriting techniques with verification issues. More precisely, we show how techniques for proving relative termination of term rewrite systems (...
Adam Koprowski, Hans Zantema