Taksim:程序内容生成的约束图划分框架

2019 IEEE Conference on Games (CoG) Pub Date : 2019-08-01 DOI:10.1109/CIG.2019.8848065

Ahmed M. Abuzuraiq, Aaron Ferguson, Philippe Pasquier

{"title":"Taksim:程序内容生成的约束图划分框架","authors":"Ahmed M. Abuzuraiq, Aaron Ferguson, Philippe Pasquier","doi":"10.1109/CIG.2019.8848065","DOIUrl":null,"url":null,"abstract":"We present Taksim, an Answer Set Programming (ASP) framework for generating content in games through constrained graph partitioning. We illustrate its expressivity by implementing logical constraints that are relevant to generating the spaces of game levels. Furthermore, we present a case study for creating game levels from a given Mission Graph. Finally, we propose key concepts that make constrained graph partitioning, coupled with ASP, an asset for Procedural Content Generation.","PeriodicalId":177208,"journal":{"name":"2019 IEEE Conference on Games (CoG)","volume":"167 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Taksim: A Constrained Graph Partitioning Framework for Procedural Content Generation\",\"authors\":\"Ahmed M. Abuzuraiq, Aaron Ferguson, Philippe Pasquier\",\"doi\":\"10.1109/CIG.2019.8848065\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present Taksim, an Answer Set Programming (ASP) framework for generating content in games through constrained graph partitioning. We illustrate its expressivity by implementing logical constraints that are relevant to generating the spaces of game levels. Furthermore, we present a case study for creating game levels from a given Mission Graph. Finally, we propose key concepts that make constrained graph partitioning, coupled with ASP, an asset for Procedural Content Generation.\",\"PeriodicalId\":177208,\"journal\":{\"name\":\"2019 IEEE Conference on Games (CoG)\",\"volume\":\"167 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE Conference on Games (CoG)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIG.2019.8848065\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Conference on Games (CoG)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIG.2019.8848065","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

我们提出了Taksim，一个通过约束图划分生成游戏内容的答案集编程(ASP)框架。我们通过执行与生成游戏关卡空间相关的逻辑约束来说明其表现力。此外，我们还提供了一个基于给定任务图创造游戏关卡的案例研究。最后，我们提出了约束图划分的关键概念，并结合了程序内容生成的资产ASP。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Taksim: A Constrained Graph Partitioning Framework for Procedural Content Generation

We present Taksim, an Answer Set Programming (ASP) framework for generating content in games through constrained graph partitioning. We illustrate its expressivity by implementing logical constraints that are relevant to generating the spaces of game levels. Furthermore, we present a case study for creating game levels from a given Mission Graph. Finally, we propose key concepts that make constrained graph partitioning, coupled with ASP, an asset for Procedural Content Generation.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2019 IEEE Conference on Games (CoG)

自引率

0.00%

发文量