Abstract
In this paper we develop a declarative language for modular answer set programming (ASP). Our language allows to declaratively state how one ASP module can import processed answer sets from another ASP module. We define the syntax and semantics of our language and illustrate its applicability by modeling the ACC tournament scheduling problem. Besides the elegance of developing declarative programs in a modular manner, our illustration shows that a problem that is not timely solvable when done in a monolithic way, but becomes solvable when done in a modular way.
| Original language | English (US) |
|---|---|
| Title of host publication | CEUR Workshop Proceedings |
| Pages | 277-292 |
| Number of pages | 16 |
| Volume | 142 |
| State | Published - 2005 |
| Event | 3rd International Workshop on Answer Set Programming: Advances in Theory and Implementation, ASP 2005, Co-located Event with the 19th International Joint Conference on Artificial Intelligence, IJCAI 2005 - Bath, United Kingdom Duration: Jul 27 2005 → Jul 29 2005 |
Other
| Other | 3rd International Workshop on Answer Set Programming: Advances in Theory and Implementation, ASP 2005, Co-located Event with the 19th International Joint Conference on Artificial Intelligence, IJCAI 2005 |
|---|---|
| Country/Territory | United Kingdom |
| City | Bath |
| Period | 7/27/05 → 7/29/05 |
ASJC Scopus subject areas
- General Computer Science