Sciweavers

9532 search results - page 17 / 1907
» Logic, Graphs, and Algorithms
Sort
View
87
Voted
POPL
2000
ACM
15 years 4 months ago
(Optimal) Duplication is not Elementary Recursive
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
Andrea Asperti, Paolo Coppola, Simone Martini
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
15 years 4 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
104
Voted
LMCS
2006
119views more  LMCS 2006»
15 years 15 days ago
The monadic second-order logic of graphs XVI : Canonical graph decompositions
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more ge...
Bruno Courcelle
82
Voted
EUSFLAT
2009
120views Fuzzy Logic» more  EUSFLAT 2009»
14 years 10 months ago
A Monge Algorithm for Computing the Choquet Integral on Set Systems
Ulrich Faigle, Michel Grabisch