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 条
  • [31] An approach to declarative programming based on a rewriting logic
    González-Moreno, JC
    Hortalá-González, MT
    López-Fraguas, FJ
    Rodríguez-Artalejo, M
    JOURNAL OF LOGIC PROGRAMMING, 1999, 40 (01): : 47 - 87
  • [32] Scalable Enumeration of Trap Spaces in Boolean Networks via Answer Set Programming
    Giang Trinh
    Benhamou, Belaid
    Pastva, Samuel
    Soliman, Sylvain
    THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 9, 2024, : 10714 - 10722
  • [33] A multi-engine approach to answer-set programming
    Maratea, Marco
    Pulina, Luca
    Ricca, Francesco
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2014, 14 : 841 - 868
  • [34] Declarative Question Answering over Knowledge Bases Containing Natural Language Text with Answer Set Programming
    Mitra, Arindam
    Clark, Peter
    Tafjord, Oyvind
    Baral, Chitta
    THIRTY-THIRD AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FIRST INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / NINTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2019, : 3003 - 3010
  • [35] Quartet based phylogeny reconstruction with answer set programming
    Wu, G
    Lin, GH
    You, JH
    ICTAI 2004: 16TH IEEE INTERNATIONALCONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, : 612 - 619
  • [36] Evacuation Planning using Answer Set Programming: An initial approach
    Zepeda, Claudia
    Sol, David
    ENGINEERING LETTERS, 2007, 15 (02)
  • [37] 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
  • [38] D-FLAT: Declarative problem solving using tree decompositions and answer-set programming
    Bliem, Bernhard
    Morak, Michael
    Woltran, Stefan
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2012, 12 : 445 - 464
  • [39] Verifying Software Requirements Based on Answer Set Programming
    Mu, Kedian
    Zhang, Qi
    Jin, Zhi
    KNOWLEDGE SCIENCE, ENGINEERING AND MANAGEMENT, 2009, 5914 : 263 - +
  • [40] Character-based cladistics and answer set programming
    Brooks, DR
    Erdem, E
    Minett, JW
    Ringe, D
    PRACTICAL ASPECTS OF DECLARATIVE LANGUAGES, PROCEEDINGS, 2005, 3350 : 37 - 51