Extending defeasibility for propositional standpoint logics

DOI10.1007/978-3-032-04590-4_4MaRDI QIDQ6884726zbMATH OpenFDO

Authors Nicholas Leisegang, Thomas Meyer, Ivan Varzinczak

Publication date 15 December 2025

Full work available at URL https://doi.org/10.1007/978-3-032-04590-4_4

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites work

• A guide to completeness and complexity for modal logics of knowledge and belief
• Another perspective on default reasoning
• Defeasible linear temporal logic
• Formalizing action and change in modal logic I: the frame problem
• From KLM-style conditionals to defeasible modalities, and back
• Nonmonotonic reasoning, preferential models and cumulative logics
• Preferential reasoning for modal logics
• Tableau methods for modal and temporal logics
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• What does a conditional knowledge base entail?

This page was built for publication: Extending defeasibility for propositional standpoint logics

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