Publication:4418672
From MaRDI portal
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
68T27: Logic in artificial intelligence
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Monadic second-order model-checking on decomposable matroids, The complexity of circumscriptive inference in Post's lattice, Trichotomies in the complexity of minimal inference, What makes propositional abduction tractable