Skeptical inference based on C-representations and its characterization as a constraint satisfaction problem
From MaRDI portal
Publication:2807072
Recommendations
- Properties of skeptical c-inference for conditional knowledge bases and its realization as a constraint satisfaction problem
- Skeptical, weakly skeptical, and credulous inference based on preferred ranking functions
- Properties and interrelationships of skeptical, weakly skeptical, and credulous inference induced by classes of minimal models
- Compilation of conditional knowledge bases for computing c-inference relations
- Comparison of inference relations defined over different sets of ranking functions
Cited in
(17)- Properties and interrelationships of skeptical, weakly skeptical, and credulous inference induced by classes of minimal models
- An implementation of nonmonotonic reasoning with system W
- Skeptical query-answering in Constrained Default Logic
- Skeptical, weakly skeptical, and credulous inference based on preferred ranking functions
- Ranking kinematics for revising by contextual information
- Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations
- Properties of skeptical c-inference for conditional knowledge bases and its realization as a constraint satisfaction problem
- What kind of independence do we need for multiple iterated belief change?
- System \(\text{Z}^{\text{FO}}\): default reasoning with system Z-like ranking functions for unary first-order conditional knowledge bases
- Nonmonotonic reasoning from conditional knowledge bases with system W
- Core c-representations and c-core closure for conditional belief bases
- Scaling up nonmonotonic c-inference via partial MaxSAT problems
- Syntax splitting and reasoning from weakly consistent conditional belief bases with c-inference
- Compilation of conditional knowledge bases for computing c-inference relations
- Comparison of inference relations defined over different sets of ranking functions
- Approximations of system W between c-inference, system Z, and lexicographic inference
- Representing nonmonotonic inference based on c-representations as an SMT problem
This page was built for publication: Skeptical inference based on C-representations and its characterization as a constraint satisfaction problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807072)