Answer Set Programming for Declarative Content Specification: A Scalable Partitioning-Based Approach

4Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Procedural Content Generation is applied in the development process of many commercial games: automatically generated game contents are delivered to players in order to offer a constantly changing user experience and enrich the game itself. Usually, the generative process relies on search-based non-deterministic algorithms, which encode one or more techniques for guaranteeing “legal” yet diversified output. Declarative approaches to content generation, more properly defined as Declarative Content Specification techniques, like the ones based on Answer Set Programming, allow to focus on describing content requirements rather than programming ad-hoc generation engines, and to fast prototype generation techniques themselves. This work investigates to what extent ASP-based DCS is scalable enough for industrial contexts, by proposing a partitioning-based approach. A working prototype, available as an Unity Asset and as a GVGAI framework level generator is presented.

Cite

CITATION STYLE

APA

Calimeri, F., Germano, S., Ianni, G., Pacenza, F., Pezzimenti, A., & Tucci, A. (2018). Answer Set Programming for Declarative Content Specification: A Scalable Partitioning-Based Approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11298 LNAI, pp. 225–237). Springer Verlag. https://doi.org/10.1007/978-3-030-03840-3_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free