Complexity of propositional nested circumscription and nested abnormality theories

DOI10.1145/1055686.1055688zbMath1367.68276OpenAlexW2033870590WikidataQ59259673 ScholiaQ59259673MaRDI QIDQ5277721

Marco Cadoli, Thomas Eiter, Georg Gottlob

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1055686.1055688

zbMATH Keywords

computational complexityknowledge representationHorn theoriesnonmonotonic reasoningcircumscriptionnested abnormality theories

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Related Items (1)

Reasoning under minimal upper bounds in propositional logic

This page was built for publication: Complexity of propositional nested circumscription and nested abnormality theories