Abstract
This paper presents mathematical results that can sometimes be used to simplify the task of reasoning about a default theory, by 'splitting it into parts.' These so-called Splitting Theorems for default logic are related in spirit to 'partial evaluation' in logic programming, in which results obtained from one part of a program are used to simplify the remainder of the program. In this paper we focus primarily on the statement and proof of the Splitting Theorems for default logic. We illustrate the usefulness of the results by applying them to an example default theory for commonsense reasoning about action.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of the National Conference on Artificial Intelligence |
| Editors | Anon |
| Publisher | AAAI |
| Pages | 645-651 |
| Number of pages | 7 |
| Volume | 1 |
| State | Published - Dec 1 1996 |
| Event | Proceedings of the 1996 13th National Conference on Artificial Intelligence, AAAI 96. Part 1 (of 2) - Portland, OR, USA Duration: Aug 4 1996 → Aug 8 1996 |
Other
| Other | Proceedings of the 1996 13th National Conference on Artificial Intelligence, AAAI 96. Part 1 (of 2) |
|---|---|
| City | Portland, OR, USA |
| Period | 8/4/96 → 8/8/96 |