xpanda: a (simple) preprocessor for adding multi-valued propositions to ASP

  • We introduce a simple approach extending the input language of Answer Set Programming (ASP) systems by multi-valued propositions. Our approach is implemented as a (prototypical) preprocessor translating logic programs with multi-valued propositions into logic programs with Boolean propositions only. Our translation is modular and heavily benefits from the expressive input language of ASP. The resulting approach, along with its implementation, allows for solving interesting constraint satisfaction problems in ASP, showing a good performance.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics
Metadaten
Author:Martin Gebser, Henrik Hinrichs, Torsten Schaub, Sven Thiele
URN:urn:nbn:de:kobv:517-opus-41466
Document Type:Conference Proceeding
Language:English
Year of Completion:2010
Publishing Institution:Universität Potsdam
Contributing Corporation:Gesellschaft für Logische Programmierung e.V.
Release Date:2010/03/04
Source:Proceedings of the 23rd Workshop on (Constraint) Logic Programming 2009 / Geske, Ulrich; Wolf, Armin (Hrsg.). - Potsdam : Universitätsverlag, 2010. - S. 51 - 58
RVK - Regensburg Classification:ST 304
Organizational units:Mathematisch-Naturwissenschaftliche Fakultät / Institut für Informatik und Computational Science
Extern / Extern
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Collections:Universität Potsdam / Tagungsbände/Proceedings (nicht forlaufend) / Proceedings of the 23rd Workshop on (Constraint) Logic Programming 2009 / Answer Set Programming
Licence (German):License LogoKeine Nutzungslizenz vergeben - es gilt das deutsche Urheberrecht