Pages that link to "Item:Q1302307"
From MaRDI portal
The following pages link to Succinctness as a source of complexity in logical formalisms (Q1302307):
Displaying 9 items.
- Model-checking hierarchical structures (Q414908) (← links)
- Semantics and complexity of recursive aggregates in answer set programming (Q543600) (← links)
- On the complexity of data disjunctions. (Q1853503) (← links)
- Solving abduction by computing joint explanations. Logic programming formalization, applications to P2P data integration, and complexity results (Q2385448) (← links)
- Complexity results for answer set programming with bounded predicate arities and implications (Q2426101) (← links)
- Privacy Preservation Using Multi-context Systems and Default Logic (Q2900519) (← links)
- Truth definitions in finite models (Q5311718) (← links)
- Complexity of super-coherence problems in ASP (Q5418947) (← links)
- Abstraction for non-ground answer set programs (Q5919127) (← links)