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

Authors:
V. Arvind;S. Biswas
Affiliations:
Indian Institute of Technology Kanpur, Kanpur, India;Indian Institute of Technology Kanpur, Kanpur, India
Venue:
Information Processing Letters
Year:
1987

Citing 0
Cited 3

Extended Horn sets in propositional logic

Journal of the ACM (JACM)
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing

Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing

Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions

Quantified Score

Hi-index	0.89

Visualization

Abstract