A language for modular answer set programming: Application to ACC tournament scheduling

Luis Tari, Chitta Baral, Saadat Anwar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

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 languageEnglish (US)
Title of host publicationCEUR Workshop Proceedings
Pages277-292
Number of pages16
Volume142
StatePublished - 2005
Event3rd 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 2005Jul 29 2005

Other

Other3rd 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
CountryUnited Kingdom
CityBath
Period7/27/057/29/05

Fingerprint

Semantics
Scheduling

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Tari, L., Baral, C., & Anwar, S. (2005). A language for modular answer set programming: Application to ACC tournament scheduling. In CEUR Workshop Proceedings (Vol. 142, pp. 277-292)

A language for modular answer set programming : Application to ACC tournament scheduling. / Tari, Luis; Baral, Chitta; Anwar, Saadat.

CEUR Workshop Proceedings. Vol. 142 2005. p. 277-292.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tari, L, Baral, C & Anwar, S 2005, A language for modular answer set programming: Application to ACC tournament scheduling. in CEUR Workshop Proceedings. vol. 142, pp. 277-292, 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, 7/27/05.
Tari L, Baral C, Anwar S. A language for modular answer set programming: Application to ACC tournament scheduling. In CEUR Workshop Proceedings. Vol. 142. 2005. p. 277-292
Tari, Luis ; Baral, Chitta ; Anwar, Saadat. / A language for modular answer set programming : Application to ACC tournament scheduling. CEUR Workshop Proceedings. Vol. 142 2005. pp. 277-292
@inproceedings{7491ef05bdbc4f7cbe8920301e2a4247,
title = "A language for modular answer set programming: Application to ACC tournament scheduling",
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.",
author = "Luis Tari and Chitta Baral and Saadat Anwar",
year = "2005",
language = "English (US)",
volume = "142",
pages = "277--292",
booktitle = "CEUR Workshop Proceedings",

}

TY - GEN

T1 - A language for modular answer set programming

T2 - Application to ACC tournament scheduling

AU - Tari, Luis

AU - Baral, Chitta

AU - Anwar, Saadat

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=80054031331&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80054031331&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:80054031331

VL - 142

SP - 277

EP - 292

BT - CEUR Workshop Proceedings

ER -