Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Fluxes of organic and inorganic carbon within the Amazon basin are considerably controlled by annual flooding, which triggers the… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2012
2012
First-generation college students enter higher education with deficits, any one of which could prompt them to leave college… Expand
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Our purpose in this article is to propose a comprehensive, empirically grounded theory of action for improving the quality of… Expand
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Principal component (PCA) and factor analysis (FA) are widely used in animal behaviour research. However, many authors… Expand
  • table 1
Is this relevant?
Highly Cited
2010
Highly Cited
2010
This study examined the impact of a set of theoretically-derived predictor variables on the persistence and transfer of Hispanic… Expand
  • table 2
  • table 3
Is this relevant?
2006
2006
The last few years have seen the advent of a new breed of decision procedures for various fragments of first-order logic based on… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 6
  • figure 4
Is this relevant?
2005
2005
New models of schooling are necessary as educational institutions attempt to transition into the digital age. This article is an… Expand
  • figure 1
  • figure 2
  • table I
  • table II
  • figure 3
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Abstract The class of generalized satisfiability problems, introduced in 1978 by Schaefer, presents a uniform way of studying the… Expand
  • figure 1
Is this relevant?
Highly Cited
1984
Highly Cited
1984
New algorithms for deciding whether a (propositional) Horn formula is satisfiable are presented. If the Horn formula A contains K… Expand
Is this relevant?