[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science (1991)

San Juan, Puerto Rico

Oct. 1, 1991 to Oct. 4, 1991

ISBN: 0-8186-2445-0

pp: 163-169

C.H. Papadimitriou , Dept. of Comput. Sci.&Eng., California Univ., San Diego, CA, USA

ABSTRACT

The complexity of certain natural generalizations of satisfiability, in which one of the possibly exponentially many satisfying truth assignments must be selected, is studied. Two natural selection criteria, default preference and minimality (circumscription), are considered. The thrust of the complexity results seems to be that hard problems become harder, while easy problems remain easy. This consideration yields as a byproduct a new and very natural polynomial-time randomized algorithm for 2SAT.

INDEX TERMS

2SAT, satisfying truth assignment selection, complexity, natural generalizations, satisfiability, selection criteria, default preference, minimality, circumscription, polynomial-time randomized algorithm

CITATION

C. Papadimitriou, "On selecting a satisfying truth assignment,"

*[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science(FOCS)*, San Juan, Puerto Rico, 1991, pp. 163-169.

doi:10.1109/SFCS.1991.185365

CITATIONS