Simplified Boardgames

06/08/2016
by   Jakub Kowalski, et al.
0

We formalize Simplified Boardgames language, which describes a subclass of arbitrary board games. The language structure is based on the regular expressions, which makes the rules easily machine-processable while keeping the rules concise and fairly human-readable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/08/2017

Regular Boardgames

We present an initial version of Regular Boardgames general game descrip...
research
08/02/2015

Procedural Content Generation for GDL Descriptions of Simplified Boardgames

We present initial research towards procedural generation of Simplified ...
research
10/10/2018

Hint Orchestration Using ACL2's Simplifier

This paper describes a strategy for providing hints during an ACL2 proof...
research
08/09/2022

Lang-n-Send Extended: Sending Regular Expressions to Monitors

In prior work, Cimini has presented Lang-n-Send, a pi-calculus with lang...
research
01/08/2013

Language ASPf with Arithmetic Expressions and Consistency-Restoring Rules

In this paper we continue the work on our extension of Answer Set Progra...
research
01/04/2021

Strategic Features for General Games

This short paper describes an ongoing research project that requires the...
research
11/05/2018

Superregular grammars do not provide additional explanatory power but allow for a compact analysis of animal song

A pervasive belief with regard to the differences between human language...

Please sign up or login with your details

Forgot password? Click here to reset