The complexity of reasoning for fragments of default logic

DOI10.1093/logcom/exq061zbMath1267.68222arXiv0808.3884OpenAlexW1997929764WikidataQ61835459 ScholiaQ61835459MaRDI QIDQ2893324

No author found.

Publication date: 20 June 2012

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0808.3884

zbMATH Keywords

computational complexitydefault logicnonmonotonic reasoningPost's lattice

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Logic in computer science (03B70)

Related Items (6)

Sequent-type rejection systems for finite-valued non-deterministic logics ⋮ Unnamed Item ⋮ Restricted default theories: expressive power and outlier detection tasks ⋮ On the parameterized complexity of non-monotonic logics ⋮ On the complexity of the clone membership problem ⋮ Strong Backdoors for Default Logic

This page was built for publication: The complexity of reasoning for fragments of default logic