Sciweavers

10 search results - page 1 / 2
» On the Relative Strength of Pebbling and Resolution
Sort
View
COCO
2010
Springer
129views Algorithms» more  COCO 2010»
13 years 8 months ago
On the Relative Strength of Pebbling and Resolution
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
Jakob Nordström
CAV
2012
Springer
222views Hardware» more  CAV 2012»
11 years 6 months ago
Leveraging Interpolant Strength in Model Checking
Craig interpolation is a well known method of abstraction successfully used in both hardware and software model checking. The logical strength of interpolants can affect the quali...
Simone Fulvio Rollini, Ondrej Sery, Natasha Sharyg...
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
14 years 4 months ago
Narrow proofs may be spacious: separating space and width in resolution
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
Jakob Nordström
CORR
2011
Springer
143views Education» more  CORR 2011»
12 years 8 months ago
Towards Understanding and Harnessing the Potential of Clause Learning
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...
Paul Beame, Henry A. Kautz, Ashish Sabharwal
JAIR
1998
89views more  JAIR 1998»
13 years 4 months ago
An Empirical Approach to Temporal Reference Resolution
Scheduling dialogs, during which people negotiate the times of appointments, are common in everyday life. This paper reports the results of an in-depth empirical investigation of ...
Janyce Wiebe, Thomas P. O'Hara, Thorsten Öhrs...