Sciweavers

428 search results - page 3 / 86
» FPGA-Based SAT Solver
Sort
View
SAT
2004
Springer
88views Hardware» more  SAT 2004»
13 years 11 months ago
Improving First-order Model Searching by Propositional Reasoning and Lemma Learning
The finite model generation problem in the first-order logic is a generalization of the propositional satisfiability (SAT) problem. An essential algorithm for solving the proble...
Zhuo Huang, Hantao Zhang, Jian Zhang
AIPS
2006
13 years 7 months ago
Lemma Reusing for SAT based Planning and Scheduling
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
Hidetomo Nabeshima, Takehide Soh, Katsumi Inoue, K...
CP
2009
Springer
14 years 6 months ago
On the Power of Clause-Learning SAT Solvers with Restarts
In this work, we improve on existing work that studied the relationship between the proof system of modern SAT solvers and general resolution. Previous contributions such as those ...
Knot Pipatsrisawat, Adnan Darwiche
MTV
2003
IEEE
126views Hardware» more  MTV 2003»
13 years 11 months ago
Heuristic Backtracking Algorithms for SAT
In recent years backtrack search SAT solvers have been the subject of dramatic improvements. These improvements allowed SAT solvers to successfully replace BDDs in many areas of f...
Ateet Bhalla, Inês Lynce, José T. de ...
JSAT
2008
80views more  JSAT 2008»
13 years 5 months ago
Solving Weighted Max-SAT Problems in a Reduced Search Space: A Performance Analysis
We analyze, in this work, the performance of a recently introduced weighted Max-SAT solver, Clone, in the Max-SAT evaluation 2007. Clone utilizes a novel bound computation based o...
Knot Pipatsrisawat, Akop Palyan, Mark Chavira, Art...