Skip to search formSkip to main contentSkip to account menu

2-satisfiability

Known as: 2-SAT, MAX-2SAT, 2-CNF-SAT 
In computer science, 2-satisfiability is a computational problem of assigning values to variables, each of which has two possible values, in order to… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
In Western societies the last several years, practicing yoga has really become fashionable and moved from being an auxiliary way… 
2016
2016
This study reports the findings of a research that compared the lowest airfares of full-service network carriers and low-cost… 
2015
2015
In this paper, we consider a tness-level model of a non-elitist mutationonly genetic algorithm (GA) with tournament selection… 
2014
2014
Teachers are routinely blamed for almost every underperforming child and every shortcoming of the nation’s public school system… 
2012
2012
We present a framework to represent and reason about narratives. We build a symbolic probabilistic representation of the temporal… 
2009
2009
Explaining the causes of infeasibility of Boolean formulas has many practical applications in various fields. A small… 
2002
2002
This dissertation consists of three independent essays, all of which are empirical treatments of different types of investment… 
1984
1984
Mise au point d'un modele experimental de contamination accidentelle. Les courbes de toxicite et de bioaccumulation sont…