Pages that link to "Item:Q1193476"
From MaRDI portal
The following pages link to A guide to completeness and complexity for modal logics of knowledge and belief (Q1193476):
Displaying 50 items.
- Parameterized modal satisfiability (Q1759682) (← links)
- Interactions between knowledge, action and commitment within agent dynamic logic (Q1770620) (← links)
- The complexity of satisfiability in non-iterated and iterated probabilistic logics (Q1783740) (← links)
- Epistemic considerations of decision making in games (Q1806301) (← links)
- A modal logic of intentional communication (Q1806304) (← links)
- Group knowledge is not always distributed (neither is it always implicit) (Q1806307) (← links)
- Strong completeness theorems for weak logics of common belief (Q1810818) (← links)
- The price of universality (Q1815426) (← links)
- Combining deduction and model checking into tableaux and algorithms for converse-PDL. (Q1854371) (← links)
- Building decision procedures for modal logics from propositional decision procedures: The case study of modal \(K(m)\). (Q1854375) (← links)
- Naming and identity in epistemic logic. II: A first-order logic for naming (Q1855214) (← links)
- The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic (Q1855229) (← links)
- Characterizing the common prior assumption. (Q1867530) (← links)
- Propositional belief base merging or how to merge beliefs/goals coming from several sources and some links with social choice theory (Q1885766) (← links)
- Common knowledge: Relating anti-founded situation semantics to modal logic neighbourhood semantics (Q1895975) (← links)
- On the decidability and complexity of reasoning about only knowing (Q1978243) (← links)
- The complexity of identifying characteristic formulae (Q1987735) (← links)
- The dynamics of epistemic attitudes in resource-bounded agents (Q2001362) (← links)
- Efficient local reductions to basic modal logic (Q2055845) (← links)
- Local is best: efficient reductions to modal logic \textsf{K} (Q2102930) (← links)
- Local reductions for the modal cube (Q2104538) (← links)
- A note on constructive interpolation for the multi-modal logic \(K_m\) (Q2133432) (← links)
- Integration of weighted knowledge bases (Q2171263) (← links)
- Limited reasoning in first-order knowledge bases with full introspection (Q2171268) (← links)
- Formalizing common belief with no underlying assumption on individual beliefs (Q2173395) (← links)
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic (Q2208242) (← links)
- A four-valued dynamic epistemic logic (Q2228448) (← links)
- Logics of imprecise comparative probability (Q2237162) (← links)
- Epistemic GDL: a logic for representing and reasoning about imperfect information games (Q2238622) (← links)
- A lightweight epistemic logic and its application to planning (Q2238679) (← links)
- A logic for reasoning about knowledge of unawareness (Q2258809) (← links)
- \(\mathrm{K}_{\mathrm S}\mathrm{P}\) a resolution-based theorem prover for \({\mathsf{K}}_n\): architecture, refinements, strategies and experiments (Q2303247) (← links)
- Rethinking epistemic logic with belief bases (Q2307332) (← links)
- Forgetting in multi-agent modal logics (Q2321251) (← links)
- Asynchronous knowledge with hidden actions in the situation calculus (Q2344356) (← links)
- A modal logic of epistemic games (Q2344955) (← links)
- Sequent calculi for branching time temporal logics of knowledge and beliefwith awareness: completeness and decidability (Q2376368) (← links)
- A new combination procedure for the word problem that generalizes fusion decidability results in modal logics (Q2432763) (← links)
- Knowledge updates: Semantics and complexity issues (Q2457677) (← links)
- Logics of public communications (Q2460188) (← links)
- Distributed knowability and Fitch's paradox (Q2464652) (← links)
- Cut-free common knowledge (Q2475436) (← links)
- Description logics with contraries, contradictories, and subcontraries (Q2478592) (← links)
- Game logic and its applications. I (Q2563453) (← links)
- The undecidability of iterated modal relativization (Q2574887) (← links)
- Intention is choice with commitment (Q2640592) (← links)
- Multi-modal nonmonotonic logics of minimal knowledge (Q2642626) (← links)
- Mechanizing common knowledge logic using COQ (Q2643149) (← links)
- ALX, an action logic for agents with bounded rationality (Q2674198) (← links)
- A semantics for reasoning consistently in the presence of inconsistency (Q2676565) (← links)