scientific article; zbMATH DE number 1301756

zbMATH Open0928.03027MaRDI QIDQ4246971FDOQ4246971

Tomi Janhunen

Publication date: 16 June 1999

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

Recommendations

• Translating default logic into standard autoepistemic logic
• Uniform semantic treatment of default and autoepistemic logics
• Logic program semantics and circumscription of autoepistemic theories
• On the relation between default and autoepistemic logic
• On the parameterized complexity of default logic and autoepistemic logic
• Sequent calculi for default and autoepistemic logics
• Paraconsistent logics and translations
• Autoepistemic logics as a unifying framework for the semantics of logic programs
• scientific article; zbMATH DE number 408811
• Autoepistemic circumscription and logic programming

zbMATH Keywords

computational complexitymodularitydefault logicautoepistemic logicfaithfulnessnonmonotonic logicsrelative expressive powerpriority logic

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic in artificial intelligence (68T27)

Cited In (5)

• General default logic
• Propositional default logics made easier: computational complexity of model checking.
• Prioritized logic programming and its application to commonsense reasoning
• Default reasoning from conditional knowledge bases: Complexity and tractable cases
• Evaluating the effect of semi-normality on the expressiveness of defaults

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 Q4246971)