Bernays–Schönfinkel class

Known as: Bernays–Schonfinkel class, Effectively propositional, Bernays-Schonfinkel class 
The Bernays–Schönfinkel class (also known as Bernays–Schönfinkel-Ramsey class) of formulas, named after Paul Bernays and Moses Schönfinkel (and Frank… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1999-2017
024619992017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Despite the wide range of existing tool support, constructing a design environment for a complex domain-specific language (DSL… (More)
Is this relevant?
2014
2014
First order logic with transitive closure, and separation logic enable elegant interactive verification of heap-manipulating… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 4
  • figure 8
Is this relevant?
2013
2013
In this paper we investigate the finite satisfiability problem for firstorder logic. We show that the finite satisfiability… (More)
  • figure 1
Is this relevant?
2012
2012
It is well known that preprocessing is crucial for efficient reasoning on large industrial problems. Although preprocessing is… (More)
  • table II
  • figure 1
  • table V
  • table VI
Is this relevant?
2012
2012
We present the tool qbf2epr which translates quantified Boolean formulas (QBF) to formulas in effectively propositional logic… (More)
  • figure 1
  • table 1
Is this relevant?
2011
2011
Decidability and complexity of the satisfiability problem for the logics of time intervals have been extensively studied in the… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2010
2010
Bernays-Schönfinkel class with Datalog is a 2-variable fragment of the Bernays-Schönfinkel class extended with least fixed points… (More)
  • figure 1
Is this relevant?
2002
2002
The validity problem for full first-order logic is only semi-decidable. However, there are many interesting problems that, when… (More)
  • table 1
Is this relevant?