Conditional syntax splitting for non-monotonic inference operators
Abstract Syntax splitting is a property of inductive inference operators that ensures we can
restrict our attention to parts of the conditional belief base that share atoms with a given …
restrict our attention to parts of the conditional belief base that share atoms with a given …
An overview of KLM-style defeasible entailment
A Kaliski - 2020 - open.uct.ac.za
The usage of formal logic to solve problems in artificial intelligence has a long history in the
field. Information is represented in a formal language, which facilitates algorithmic reasoning …
field. Information is represented in a formal language, which facilitates algorithmic reasoning …
A reconstruction of multipreference closure
L Giordano, V Gliozzi - Artificial Intelligence, 2021 - Elsevier
The paper describes a preferential approach for dealing with exceptions in KLM preferential
logics, based on the rational closure. It is well known that rational closure does not allow an …
logics, based on the rational closure. It is well known that rational closure does not allow an …
[PDF][PDF] Lexicographic Entailment, Syntax Splitting and the Drowning Problem.
Lexicographic inference is a well-known and popular approach to reasoning with non-
monotonic conditionals. It is a logic of very high-quality, as it extends rational closure and …
monotonic conditionals. It is a logic of very high-quality, as it extends rational closure and …
Approximations of system W between c-inference, system Z, and lexicographic inference
J Haldimann, C Beierle - … on Symbolic and Quantitative Approaches with …, 2023 - Springer
Inductive inference operators have been introduced to formalize the process of completing a
conditional belief base to a full inference relation. In this paper, we investigate the …
conditional belief base to a full inference relation. In this paper, we investigate the …
[HTML][HTML] Approximations of system W for inference from strongly and weakly consistent belief bases
J Haldimann, C Beierle - International Journal of Approximate Reasoning, 2024 - Elsevier
In this article, we investigate approximations of the inductive inference operator system W
that has been shown to exhibit desirable inference properties and to extend both system Z …
that has been shown to exhibit desirable inference properties and to extend both system Z …
Conditionals, infeasible worlds, and reasoning with system W
J Haldimann, C Beierle, G Kern-Isberner… - The International …, 2023 - journals.flvc.org
The recently introduced notion of an inductive inference operator captures the process of
completing a given conditional belief base to an inference relation. System W is such an …
completing a given conditional belief base to an inference relation. System W is such an …
Contextual conditional reasoning
We extend the expressivity of classical conditional reasoning by introducing context as a
new parameter. The enriched conditional logic generalises the defeasible setting in the style …
new parameter. The enriched conditional logic generalises the defeasible setting in the style …
Syntax splitting and reasoning from weakly consistent conditional belief bases with c-inference
J Haldimann, C Beierle, G Kern-Isberner - International Symposium on …, 2024 - Springer
It has been shown that c-inference is an inductive inference operator, mapping belief bases
to inference relations, that exhibits many desirable properties put forward for nonmonotonic …
to inference relations, that exhibits many desirable properties put forward for nonmonotonic …
[PDF][PDF] Extending c-Representations and c-Inference for Reasoning with Infeasible Worlds.
JP Haldimann, C Beierle, G Kern-Isberner - NMR, 2023 - ceur-ws.org
Inductive inference operators capture the process of completing a conditional belief base to
an inference relation. One such operator is c-inference which is based on the c …
an inference relation. One such operator is c-inference which is based on the c …