On compact representations of propositional circumscription
From MaRDI portal
Publication:4596622
DOI10.1007/3-540-59042-0_74zbMath1379.68289OpenAlexW1715061674MaRDI QIDQ4596622
Marco Schaerf, Marco Cadoli, Francesco M. Donini
Publication date: 4 December 2017
Published in: STACS 95 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-59042-0_74
Database theory (68P15) Logic in artificial intelligence (68T27) Complexity of computation (including implicit computational complexity) (03D15)
Related Items
On compact representations of propositional circumscription ⋮ Is intractability of nonmonotonic reasoning a real drawback?