On \(k\)-positive satisfiability problem
From MaRDI portal
Publication:1964360
DOI10.1007/BF02948732zbMath1084.68889OpenAlexW2038049006MaRDI QIDQ1964360
Publication date: 1999
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02948732
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Number of models and satisfiability of sets of clauses
- Solving satisfiability in less than \(2^ n\) steps
- A hierarchy of tractable satisfiability problems
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A linear algorithm for renaming a set of clauses as a Horn set
- Unit Refutations and Horn Sets
- On the Complexity of Timetable and Multicommodity Flow Problems
- The complexity of theorem-proving procedures
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On \(k\)-positive satisfiability problem
