2013
DOI: 10.1093/logcom/ext030
|View full text |Cite
|
Sign up to set email alerts
|

Which style of reasoning to choose in the face of conflicting information?

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0
1

Year Published

2013
2013
2022
2022

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 19 publications
0
6
0
1
Order By: Relevance
“…that B is permitted. 34 Since in our lower limit logics CMIO R we have modus ponens for ⇒, we can derive ¬out¬B from in A and in A ⇒ ¬out¬B. Depending on the rules in R we get other properties for conditional permissions.…”
Section: Permissions By Defaultmentioning
confidence: 98%
See 2 more Smart Citations
“…that B is permitted. 34 Since in our lower limit logics CMIO R we have modus ponens for ⇒, we can derive ¬out¬B from in A and in A ⇒ ¬out¬B. Depending on the rules in R we get other properties for conditional permissions.…”
Section: Permissions By Defaultmentioning
confidence: 98%
“…34 To simplify things, in our discussion of conditional permissions we here only consider the option of using the definition of permissions as known from Standard Deontic Logic where P is ¬O¬ (which translates to ¬out¬ in our setting). Another option would be to use a dedicated permission operator pout.…”
Section: Permissions By Defaultmentioning
confidence: 99%
See 1 more Smart Citation
“…In most discussions and applications of the standard format, the two strategies are considered separately, as two different ways to strengthen L, or even as two different "styles of reasoning" [21]. 4 Reliability is syntactically more straightforward, has a more cautious consequence relation, and is computationally less arduous, whereas minimal abnormality is more natural from a semantic viewpoint, yields a stronger consequence relation, and is computationally more complex.…”
Section: Aim Of This Papermentioning
confidence: 99%
“…In [21], a number of ALs are defined which characterize the Rescher-Manor consequence relations from [24] and generalize them to the predicate level. This is done by extending first order predicate logic with a dummy operator •, and translating premises by prefixing them with this operator.…”
Section: Finite S −mentioning
confidence: 99%