Restricted default theories: expressive power and outlier detection tasks
From MaRDI portal
(Redirected from Publication:483301)
Recommendations
Cites work
- scientific article; zbMATH DE number 1237865 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1142309 (Why is no real title available?)
- scientific article; zbMATH DE number 6958 (Why is no real title available?)
- scientific article; zbMATH DE number 803291 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- A logic for default reasoning
- Artificial intelligence. A new synthesis
- Complexity Results for Nonmonotonic Logics
- Computational properties of metaquerying problems
- Hard problems for simple default logics
- Introduction to logic-based artificial intelligence
- Metaqueries: Semantics, complexity, and efficient algorithms
- On the parameterized complexity of default logic and autoepistemic logic
- Outlier detection for simple default theories
- Outlier detection using default reasoning
- Proof complexity of propositional default logic
- Propositional semantics for disjunctive logic programs
- The complexity of reasoning for fragments of default logic
- Yet some more complexity results for default logic
This page was built for publication: Restricted default theories: expressive power and outlier detection tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q483301)