Fixed-parameter algorithms for closed world reasoning
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1453052
- Fixed-parameter complexity in AI and nonmonotonic reasoning
- The complexity of propositional closed world reasoning and circumscription
- Knowledge compilation for closed world reasoning and circumscription
- On compact representations of propositional circumscription
Cited in
(3)
This page was built for publication: Fixed-parameter algorithms for closed world reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457256)