Pages that link to "Item:Q408543"
From MaRDI portal
The following pages link to Lower complexity bounds in justification logic (Q408543):
Displaying 5 items.
- A complexity question in justification logic (Q2453576) (← links)
- Efficient Approximation of Well-Founded Justification and Well-Founded Domination (Q2851261) (← links)
- On the Complexity of Two-Agent Justification Logic (Q2921954) (← links)
- NEXP-Completeness and Universal Hardness Results for Justification Logic (Q3194706) (← links)
- Decidability for some justification logics with negative introspection (Q5300069) (← links)