Abstract
A computational model of persistent beliefs is developed supporting both the temporal information and the nested belief model. The model has explicit lower and upper time-bounds when representing facts and beliefs. This allows nonambiguous interpretation of persistent beliefs. It has a consistency-checking algorithm between two beliefs. The model can incorporate a new set of beliefs into its old beliefs by using its belief-revision algorithm.
| Original language | English |
|---|---|
| Number of pages | 1 |
| Publication status | Published - 1996 Dec 1 |
| Event | Proceedings of the 1996 13th National Conference on Artificial Intelligence. Part 2 (of 2) - Portland, OR, USA Duration: 1996 Aug 4 → 1996 Aug 8 |
Conference
| Conference | Proceedings of the 1996 13th National Conference on Artificial Intelligence. Part 2 (of 2) |
|---|---|
| City | Portland, OR, USA |
| Period | 96/8/4 → 96/8/8 |
All Science Journal Classification (ASJC) codes
- Software
- Artificial Intelligence
Cite this
Park, S. (1996). Computational model of persistent beliefs. Paper presented at Proceedings of the 1996 13th National Conference on Artificial Intelligence. Part 2 (of 2), Portland, OR, USA, .