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

被引:3
|
作者
Calimeri, Francesco [1 ]
Germano, Stefano [1 ]
Ianni, Giovambattista [1 ]
Pacenza, Francesco [1 ]
Pezzimenti, Armando [1 ]
Tucci, Andrea [1 ]
机构
[1] Univ Calabria, Dept Math & Comp Sci, Arcavacata Di Rende, Italy
关键词
Answer Set Programming; Procedural content generation; Game content generation; Artificial intelligence in games; Computational intelligence in games; Declarative Content Specification;
D O I
10.1007/978-3-030-03840-3_17
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:225 / 237
页数:13
相关论文
共 50 条
  • [41] Deploying IoT services on the fog infrastructure: A graph partitioning-based approach
    Ghobaei-Arani, Mostafa
    Asadianfam, Shiva
    Abolfathi, Ahad
    SOFTWARE-PRACTICE & EXPERIENCE, 2022, 52 (09): : 1967 - 1986
  • [42] A Scalable Solution to Soft Error Tolerant Circuit Design Using Partitioning-Based Gate Sizing
    Sabet, M. Amin
    Ghavami, Behnam
    Raji, Mohsen
    IEEE TRANSACTIONS ON RELIABILITY, 2017, 66 (01) : 245 - 256
  • [43] Partitioning-based approach to fast on-chip decoupling capacitor budgeting and minimization
    Li, Hang
    Fan, Jeffrey
    Qi, Zhenyu
    Tan, Sheldon X. -D.
    Wu, Lifeng
    Cai, Yici
    Hong, Xianlong
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2006, 25 (11) : 2402 - 2412
  • [44] DYNAMIC PROGRAMMING APPROACH TO THE COMPLETE SET PARTITIONING PROBLEM.
    Yeh, D.Yun
    BIT (Copenhagen), 1986, 26 (04): : 467 - 474
  • [45] A DYNAMIC-PROGRAMMING APPROACH TO THE COMPLETE SET PARTITIONING PROBLEM
    YEH, DY
    BIT, 1986, 26 (04): : 467 - 474
  • [46] Towards value-awareness in administrative processes: an approach based on constraint answer set programming
    Arias, Joaquin
    Moreno-Rebato, Mar
    Rodriguez-Garcia, Jose A.
    Ossowski, Sascha
    39TH ANNUAL ACM SYMPOSIUM ON APPLIED COMPUTING, SAC 2024, 2024, : 770 - 778
  • [47] Extending object-oriented languages by declarative specifications of complex objects using answer-set programming
    Institut für Informationssysteme 184/3, Technische Universität Wien, Favoritenstraße 9-11, Vienna
    A-1040, Austria
    Workshop Log. Program., WLP - Proc., (129-137):
  • [48] An efficient and scalable image codec based on binary set partitioning
    Chen, JH
    Zhang, WJ
    Zhang, ZH
    CHINESE JOURNAL OF ELECTRONICS, 2005, 14 (01): : 122 - 124
  • [49] Resilience-oriented operation of power systems: Hierarchical partitioning-based approach
    Oskouei, Morteza Zare
    Mehrjerdi, Hasan
    Babazadeh, Davood
    Baboli, Payam Teimourzadeh
    Becker, Christian
    Palensky, Peter
    APPLIED ENERGY, 2022, 312
  • [50] Hybrid planning for challenging construction problems: An Answer Set Programming approach
    Ahmad, Faseeh
    Patoglu, Volkan
    Erdem, Esra
    ARTIFICIAL INTELLIGENCE, 2023, 319