PFGASAT - a genetic SAT solver combining partitioning and fuzzy strategies

Author

Zhao, Jianzhou ; Bian, Jinian ; Wu, Weimin

Author_Institution

Dept. of Comput. Sci. & Technol., Tsinghua Univ.

fYear

2004

Firstpage

108

Abstract

This paper is concerned with Boolean satisfiability (SAT) problem. Many researchers are devoted into seeking for new ideas as well as developing more efficient SAT solvers which will improve the development of EDA (electronic design automation). In this paper, we try to solve the SAT problem by fuzzy genetic algorithm with partitioning-based initial process, namely PFGASAT. Some heuristic mechanisms have been introduced which make the algorithm more intellective. Primary experiments show that PFGASAT can solve SAT problems with more than 15 k variables while behaves rather stably and robustly

Keywords

Boolean algebra; electronic design automation; fuzzy logic; genetic algorithms; Boolean satisfiability; PFGASAT; electronic design automation; fuzzy genetic algorithm; genetic SAT solver; heuristic mechanisms; Automatic testing; Binary decision diagrams; Boolean functions; Computer science; Electronic design automation and methodology; Electronic equipment testing; Evolutionary computation; Genetic algorithms; Partitioning algorithms; Robustness;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Software and Applications Conference, 2004. COMPSAC 2004. Proceedings of the 28th Annual International

Conference_Location

Hong Kong

ISSN

0730-3157

Print_ISBN

0-7695-2209-2

Type

conf

DOI

10.1109/CMPSAC.2004.1342813

Filename

1342813