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 条
  • [21] Partitioning-based decoupling capacitor budgeting via sequence of linear programming
    Fan, Jeffrey
    Tan, Sheldon X. -D.
    Cai, Yici
    Hong, Xianlong
    INTEGRATION-THE VLSI JOURNAL, 2007, 40 (04) : 516 - 524
  • [22] Scalable Reduction Collectives with Data Partitioning-based Multi-Leader Design
    Bayatpour, Mohammadreza
    Chakraborty, Sourav
    Subramoni, Hari
    Lu, Xiaoyi
    Panda, Dhabaleswar K.
    SC'17: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE FOR HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE AND ANALYSIS, 2017,
  • [23] PSOM2—partitioning-based scalable ontology matching using MapReduce
    B Sathiya
    T V Geetha
    K Saruladha
    Sādhanā, 2017, 42 : 2009 - 2024
  • [24] Foundations and Extensions of Answer Set Programming: The Logical Approach
    Pearce, David
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING, 2011, 6645 : 10 - 11
  • [25] Answer Set Programming Based on Propositional Satisfiability
    Enrico Giunchiglia
    Yuliya Lierler
    Marco Maratea
    Journal of Automated Reasoning, 2006, 36
  • [26] A Formal Approach for Cautious Reasoning in Answer Set Programming
    Amendola, Giovanni
    Dodaro, Carmine
    Maratea, Marco
    PROCEEDINGS OF THE TWENTY-NINTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, : 4716 - 4720
  • [27] Answer set programming based on propositional satisfiability
    Giunchiglia, Enrico
    Lierler, Yuliya
    Maratea, Marco
    Journal of Automated Reasoning, 2006, 36 (04): : 345 - 377
  • [28] Answer set programming based on propositional satisfiability
    Giunchiglia, Enrico
    Lierler, Yuliya
    Maratea, Marco
    JOURNAL OF AUTOMATED REASONING, 2006, 36 (04) : 345 - 377
  • [29] SAT-based answer set programming
    Giunchiglia, E
    Lierler, Y
    Maratea, M
    PROCEEDING OF THE NINETEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE SIXTEENTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2004, : 61 - 66
  • [30] A Semantical Approach to Abstraction in Answer Set Programming and Assumption-Based Argumentation
    Apostolakis, Iosif
    Saribatur, Zeynep G.
    Wallner, Johannes P.
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING, LPNMR 2024, 2025, 15245 : 228 - 234