Abstract
We show that every propositional disjunctive logic program under the answer set semantics can be equivalently transformed into a normal one via unfolding and shifting. More precisely, after iteratively applying the unfolding operator for some rules in a disjunctive program, its shifted program, which is a normal program, must have the same answer sets as the original disjunctive program.
| Original language | English |
|---|---|
| Title of host publication | ECAI 2014: 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic: Including Prestigious Applications of Intelligent Systems (PAIS 2014): Proceedings |
| Publisher | IOS Press |
| Pages | 1139-1140 |
| Number of pages | 2 |
| ISBN (Print) | 9781614994183 |
| Publication status | Published - 2014 |
| Event | European Conference on Artificial Intelligence - Duration: 18 Aug 2014 → … |
Conference
| Conference | European Conference on Artificial Intelligence |
|---|---|
| Period | 18/08/14 → … |
Keywords
- answer set programming
- artificial intelligence
- logic programming