The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on 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
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.
2SAT, satisfying truth assignment selection, complexity, natural generalizations, satisfiability, selection criteria, default preference, minimality, circumscription, polynomial-time randomized algorithm
C.H. Papadimitriou, "On selecting a satisfying truth assignment", 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, vol. 00, no. , pp. 163-169, 1991, doi:10.1109/SFCS.1991.185365
100 ms
(Ver 3.3 (11022016))