Computer Science Logic
From MaRDI portal
Publication:5292637
DOI10.1007/b13224zbMath1116.68591MaRDI QIDQ5292637
Publication date: 21 June 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13224
propositional logic; Horn theories; NP-hardness; abduction; Computational logic; polynomial total time computation
68Q25: Analysis of algorithms and problem complexity
68T27: Logic in artificial intelligence
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic, On the Boolean connectivity problem for Horn relations, On the complexity of second-best abductive explanations, Counting complexity of propositional abduction, Counting Complexity of Minimal Cardinality and Minimal Weight Abduction