Abstract
We consider the problem of how a default rule can be deduced from a default theory. For this purpose, we propose an axiom system which precisely captures the deductive reasoning about default rules. We show that our axiomatic system is sound and complete under the semantics of the logic of here-and-there. We also study other important properties such as substitution and monotonicity of our system and prove the essential decision problem complexity. Finally, we discuss applications of our default rule calculus to various problems.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 11th European Conference on Logics in Artificial Intelligence, held in Dresden, Germany, 28 September-1 October, 2008 |
| Publisher | Springer Verlag |
| Number of pages | 13 |
| ISBN (Print) | 9783540878025 |
| Publication status | Published - 2008 |
| Event | Logics in Artificial Intelligence, European Conference - Duration: 1 Jan 2008 → … |
Conference
| Conference | Logics in Artificial Intelligence, European Conference |
|---|---|
| Period | 1/01/08 → … |
Keywords
- logic programming
- intelligent agents (computer software)
- default reasoning
- artificial intelligence
- decision making