Sciweavers

141 search results - page 16 / 29
» sat 2010
Sort
View
SAT
2010
Springer
178views Hardware» more  SAT 2010»
15 years 1 months ago
Proof Complexity of Propositional Default Logic
Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and s...
Olaf Beyersdorff, Arne Meier, Sebastian Mülle...
SAT
2010
Springer
136views Hardware» more  SAT 2010»
15 years 1 months ago
A Non-prenex, Non-clausal QBF Solver with Game-State Learning
Abstract. We describe a DPLL-based solver for the problem of quantified boolean formulas (QBF) in non-prenex, non-CNF form. We make two contributions. First, we reformulate clause...
William Klieber, Samir Sapra, Sicun Gao, Edmund M....
TCAD
2010
154views more  TCAD 2010»
14 years 4 months ago
Automated Design Debugging With Maximum Satisfiability
As contemporary VLSI designs grow in complexity, design debugging has rapidly established itself as one of the largest bottlenecks in the design cycle today. Automated debug soluti...
Yibin Chen, Sean Safarpour, João Marques-Si...
CAV
2010
Springer
176views Hardware» more  CAV 2010»
14 years 12 months ago
Lazy Annotation for Program Testing and Verification
Abstract. We describe an interpolant-based approach to test generation and model checking for sequential programs. The method generates Floyd/Hoare style annotations of the program...
Kenneth L. McMillan
73
Voted
JELIA
2010
Springer
14 years 7 months ago
A Dynamic-Programming Based ASP-Solver
Abstract. We present a novel system for propositional Answer-Set Programming (ASP). This system, called dynASP, is based on dynamic programming and thus significantly differs fro...
Michael Morak, Reinhard Pichler, Stefan Rümme...