Recommendations
Cites work
- scientific article; zbMATH DE number 4176507 (Why is no real title available?)
- scientific article; zbMATH DE number 3694633 (Why is no real title available?)
- scientific article; zbMATH DE number 43242 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 194618 (Why is no real title available?)
- scientific article; zbMATH DE number 4114596 (Why is no real title available?)
- A logic for default reasoning
- A skeptical theory of inheritance in nonmonotonic semantic networks
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Model-preference default theories
Cited in
(43)- The Complexity of Reasoning for Fragments of Default Logic
- Reasoning with power defaults
- Default rules in the logic of first-degree entailments
- scientific article; zbMATH DE number 1876863 (Why is no real title available?)
- Querying disjunctive databases through nonmonotonic logics
- Is intractability of nonmonotonic reasoning a real drawback?
- Outlier detection using default reasoning
- Support set selection for abductive and default reasoning
- scientific article; zbMATH DE number 52991 (Why is no real title available?)
- Limited reasoning in first-order knowledge bases
- scientific article; zbMATH DE number 1390355 (Why is no real title available?)
- Modeling simultaneous events with default reasoning and tight derivations
- scientific article; zbMATH DE number 4106303 (Why is no real title available?)
- On the computational cost of disjunctive logic programming: Propositional case
- Propositional semantics for disjunctive logic programs
- A decision method for nonmonotonic reasoning based on autoepistemic reasoning
- Propositional default logics made easier: computational complexity of model checking.
- Efficient query processing with reduced implicate tries
- Tractable reasoning via approximation
- Default reasoning from conditional knowledge bases: Complexity and tractable cases
- Defaults and relevance in model-based reasoning
- The complexity of path-based defeasible inheritance
- Default reasoning by deductive planning
- Complexity of Default Logic on Generalized Conjunctive Queries
- Default theories that always have extensions
- scientific article; zbMATH DE number 4166939 (Why is no real title available?)
- Restricted default theories: expressive power and outlier detection tasks
- scientific article; zbMATH DE number 408811 (Why is no real title available?)
- scientific article; zbMATH DE number 2032416 (Why is no real title available?)
- Resolving ambiguity in nonmonotonic inheritance hierarchies
- Outlier detection for simple default theories
- Proof complexity of propositional default logic
- scientific article; zbMATH DE number 1754690 (Why is no real title available?)
- Semantics and complexity of abduction from default theories
- Default reasoning using classical logic
- Model-preference default theories
- Privacy preservation using multi-context systems and default logic
- Yet some more complexity results for default logic
- The complexity of propositional closed world reasoning and circumscription
- scientific article; zbMATH DE number 4174352 (Why is no real title available?)
- Skeptical reasoning in FC-normal logic programs is \(\Pi_1^1\)-complete
- scientific article; zbMATH DE number 1761409 (Why is no real title available?)
- On the impact of stratification on the complexity of nonmonotonic reasoning
This page was built for publication: Hard problems for simple default logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1182166)
