scientific article; zbMATH DE number 1962835
From MaRDI portal
Publication:4418672
zbMath1035.68115MaRDI QIDQ4418672
Publication date: 11 August 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2607/26070451.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logic in artificial intelligence (68T27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
What makes propositional abduction tractable ⋮ The complexity of circumscriptive inference in Post's lattice ⋮ Trichotomies in the complexity of minimal inference ⋮ Monadic second-order model-checking on decomposable matroids