Reference. Probabilistic Logic Programming Semantics For Procedural Content Generation
Research in procedural content generation (PCG) has recently heralded two major methodologies: machine learning (PCGML) and declarative programming. The former shows promise by automating the specification of quality criteria through latent patterns in data, while the latter offers significant advantages for authorial control. In this paper we propose the use of probabilistic logic as a unifying framework that combines the benefits of both methodologies. We propose a Bayesian formalization of content generators as probability distributions and show how common PCG tasks map naturally to operations on the distribution. Further, through a series of experiments with maze generation, we demonstrate how probabilistic logic semantics allows us to leverage the authorial control of declarative programming and the flexibility of learning from data.
Cite
Cited by (1)
CounterChoice: Counterpoint Composition in Dusa with a Firmus Foundation erdem-2026-counterchoice
Cites 34 works (0 here)
External (34)
- The Joy of Probabilistic Answer Set Programming: Semantics, Complexity, Expressivity, Inference (2020)
- Generating Explorable Narrative Spaces with Answer Set Programming (2020)
- Three Modern Roles for Logic in AI (2020)
- Approximate Arithmetic Circuits: A Survey, Characterization, and Recent Applications (2020)
- Efficient Generation of Structured Objects with Constrained Adversarial Networks (2020)
- Deep Learning for Procedural Content Generation (2020)
- Multi-Domain Level Generation and Blending with Sketches via Example-Driven BSP and Variational Autoencoders (2020)
- Taksim: A Constrained Graph Partitioning Framework for Procedural Content Generation (2019)
- Multi-shot ASP solving with clingo (2019)
- Automatic Generation of Game Content Using a Graph-based Wave Function Collapse Algorithm (2019)
- Design-Centric Maze Generation (2019)
- DeepProbLog: Neural Probabilistic Logic Programming (2018)
- Foundations of Probabilistic Logic Programming: Languages, Semantics, Inference and Learning (2018)
- Graph-Based Generation of Action-Adventure Dungeon Levels Using Answer Set Programming (2018)
- A semantic loss function for deep learning with symbolic knowledge (2018)
- Artificial Intelligence and Games (2018)
- Procedural Content Generation via Machine Learning (PCGML) (2017)
- TP-Compilation for inference in probabilistic logic programs (2016)
- Probabilistic (Logic) Programming Concepts (2015)
- Declarative Data Generation with ProbLog (2015)
- ProbLog2: Probabilistic Logic Programming (2015)
- Sampling hyrule: Multi-technique probabilistic level generation for action role playing games (2015)
- A logical approach to building dungeons: Answer set programming for hierarchical procedural content generation in roguelike games (2014)
- Machine Learning: A Probabilistic Perspective (2012)
- Generating Missions and Spaces for Adaptable Play Experiences (2011)
- Weisfeiler-lehman graph kernels (2011)
- Answer Set Programming for Procedural Content Generation: A Design Space Approach (2011)
- Search-Based Procedural Content Generation: A Taxonomy and Survey (2011)
- Analyzing the Expressive Range of a Level Generator (2010)
- Probabilistic Graphical Models: Principles and Techniques (2009)
- A Knowledge Compilation Map (2002)
- A Statistical Learning Method for Logic Programs with Distribution Semantics (1995)
- Fusion, propagation, and structuring in belief networks (1986)
- Definite Clause Grammars for Language Analysis—A Survey of the Formalism and a Comparison with Augmented Transition Networks (1980)