scientific article; zbMATH DE number 4085614

MaRDI QIDQ3815282zbMATH OpenFDO

Authors Hans Kleine Büning, Marek Karpinski, Peter H. Schmitt

Publication date 1988

zbMATH Keywords

evaluation problem for quantified propositional Horn clauseslogic programmingpolynomial time algorithm

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics
• Algorithms for testing the satisfiability of propositional formulae
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• A note on the complexity of the satisfiability of modal Horn clauses
• Models and quantifier elimination for quantified Horn formulas

Cited in

(27)

• On the complexity of the maximum satisfiability problem for Horn formulas
• A hierarchy of propositional Horn formuls
• The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics
• Polynomial-time inference of all valid implications for Horn and related formulae
• Resolution for quantified Boolean formulas
• Complexity of the problem of being equivalent to Horn formulas
• Copy complexity of Horn formulas with respect to unit read-once resolution
• Hardness results for approximate pure Horn CNF formulae minimization
• Resolution on quantified generalized clause-sets
• A simple functional presentation and an inductive correctness proof of the Horn algorithm
• A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability
• Quantified Constraint Satisfaction and the Polynomially Generated Powers Property
• Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits
• scientific article; zbMATH DE number 4023248 (Why is no real title available?)
• scientific article; zbMATH DE number 193539 (Why is no real title available?)
• Disjunctive closures for knowledge compilation
• scientific article; zbMATH DE number 1453038 (Why is no real title available?)
• Quantified Constraints in Twenty Seventeen
• Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic
• Quantified constraint satisfaction and the polynomially generated powers property
• An algorithm to compute maximal contractions for Horn clauses
• On the complexity of propositional calculus formulae
• Theory and Applications of Satisfiability Testing
• Complexity of the problem of being equivalent to Horn formulas. II
• On generalized Horn formulas and k-resolution
• The complexity of the satisfiability problem for Krom formulas
• Models and quantifier elimination for quantified Horn formulas

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3815282)