Skeptical Inference Based on C-Representations and Its Characterization as a Constraint Satisfaction Problem

DOI10.1007/978-3-319-30024-5_4zbMath1475.68377OpenAlexW2406580145MaRDI QIDQ2807072

Christian Eichhorn, Christoph Beierle, Gabriele Kern-Isberner

Publication date: 19 May 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-30024-5_4

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (8)

Ranking kinematics for revising by contextual information ⋮ 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 ⋮ An implementation of nonmonotonic reasoning with system W ⋮ Properties and interrelationships of skeptical, weakly skeptical, and credulous inference induced by classes of minimal models ⋮ 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 ⋮ Nonmonotonic reasoning from conditional knowledge bases with system W

This page was built for publication: Skeptical Inference Based on C-Representations and Its Characterization as a Constraint Satisfaction Problem