Pages that link to "Item:Q1589638"
From MaRDI portal
The following pages link to Default reasoning from conditional knowledge bases: Complexity and tractable cases (Q1589638):
Displaying 16 items.
- Updating action domain descriptions (Q622109) (← links)
- Defeasible inheritance with doubt index and its axiomatic characterization (Q622128) (← links)
- Compiling propositional weighted bases (Q814606) (← links)
- Combining probabilistic logic programming with the power of maximum entropy (Q814608) (← links)
- Probabilistic logic under coherence: complexity and algorithms (Q819942) (← links)
- Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation (Q881802) (← links)
- Belief functions and default reasoning (Q1583512) (← links)
- Automated non-monotonic reasoning in System \textbf{P} (Q2043430) (← links)
- Default consequence relations from topology and measure theory (Q2122773) (← links)
- Expressive probabilistic description logics (Q2389639) (← links)
- In all but finitely many possible worlds: model-theoretic investigations on `\textit{overwhelming majority}' default conditionals (Q2398203) (← links)
- A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison (Q2404077) (← links)
- Weak nonmonotonic probabilistic logics (Q2457653) (← links)
- New tractable classes for default reasoning from conditional knowledge bases (Q2502153) (← links)
- Stability, vertex stability, and unfrozenness for special graph classes (Q6151148) (← links)
- Defeasible RDFS via rational closure (Q6490339) (← links)
