Propositional lower bounds: Algorithms and complexity

DOI10.1023/A:1018971231561MaRDI QIDQ1978032zbMATH OpenOpenAlexFDO

Authors Marco Cadoli, Luigi Palopoli, Francesco Scarcello

Publication date 7 June 2000

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1018971231561

zbMATH Keywords

propositional greatest lower bounds

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30)

Recommendations

• Semantical and computational aspects of Horn approximations
• SAT-Based Horn Least Upper Bounds
• First order LUB approximations: characterization and algorithms
• scientific article; zbMATH DE number 2086980
• Knowledge compilation and theory approximation

Cited in

(6)

• Fixed-parameter complexity in AI and nonmonotonic reasoning
• Polynomial algorithm of limited propositional deduction
• Lower bounds and recursive methods for the problem of adjudicating conflicting claims
• First order LUB approximations: characterization and algorithms
• scientific article; zbMATH DE number 7471587 (Why is no real title available?)
• Iterated lower bound formulas: a diagonalization-based approach to proof complexity

This page was built for publication: Propositional lower bounds: Algorithms and complexity

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