NDLI: Heuristic backtracking algorithms for SAT

Content Provider	IEEE Xplore Digital Library
Author	Bhalla, A. Lynce, I. de Sousa, J.T. Marques-Silva, J.
Copyright Year	2003
Description	Author affiliation: Inst. Superior Tecnico, Tech. Univ. Lisbon, Portugal (Bhalla, A.; Lynce, I.; de Sousa, J.T.; Marques-Silva, J.)
Abstract	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 formal verification, and also motivated the development of many new challenging problem instances, many of which too hard for the current generation of SAT solvers. As a result, further improvements to SAT technology are expected to have key consequences informal verification. The objective is to propose heuristic approaches to the backtrack step of backtrack search SAT solvers, with the goal of increasing the ability of the SAT solver to search different parts of the search space. The proposed heuristics to the backtrack step are inspired by the heuristics proposed in recent years for the branching step of SAT solvers, namely VSIDS and some of its improvements. The preliminary experimental results are promising, and motivate the integration of heuristic backtracking in state-of-the-art SAT solvers.
Sponsorship	IEEE Comput. Soc. Test Tecnol. Tech. Council
Starting Page	69
Ending Page	74
File Size	254789
Page Count	6
File Format	PDF
ISBN	0769520456
DOI	10.1109/MTV.2003.1250265
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2003-05-30
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Heuristic algorithms Formal verification Space technology Data structures Boolean functions NP-complete problem Application software Computer science Design engineering Artificial intelligence
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Libarray of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Implicit enumeration of strongly connected components and an application to formal verification

Hybrid SAT Solver Considering Circuit Observability

Efficient graph based representation of multi-valued functions with an application to genetic algorithms

Grouping heuristics for word-level decision diagrams

A Hardware Accelerator for SAT Solving

FPGA-Based SAT Solver

Heuristic backtracking algorithms for SAT (2003)

Mod-p decision diagrams: a data structure for multiple-valued functions

Incremental deductive & inductive reasoning for SAT-based bounded model checking

Heuristic backtracking algorithms for SAT

Similar Documents

Implicit enumeration of strongly connected components and an application to formal verification

Hybrid SAT Solver Considering Circuit Observability

Efficient graph based representation of multi-valued functions with an application to genetic algorithms

Grouping heuristics for word-level decision diagrams

A Hardware Accelerator for SAT Solving

FPGA-Based SAT Solver

Heuristic backtracking algorithms for SAT (2003)

Mod-p decision diagrams: a data structure for multiple-valued functions

Incremental deductive & inductive reasoning for SAT-based bounded model checking

Heuristic backtracking algorithms for SAT