Towards answer set programming with sorts

Evgenii Balai, Michael Gelfond, Yuanlin Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

23 Scopus citations


Existing ASP languages lack support for conveniently specifying objects, their sorts and the sorts of the parameters of relations in an application domain. However, such support may allow a programmer to better structure the program, to automatically determine some syntax and semantic errors and to avoid thinking about safety of ASP rules - non-declarative conditions on rules required by existing ASP systems. In this paper, we define the syntax and semantics of a knowledge representation language SPARC which offers explicit constructs to specify objects, relations, and their sorts. The language expands CR-Prolog - an extension of ASP by consistency restoring rules. We introduce an implementation of SPARC based on its translation to DLV with weak constraints. A syntax checking algorithm helps to avoid errors related to misspellings as well as simple type errors. Another type checking algorithm flags program rules which, due to type conflicts, have no ground instantiations.

Original languageEnglish
Title of host publicationLogic Programming and Nonmonotonic Reasoning - 12th International Conference, LPNMR 2013, Proceedings
Number of pages13
StatePublished - 2013
Event12th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2013 - Corunna, Spain
Duration: Sep 15 2013Sep 19 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8148 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference12th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2013


Dive into the research topics of 'Towards answer set programming with sorts'. Together they form a unique fingerprint.

Cite this