Propositional lower bounds: Algorithms and complexity

DOI10.1023/A:1018971231561zbMath0940.68136OpenAlexW1605753728MaRDI QIDQ1978032

Luigi Palopoli, Francesco Scarcello, Marco Cadoli

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)

Related Items

First order LUB approximations: characterization and algorithms ⋮ Fixed-parameter complexity in AI and nonmonotonic reasoning