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.
2017
2017
A generalized 1-in-3SAT problem is defined and found to be in complexity class P when restricted to a certain subset of CNF… 
2012
2012
The AERA proposal is preserved here as summary. The full paper presented in AERA 2012 (Vancouver) is in the Main Article. 
Review
2007
Review
2007
The purpose of this analysis is to examine the relationship between the utilization of corporal punishment and its relationship… 
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… 
2004
2004
El esquema de Davis y de Putnam (DP en consecuencia, el algoritmo de D&P disenado de acuerdo con el problema general SAT corre… 
Review
2004
Review
2004
A survey was conducted using qualitative means to assess school counseling programs in Montana. Schools that were demonstration… 
2004
2004
Baker, K.S., Anderson, J.R., Lobe, T.E., Wharam, M.D., Qualman, S.J., Raney, R.B., et al. (2002). Children from ethnic minorities… 
1995
1995
We develop a methodology based upon HORNSAT for model checking and for checking behavioral relations between nite state processes… 
1992
1992
Many years ago researchers (Helmholtz 1925, Gibson 1957) hypothesized that the 3-D motion and the shape of the environment are… 
1987
1987
Techniques for the estimation of the motion vector field from image sequences may be subdivided into two main different…