The following pages link to (Q4799291):
Displaying 12 items.
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking (Q395003) (← links)
- The complexity of circumscriptive inference in Post's lattice (Q692903) (← links)
- Trichotomies in the complexity of minimal inference (Q692908) (← links)
- On the counting complexity of propositional circumscription (Q963360) (← links)
- The complexity of model checking for circumscriptive formulae (Q1205713) (← links)
- A dichotomy in the complexity of propositional circumscription (Q1764422) (← links)
- Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents (Q2255227) (← links)
- (Q2723419) (← links)
- (Q4443550) (← links)
- (Q4941907) (← links)
- On the computability-theoretic complexity of trivial, strongly minimal models (Q5308141) (← links)
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems (Q5464765) (← links)