Random Formula Generators

In this article, we provide three generators of propositional formulae for arbitrary languages, which uniformly sample three different formulae spaces. They take the same three parameters as input, namely, a desired depth, a set of atomics and a set of logical constants (with specified arities). The...

Full description

Saved in:
Bibliographic Details
Main Authors Roffe, Ariel J, Calderon, Joaquin S. Toranzo
Format Journal Article
LanguageEnglish
Published 08.10.2021
Subjects
Computer Science - Logic in Computer Science
Mathematics - Logic
Online AccessGet full text
DOI10.48550/arxiv.2110.09228

Cover

More Information
Summary:In this article, we provide three generators of propositional formulae for arbitrary languages, which uniformly sample three different formulae spaces. They take the same three parameters as input, namely, a desired depth, a set of atomics and a set of logical constants (with specified arities). The first generator returns formulae of exactly the given depth, using all or some of the propositional letters. The second does the same but samples up-to the given depth. The third generator outputs formulae with exactly the desired depth and all the atomics in the set. To make the generators uniform (i.e. to make them return every formula in their space with the same probability), we will prove various cardinality results about those spaces.
DOI:10.48550/arxiv.2110.09228