A computationally grounded logic of graded belief

DOI10.1007/978-3-030-75775-5_17OpenAlexW3160078329MaRDI QIDQ2055797

Emiliano Lorini, François Schwarzentruber

Publication date: 1 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-75775-5_17

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites Work

• Some syntactic approaches to the handling of inconsistent knowledge bases: A comparative study. I: The flat case
• Prolegomena to dynamic logic for belief revision
• From knowledge-based programs to graded belief-based programs. I: On-line reasoning
• On the logic of common belief and common knowledge
• Probabilistic dynamic epistemic logic
• A practical approach to revising prioritized knowledge bases
• Explanations, belief revision and defeasible reasoning.
• Abduction as belief revision
• Rethinking epistemic logic with belief bases
• Epistemic planning for single- and multi-agent systems
• Epistemology Without Knowledge and Without Belief
• Theory contraction and base contraction unified
• A Poor Man’s Epistemic Logic Based on Propositional Assignment and Higher-Order Observation
• A logic of authentication
• Reasoning about knowledge and probability
• Symbolic model checking for Dynamic Epistemic Logic — S5 and beyond*
• A temporal epistemic logic with a non-rigid set of agents for analyzing the blockchain protocol
• Symbolic model checking of public announcement protocols
• Trust Management
• Intelligent Agents and Multi-Agent Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A computationally grounded logic of graded belief