The complexity of propositional closed world reasoning and circumscription

From MaRDI portal
Revision as of 12:53, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1329160

DOI10.1016/S0022-0000(05)80004-2zbMATH Open0806.68096DBLPjournals/jcss/CadoliL94WikidataQ55980557 ScholiaQ55980557MaRDI QIDQ1329160

Author name not available (Why is that?)

Publication date: 13 February 1995

Published in: (Search for Journal in Brave)




zbMATH Keywords

No records found.


Mathematics Subject Classification ID

No records found.








This page was built for publication: The complexity of propositional closed world reasoning and circumscription

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329160)

Retrieved from "https://mardi.schubotz.org/w/index.php?title=Publication:1329160&oldid=13459133"
Powered by MediaWiki