Journal ArticleOPEN ACCESS

A short note on some tractable cases of the satisfiability problem

Information and Computation (2000) 158(2) 125-130
DOI: 10.1006/inco.2000.2867
22Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

It is shown that the tractable class of CNF formulas solvable by linear autarkies properly contains the class of q-Horn formulas and that it is incomparable with SLUR. © 2000 Academic Press.

Author supplied keywords

Cite

CITATION STYLE

APA

Van Maaren, H. (2000). A short note on some tractable cases of the satisfiability problem. Information and Computation, 158(2), 125–130. https://doi.org/10.1006/inco.2000.2867

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free