Towards Effective Parameter-Free Clause Weighting Local Search for SAT

Loading...
Thumbnail Image
File version
Primary Supervisor

Sattar, Abdul

Other Supervisors

Thornton, John

Editor(s)
Date
2008
Size
File type(s)
Location
License
Abstract

Recent research has shown that it is often preferable to encode real-world problems as propositional satisfiability (SAT) problems, and then solve them using general purpose SAT solvers. However, most SAT solvers require the tuning of parameters in order to obtain optimum performance. Tuning these parameters usually takes a considerable amount of time, and even to achieve average performance can require many runs with many different parameter settings. In this thesis we investigate various ways to improve the overall performance of local search solvers via new techniques that do not employ parameters and therefore take considerably less time for experimentation...

Journal Title
Conference Title
Book Title
Edition
Volume
Issue
Thesis Type

Thesis (PhD Doctorate)

Degree Program

Doctor of Philosophy (PhD)

School

Institute for Integrated and Intelligent Systems

Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement

The author owns the copyright in this thesis, unless stated otherwise.

Item Access Status

Public

Note
Access the data
Related item(s)
Subject

propositional satisfiability problems

SAT problems

SAT solvers

propositional satisfiability paradigm

artificial intelligence

constraint satisfaction problems

CSPs

Persistent link to this record
Citation