Sciweavers

1000 search results - page 147 / 200
» Nominal rewriting systems
Sort
View
FLOPS
2004
Springer
14 years 2 months ago
Basic Pattern Matching Calculi: a Fresh View on Matching Failure
We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. Compared with...
Wolfram Kahl
AGTIVE
2003
Springer
14 years 1 months ago
On Graphs in Conceptual Engineering Design
Abstract. This paper deals with knowledge-based computer aided design. A novel method giving additional support for conceptual design is presented. In this method, a designer firs...
Janusz Szuba, Agnieszka Ozimek, Andy Schürr
ISMVL
2010
IEEE
188views Hardware» more  ISMVL 2010»
14 years 1 months ago
MDGs Reduction Technique Based on the HOL Theorem Prover
—Multiway Decision Graphs (MDGs) subsume Binary Decision Diagrams (BDDs) and extend them by a first-order formulae suitable for model checking of data path circuits. In this pap...
Sa'ed Abed, Otmane Aït Mohamed
TABLEAUX
2009
Springer
14 years 1 months ago
Tableaux for Projection Computation and Knowledge Compilation
Projection computation is a generalization of second-order quantifier elimination, which in turn is closely related to the computation of forgetting and of uniform interpolants. O...
Christoph Wernhard
FOSSACS
2001
Springer
14 years 1 months ago
On the Modularity of Deciding Call-by-Need
In a recent paper we introduced a new framework for the study of call by need computations. Using elementary tree automata techniques and ground tree transducers we obtained simple...
Irène Durand, Aart Middeldorp