Skip to search formSkip to main contentSkip to account menu

Horn-satisfiability

Known as: Horn satisfiability, Horn SAT, HORNSAT 
In formal logic, Horn-satisfiability, or HORNSAT, is the problem of deciding whether a given set of propositional Horn clauses is satisfiable or not… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
We propose low-rank representation (LRR) to segment data drawn from a union of multiple linear (or affine) subspaces. Given a set… 
Highly Cited
2010
Highly Cited
2010
Principal component (PCA) and factor analysis (FA) are widely used in animal behaviour research. However, many authors… 
Highly Cited
2010
Highly Cited
2010
We describe reductions from the problem of determining the satisfiability of Boolean CNF formulas (CNF-SAT) to several natural… 
Review
2009
Review
2009
One out of every 11 postsecondary undergraduates report having a disability, and students with learning disabilities are the… 
Review
2008
Review
2008
As the field of decision sciences in general and operations management in particular has matured from theory building to theory… 
Highly Cited
2007
Highly Cited
2007
This study draws on data from descriptive case studies of 15 high schools, three in each of five states. The findings highlight… 
Review
2005
Review
2005
Some research has shown that creativity test scores are independent from IQ scores, whereas other research has shown a… 
Highly Cited
1998
Highly Cited
1998
We present global and local algorithms for evaluating minimal fixed points of dependency graphs, a general problem in fixed-point… 
Highly Cited
1984