Concepedia

An O(n2) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all horn sentences

V. Arvind, Saikat Biswas

Information Processing Letters · 1987 · 16 citations · 1 references

DOI

Concepts

References

1

The satisfiabilty problem for a class consisting of horn sentences and some non-horn sentences in proportional logic

Susumu Yamasaki, Shuji Doshita · Information and Control · 1983 · 29 citations

, , +13