Representing nonmonotonic inference based on c-representations as an SMT problem

DOI10.1007/978-3-031-45608-4_17MaRDI QIDQ6587922FDOQ6587922

Authors: Martin von Berg, Arthur Sanin, C. Beierle 

Publication date: 15 August 2024

Recommendations

• Skeptical inference based on C-representations and its characterization as a constraint satisfaction problem
• 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
• Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations

zbMATH Keywords

satisfiability modulo theoriesconditionalconditional knowledge basec-inferencec-representationSMT with linear arithmetic

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cites Work

• Descriptor revision
• The logic of conditionals. An application of probability to deductive logic
• Conditionals in nonmonotonic reasoning and belief revision. Considering conditionals as agents
• A thorough axiomatization of a principle of conditional preservation in belief revision
• Possibilistic and standard probabilistic semantics of conditional knowledge bases
• Qualitative probabilities for default reasoning, belief revision, and causal modeling
• Properties of skeptical c-inference for conditional knowledge bases and its realization as a constraint satisfaction problem
• Skeptical inference based on C-representations and its characterization as a constraint satisfaction problem
• Descriptor Revision for Conditionals: Literal Descriptors and Conditional Preservation
• Compilation of conditional knowledge bases for computing c-inference relations
• Conditional descriptor revision and its modelling by a CSP
• Nonmonotonic reasoning from conditional knowledge bases 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
• A kinematics principle for iterated revision

Cited In (2)

• Scaling up nonmonotonic c-inference via partial MaxSAT problems
• Syntax splitting and reasoning from weakly consistent conditional belief bases with c-inference

This page was built for publication: Representing nonmonotonic inference based on c-representations as an SMT problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587922)