Proof-complexity results for nonmonotonic reasoning
From MaRDI portal
Publication:3549127
DOI10.1145/377978.377987zbMath1171.03319OpenAlexW2044169892MaRDI QIDQ3549127
Publication date: 21 December 2008
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/377978.377987
Related Items (5)
Proof complexity of modal resolution ⋮ Sequent-type rejection systems for finite-valued non-deterministic logics ⋮ Proof complexity of propositional default logic ⋮ Unnamed Item ⋮ Proof Complexity of Non-classical Logics
This page was built for publication: Proof-complexity results for nonmonotonic reasoning