Sciweavers

119 search results - page 16 / 24
» Tree-Width for First Order Formulae
Sort
View
AAAI
2006
15 years 1 months ago
Model Counting: A New Strategy for Obtaining Good Bounds
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
Carla P. Gomes, Ashish Sabharwal, Bart Selman
JSYML
2008
74views more  JSYML 2008»
15 years 8 days ago
Omitting types for finite variable fragments and complete representations of algebras
. We give a novel application of algebraic logic to first order logic. A new, flexible construction is presented for representable but not completely representable atomic relation ...
Tarek Sayed Ahmed, Hajnal Andréka, Istv&aac...
92
Voted
SIAMSC
2008
142views more  SIAMSC 2008»
15 years 7 days ago
A Fast Direct Solver for the Biharmonic Problem in a Rectangular Grid
We present a fast direct solver methodology for the Dirichlet biharmonic problem in a rectangle. The solver is applicable in the case of the second order Stephenson scheme [34] as ...
Matania Ben-Artzi, Jean-Pierre Croisille, Dalia Fi...
ICCAD
1994
IEEE
137views Hardware» more  ICCAD 1994»
15 years 4 months ago
Dynamic scheduling and synchronization synthesis of concurrent digital systems under system-level constraints
We present in this paper a novel control synthesis technique for system-level specifications that are better described as a set of concurrent synchronous descriptions, their synch...
Claudionor José Nunes Coelho Jr., Giovanni ...
ICDT
2009
ACM
125views Database» more  ICDT 2009»
16 years 1 months ago
How big must complete XML query languages be?
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
Clemens Ley, Michael Benedikt