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)

Related topics

Related topics

50 relations
Approximation algorithmBacktrackingBinary imageBoolean expression

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Analysis of the lowest airfares considering the different business models of airlines, the case of Budapest
This study reports the findings of a research that compared the lowest airfares of full-service network carriers and low-cost… 
2012
2012
Question Answering in Natural Language Narratives Using Symbolic Probabilistic Reasoning
We present a framework to represent and reason about narratives. We build a symbolic probabilistic representation of the temporal… 
2010
2010
Improved Parameterized Algorithms for Constraint Satisfaction
For many constraint satisfaction problems, the algorithm which chooses a random assignment achieves the best possible… 
2010
2010
An improved algorithm for frequent patterns mining problem
Frequent pattern mining is a basic problem in data mining and knowledge discovery. The discovered patterns can be used as the… 
2007
2007
Estimation of cumulative cadmium intake causing Itai-itai disease
2006
2006
Determination and estimation of Cadmium intake from Tarom rice
Cadmium (Cd) is one of the most well-known environmental intoxicants to humans. Its entrance to food chain causes the serious… 
2005
2005
Improving exact algorithms for MAX-2-SAT
We study three new techniques that will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is… 
2005
2005
Sums of Squares, Satisfiability and Maximum Satisfiability
Recently the Mathematical Programming community showed a renewed interest in Hilbert's Positivstellensatz. The reason for this is… 
Review
2004
Review
2004
Clustering of Time-Course Gene Expression Data
Microarray experiments have been used to measure genes’ expression levels under different cellular conditions or along certain… 
Highly Cited
1986
Highly Cited
1986
Partitioned-charge-based modeling of bipolar transistors for non-quasi-static circuit simulation
The concept of partitioned-charge-based (PC) modeling of bipolar transistors is developed and demonstrated, and shown to be… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)