scientific article; zbMATH DE number 1748576

zbMATH Open0997.03033MaRDI QIDQ4530461FDOQ4530461

Authors: Uwe Egly, Hans Tompits 

Publication date: 13 November 2002

Title of this publication is not available (Why is that?)

Recommendations

• Proof-complexity results for nonmonotonic reasoning
• scientific article; zbMATH DE number 1189101
• Nonmonotonic reasoning is sometimes simpler!
• Is intractability of nonmonotonic reasoning a real drawback?
• Sequent calculi for propositional nonmonotonic logics

zbMATH Keywords

nonmonotonic reasoningcircumscriptionnonmonotonic logicdefault logiccut-free sequent calculiminimal proof length

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic in artificial intelligence (68T27) Complexity of proofs (03F20)

Cited In (2)

• Title not available (Why is that?)
• Proof-complexity results for nonmonotonic reasoning

This page was built for publication:

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