Random Formula Generators

• Published in 2021
• Added on 2024-03-11

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.

Links

• http://arxiv.org/abs/2110.09228v1
• http://arxiv.org/pdf/2110.09228v1

Other information

BibTeX entry

@article{RandomFormulaGenerators,
	key = {RandomFormulaGenerators},
	type = {article},
	title = {Random Formula Generators},
	author = {Ariel J. Roffe and Joaquin S. Toranzo Calderon},
	abstract = {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.},
	comment = {},
	date_added = {2024-03-11},
	date_published = {2021-10-09},
	urls = {http://arxiv.org/abs/2110.09228v1,http://arxiv.org/pdf/2110.09228v1},
	collections = {basically-computer-science},
	url = {http://arxiv.org/abs/2110.09228v1 http://arxiv.org/pdf/2110.09228v1},
	year = 2021,
	urldate = {2024-03-11},
	archivePrefix = {arXiv},
	eprint = {2110.09228},
	primaryClass = {cs.LO}
}