Nonmonotonic reasoning is sometimes simpler!

DOI10.1093/LOGCOM/6.2.295zbMATH Open0849.03019OpenAlexW2054357915MaRDI QIDQ4881301FDOQ4881301

Authors: Grigori Schwarz, Mirosław Truszczyński 

Publication date: 4 November 1996

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/6.2.295

Recommendations

• scientific article; zbMATH DE number 517087
• Proof-complexity results for nonmonotonic reasoning
• Is intractability of nonmonotonic reasoning a real drawback?
• A survey of complexity results for non-monotonic logics

zbMATH Keywords

nonmonotonic reasoningmodal logicnomonotonic logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other nonclassical logic (03B60) Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Proof-complexity results for nonmonotonic reasoning
• Title not available (Why is that?)
• A survey of complexity results for non-monotonic logics
• Well-supported semantics for logic programs with generalized rules
• Towards formalizing non-monotonic reasoning in physics: logical approach based on physical induction and its relation to Kolmogorov complexity
• On the impact of stratification on the complexity of nonmonotonic reasoning

This page was built for publication: Nonmonotonic reasoning is sometimes simpler!

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