The following pages link to Antonis Achilleos (Q1652981):
Displayed 19 items.
- A framework for parameterized monitorability (Q1652982) (← links)
- The completeness problem for modal logic (Q1709685) (← links)
- Parameterized modal satisfiability (Q1759682) (← links)
- The complexity of identifying characteristic formulae (Q1987735) (← links)
- Axiomatizing recursion-free, regular monitors (Q2141297) (← links)
- Monitoring hyperproperties with circuits (Q2165208) (← links)
- Determinizing monitors for HML with recursion (Q2291832) (← links)
- On the complexity of determinizing monitors (Q2399244) (← links)
- A complexity question in justification logic (Q2453576) (← links)
- On the Complexity of Two-Agent Justification Logic (Q2921954) (← links)
- A Complexity Question in Justification Logic (Q3003343) (← links)
- NEXP-Completeness and Universal Hardness Results for Justification Logic (Q3194706) (← links)
- Parameterized Modal Satisfiability (Q3587453) (← links)
- Modal logics with hard diamond-free fragments (Q5108014) (← links)
- (Q5136296) (← links)
- Modal Logics with Hard Diamond-Free Fragments (Q5283414) (← links)
- On probabilistic monitorability (Q6113983) (← links)
- (Q6191004) (← links)
- Testing equivalence vs. runtime monitoring (Q6199101) (← links)