Hierarchies of polynomially solvable satisfiability problems
type: Item
instance of: scholarly article
title: Hierarchies of polynomially solvable satisfiability problems
zbMATH Open document ID: 0891.68108
DOI: 10.1007/BF02127974
author: D. Pretolani
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1998-07-19T00:00:00Z
Mathematics Subject Classification ID: 68T30
zbMATH DE Number: 1123700
zbMATH Keywords: propositional satisfiability problem
MaRDI profile type: Publication
cites work: On-line algorithms for polynomially solvable satisfiability problems
cites work: Polynomial-time inference of all valid implications for Horn and related formulae
cites work: On generalized Horn formulas and \(k\)-resolution
cites work: On renamable Horn and generalized Horn functions
cites work: Extended Horn sets in propositional logic
cites work: A hierarchy of tractable satisfiability problems
cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae
cites work: Recognizing renamable generalized propositional Horn formulas is NP- complete
cites work: Polynomially solvable satisfiability problems
cites work: Q4139711
cites work: The satisfiabilty problem for a class consisting of horn sentences and some non-horn sentences in proportional logic
description: scientific article; zbMATH DE number 1123700