Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,830,550 papers from all fields of science
Search
Sign In
Create Free Account
2-satisfiability
Known as:
2-SAT
, MAX-2SAT
, 2-CNF-SAT
Expand
In computer science, 2-satisfiability is a computational problem of assigning values to variables, each of which has two possible values, in order to…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Approximation algorithm
Backtracking
Binary image
Boolean expression
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Preparing World-Class Teachers: Essential Reforms of Teacher Preparation and Credentialing in California.
L. Freedberg
,
Stephanie Rice
2014
Corpus ID: 158498075
Teachers are routinely blamed for almost every underperforming child and every shortcoming of the nation’s public school system…
Expand
2012
2012
Question Answering in Natural Language Narratives Using Symbolic Probabilistic Reasoning
Hannaneh Hajishirzi
,
E. Mueller
The Florida AI Research Society
2012
Corpus ID: 18706561
We present a framework to represent and reason about narratives. We build a symbolic probabilistic representation of the temporal…
Expand
2009
2009
Tracking Unsatisfiable Subformulas from Reduced Refutation Proof
Jianmin Zhang
,
ShengYu Shen
,
Sikun Li
Journal of Software
2009
Corpus ID: 13893924
Explaining the causes of infeasibility of Boolean formulas has many practical applications in various fields. A small…
Expand
2007
2007
Estimation of cumulative cadmium intake causing Itai-itai disease
稲葉 岳也
2007
Corpus ID: 130181865
2007
2007
Anemia among HIV-infected Individuals in South India
R. Subbaraman
2007
Corpus ID: 20693747
Anemia among HIV-infected Individuals in South India Ramnath Subbaraman, Anitha J. Cecelia, Sonia Singh, Bella Devaleenal…
Expand
2007
2007
Reducing SAT to 2-SAT
S. Gubin
arXiv.org
2007
Corpus ID: 3206432
Description of a polynomial time reduction of SAT to 2-SAT of polynomial size.
2005
2005
Branch-and-Bound Algorithms for MAX-2-SAT
Koga Yuichi
,
Nonobe Koji
,
Yagiura Mutsunori
,
Nagamochi Hiroshi
,
Ibaraki Toshihide
2005
Corpus ID: 149584418
2002
2002
Three empirical essays on investment in physical and human capital
C. Bleakley
2002
Corpus ID: 153581959
This dissertation consists of three independent essays, all of which are empirical treatments of different types of investment…
Expand
2000
2000
On the Probabilistic Approximate Completeness of WalkSAT for 2-SAT
Joseph Culbersony
,
Ian P. Gentz
,
Holger H. Hoosx
2000
Corpus ID: 16225901
1984
1984
Contamination accidentelle par le cadmium d'un mollusque Ruditapes decussatus - bioaccumulation et toxicité (Cl 50,96 H)
M. Henry
,
W. Huang
,
C. Cornet
,
M. Belluau
,
J. Durbec
1984
Corpus ID: 131550032
Mise au point d'un modele experimental de contamination accidentelle. Les courbes de toxicite et de bioaccumulation sont…
Expand