Abstract
n this paper, we show that first-order logic programs with monotone aggregates under the stable model semantics can be captured in classical first-order logic. More precisely, we extend the notion of ordered completion for logic programs with a large variety of aggregates so that every stable model of a program with aggregates corresponds to a classical model of its enhanced ordered completion, and vice versa.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 26th AAAI Conference on Artificial Intelligence, July 22–26, 2012, Toronto, Canada |
| Publisher | AAAI Press |
| Pages | 691-697 |
| Number of pages | 7 |
| ISBN (Print) | 9781577355687 |
| Publication status | Published - 2012 |
| Event | AAAI Conference on Artificial Intelligence - Duration: 22 Jul 2012 → … |
Conference
| Conference | AAAI Conference on Artificial Intelligence |
|---|---|
| Period | 22/07/12 → … |
Keywords
- artificial intelligence
- knowledge representation (information theory)
- logic programming
- reasoning