2017
DOI: 10.1007/978-3-319-61581-3_35
|View full text |Cite
|
Sign up to set email alerts
|

Complexity of Model Checking for Cardinality-Based Belief Revision Operators

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
20
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(20 citation statements)
references
References 12 publications
0
20
0
Order By: Relevance
“…In this paper, we focus on formula-based (syntactic) revision operators already presented within a unified framework in [9]. Each operator, denoted by * , is a function that takes a belief base B and a formula µ representing new information as input and returns a new belief base B * µ.…”
Section: Belief Base Revisionmentioning
confidence: 99%
See 4 more Smart Citations
“…In this paper, we focus on formula-based (syntactic) revision operators already presented within a unified framework in [9]. Each operator, denoted by * , is a function that takes a belief base B and a formula µ representing new information as input and returns a new belief base B * µ.…”
Section: Belief Base Revisionmentioning
confidence: 99%
“…Some of them are based on construction of maximum consistent subbases according to different criteria [3,10,22]. Recently, Creignou and colleagues in [9] focused particularly on two operators, namely RSRG and RSRW, that are respectively similar to Ginsberg's one [17] and Widtio [34], using set cardinality instead of set inclusion as maximality criterion.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations