Skip to search formSkip to main contentSkip to account menu

Bernays–Schönfinkel class

Known as: Schönfinkel, Bernays–Schonfinkel class, Effectively propositional 
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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
This paper investigates the satisfiability problem for Separation Logic, with unrestricted nesting of separating conjunctions and… 
2016
2016
Existing approaches to synthesize reactive systems from declarative specifications mostly rely on Binary Decision Diagrams (BDDs… 
2014
2014
First order logic with transitive closure, and separation logic enable elegant interactive verification of heap-manipulating… 
2013
2013
We show that every geometric morphism between realizability toposes satises the condition that its inverse image commutes with… 
2009
2009
2007
2007
The Bernays-Schonfinkel-Ramsey (BSR) class of formulas is the class of formulas that, when written in prenex normal form, have an… 
Highly Cited
2007
Highly Cited
2007
Session 1. Invited Talk: Colin Stirling.- Games, Automata and Matching.- Session 2. Higher-Order Logic.- Formalization of… 
Highly Cited
2007
Highly Cited
2007
SAT: Past and Future.- Encodings of Problems in Effectively Propositional Logic.- Efficient Circuit to CNF Conversion.- Mapping… 
Review
1995
Review
1995
Moths and butterflies whose larvae do not feed on plants represent a decided minority slice of lepidopteran diversity, yet offer… 
Review
1993
Review
1993
As Thompson ( 1988a) remarks, the relationship between adult oviposition preference and offspring performance is the crux of the…