Problems, models and complexity. II: Application to the DLSP
From MaRDI portal
Recommendations
- Problems, models and complexity. I: Theory
- The complexity of circumscription in DLs
- Complexity results on DPLL and resolution
- An extension of the dual complexity space and an application to computer science
- Complexity of DeLP: current status and moving forward
- Complexity of Ehrenfeucht models
- Applications of Kolmogorov complexity to computable model theory
- On the complexity of the dualization problem
- Complexity issues in the Davis and Putnam scheme
- scientific article; zbMATH DE number 1547051
Cited in
(3)
This page was built for publication: Problems, models and complexity. II: Application to the DLSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1405821)