Characterizability in Horn Belief Revision
| Autor: | György Turán, Jon Yaggie |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Class (set theory)
Closed set French horn 06 humanities and the arts 02 engineering and technology Belief revision 0603 philosophy ethics and religion Combinatorics Operator (computer programming) If and only if Scheme (mathematics) 060302 philosophy 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Mathematics |
| Zdroj: | Logics in Artificial Intelligence ISBN: 9783319487571 JELIA |
| DOI: | 10.1007/978-3-319-48758-8_32 |
| Popis: | Delgrande and Peppas characterized Horn belief revision operators obtained from Horn compliant faithful rankings by minimization, showing that a Horn belief revision operator belongs to this class if and only if it satisfies the Horn AGM postulates and the acyclicity postulate scheme. The acyclicity scheme has a postulate for every \(n\ge 3\) expressing the non-existence of a certain cyclic substructure. We show that this class of Horn belief revision operators cannot be characterized by finitely many postulates. Thus the use of infinitely many postulates in the result of Delgrande and Peppas is unavoidable. The proof uses our finite model theoretic approach to characterizability, considering universal monadic second-order logic with quantifiers over closed sets, and using predicates expressing minimality. We also give another non-characterizability result and add some remarks on strict Horn compliance. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|