• Corpus ID: 239016024

Random Formula Generators

@article{Roff2021RandomFG,
  title={Random Formula Generators},
  author={Ariel Jonathan Roff{\'e} and Joaquin S. Toranzo Calderon},
  journal={ArXiv},
  year={2021},
  volume={abs/2110.09228}
}
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… 

Figures from this paper

References

SHOWING 1-10 OF 13 REFERENCES

Improvements to the Evaluation of Quantified Boolean Formulae

A number of techniques for reducing the amount of search that is needed are presented, and their effectiveness is evaluated by running the algorithm on a collection of formulae obtained from planning and generated randomly.

Scientific Benchmarking with Temporal Logic Decision Procedures

A hypothesis-driven design of the empirical analysis of different decision procedures for propositional temporal logic is proposed, which is to start by choosing the benchmark problems for which a particular decision procedure is expected to exhibit a behaviour different from another decision procedure.

Hard and Easy Distributions of SAT Problems

It is shown that by using the right distribution of instances, and appropriate parameter values, it is possible to generate random formulas that are hard, that is, for which satisfiability testing is quite difficult.

On Evaluating Decision Procedures for Modal Logic

The results do not support the claims of Giunchiglia and Sebastiani concerning the computational superiority of KSAT over KRIS, and an easy-hard-easy pattern for randomly generated modal formulae.

A SAT-based Decision Procedure for ALC

The goal of this paper is to describe and thoroughly test a decision procedure, called KSAT, checking satisfiability in the terminological logic A£C, and highlight an intrinsic weakeness that tableau- based decision procedures have with respect to SATbased decision procedures.

Optimisation Techniques for Expressive Description Logics

Five techniques for a tableaux based satis ability testing algorithm used to compute subsumption in Grail, an expressive description logic are studied in detail: normalisation and encoding, indexing, semantic branching, dependency directed backtracking and caching.

The TPTP Problem Library

This paper explains the motivations and reasoning behind the development of the TPTP (thus implicitly explaining the design decisions made) and describes theTP contents and organization.

Logic, Epistemology, and the Unity of Science

  • Shahid Rahman
  • Philosophy
    Logic, Epistemology, and the Unity of Science
  • 2004
This chapter discusses Logic, Epistemology and the Unity of Science: An Encyclopedic Project in the Spirit of Neurath and Diderot Shahid Rahman and John Symons, and some of the contributions from Non-Classical Logics.

The International SAT Solver Competitions

The International SAT Solver Competition is today an established series of competitive events aiming at objectively evaluating the progress in state-of-the-art procedures for solving Boolean

The TPTP Problem Library and Associated Infrastructure

  • G. Sutcliffe
  • Computer Science
    Journal of Automated Reasoning
  • 2009
This paper describes the First-Order Form (FOF) and Clause Normal Form (CNF) parts of the TPTP problem library, and the associated infrastructure. TPTP v3.5.0 was the last release containing only FOF