Integrating answer set programming and constraint logic programming

Veena S. Mellarkod, Michael Gelfond, Yuanlin Zhang

Research output: Contribution to conferencePaper

5 Scopus citations

Abstract

We introduce a knowledge representation language AC(C) extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm, AC solver, for computing answer sets of AC(C) programs. The algorithm does not require full grounding of a program and combines "classical" ASP solving methods with constraint logic programming techniques and CR-Prolog based abduction. The AC(C) based approach often allows to solve problems which are impossible to solve by more traditional ASP solving techniques. We belief that further investigation of the language and development of more efficient and reliable solvers for its programs can help to substantially expand the domain of applicability of the answer set programming paradigm.

Original languageEnglish
Pages11P
StatePublished - 2008
Event10th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2008 - Fort Lauderdale, FL, United States
Duration: Jan 2 2008Jan 4 2008

Conference

Conference10th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2008
CountryUnited States
CityFort Lauderdale, FL
Period01/2/0801/4/08

Fingerprint Dive into the research topics of 'Integrating answer set programming and constraint logic programming'. Together they form a unique fingerprint.

  • Cite this

    Mellarkod, V. S., Gelfond, M., & Zhang, Y. (2008). Integrating answer set programming and constraint logic programming. 11P. Paper presented at 10th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2008, Fort Lauderdale, FL, United States.