The following pages link to (Q3204443):
Displaying 20 items.
- Exploring the tractability border in epistemic tasks (Q484931) (← links)
- Reaching agreements through argumentation: a logical model and implementation (Q1274675) (← links)
- A non-minimal but very weak axiomatization of common belief (Q1342230) (← links)
- Belief closure: A semantics of common knowledge for modal propositional logic (Q1377482) (← links)
- Epistemic properties of knowledge hierarchies (Q1961272) (← links)
- A new epistemic characterization of \(\varepsilon\)-proper rationalizability (Q2013350) (← links)
- Epistemic closure and epistemic logic. I: Relevant alternatives and subjunctivism (Q2018588) (← links)
- Tractable reasoning using logic programs with intensional concepts (Q2055806) (← links)
- NP reasoning in the monotone \(\mu\)-calculus (Q2096471) (← links)
- Complexity of the universal theory of modal algebras (Q2307300) (← links)
- SAT-based explicit LTL reasoning and its application to satisfiability checking (Q2335900) (← links)
- Revisiting Epistemic Specifications (Q3001928) (← links)
- Situated Modeling of Epistemic Puzzles (Q4834294) (← links)
- Sequent Calculi and Interpolation for Non-Normal Modal and Deontic Logics (Q5013620) (← links)
- Orthopartitions and possibility distributions (Q6061527) (← links)
- CoNP complexity for combinations of non-normal modal logics (Q6541159) (← links)
- Resolution calculi for non-normal modal logics (Q6541160) (← links)
- Non-normal Modal description logics (Q6545543) (← links)
- On the finite model property of non-normal modal logics (Q6562546) (← links)
- Coalgebraic satisfiability checking for arithmetic \(\mu\)-calculi (Q6597959) (← links)
