Abstract
In this paper, we aim at proposing a new approach for defining tractable classes for Exactly-One-SAT problem (in short EO-SAT). EO-SAT is the problem of deciding whether a given CNF formula has a model so that each clause has exactly one true literal. Our first tractable class is defined by using a simple property that has to be satisfied by every three clauses sharing at least one literal. In a similar way, our second tractable class is obtained from a property that has to be satisfied by particular sequences of clauses. The proposed tractable classes can, in a sense, be seen as natural counterparts of tractable classes of the maximum independent set problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
