NDLI: Experimental analyses on phase transitions in compiling satisfiability problems

Content Provider	Springer Nature Link
Author	Gao, Jian Wang, JiaNan Yin, MingHao
Copyright Year	2014
Abstract	In the past decade, a kind of well-known phenomena in many complex combinatorial problems such as satisfiability problem, called phase transition, have been widely studied. In this paper, the phase transition phenomena are investigated during compiling k-satisfiability problems into tractable languages with empirical methods. Ordered binary decision diagram and deterministic-decomposable negation normal form are selected as the tractable target languages for the compilation. Via intensive experiments, it can be concluded that an easy-hard-easy pattern exists during the compilations, which is only related to the ratio of the number of clauses to that of variables if we set k to a fixed value, rather than to the target languages. Moreover, it can be concluded that the space exhausted during the compilations grows exponentially with the number of variables growing, whereas there is also a phase transition separating the polynomial-increment region from the exponential-increment region. Additionally, it can be observed that there is a phase transition of prime implicants around peak points of the easy-hard-easy pattern and the ratios of random instances whose average lengths of prime implicants are larger than the threshold 0.5 change sharply. From these analyses, it can be concluded that prime implicant length and solution interchangeability are crucial impacts on sizes of compilation results.
Starting Page	1
Ending Page	11
Page Count	11
File Format	PDF
ISSN	1674733X
Journal	Science in China Series : Information Sciences
Volume Number	58
Issue Number	3
e-ISSN	18691919
Language	Chinese
Publisher	Science China Press
Publisher Date	2014-11-27
Publisher Place	Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	phase transition knowledge compilation random k-SAT prime implicants easy-hard-easy pattern Information Systems and Communication Service
Content Type	Text
Resource Type	Article
Subject	Computer Science

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 Library 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

A.: Generation of Hard Non-Clausal Random Satisfiability Problems (2005)

Generation of Hard Non-Clausal Random Satisfiability Problems

A novel weighting scheme for random k-SAT

The Hardest Random SAT Problems (1994)

The sat phase transition.

The SAT Phase Transition (1994)

Sat distributions with planted assignments and phase transitions between decision and optimization problems (2005).

Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT (2001)

Artificial intelligence research note easy problems are sometimes hard* (1993).

Experimental analyses on phase transitions in compiling satisfiability problems

Similar Documents

A.: Generation of Hard Non-Clausal Random Satisfiability Problems (2005)

Generation of Hard Non-Clausal Random Satisfiability Problems

A novel weighting scheme for random k-SAT

The Hardest Random SAT Problems (1994)

The sat phase transition.

The SAT Phase Transition (1994)

Sat distributions with planted assignments and phase transitions between decision and optimization problems (2005).

Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT (2001)

Artificial intelligence research note easy problems are sometimes hard* (1993).

Experimental analyses on phase transitions in compiling satisfiability problems