Abstract: Propositional satisfiability problem (SAT) is represented in a conjunctive normal form with multiple clauses, which is an important non-deterministic polynomial-time (NP) complete problem ...
Abstract: In this paper, we put forward a weak conjunctive normal form for G3, which is similar to the conjunctive normal form for classical propositional logic. We also give two algorithms to reduce ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback