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.
2016
2016
In this paper, we investigate two series of Negative Polarity Items (NPIs) in Dharamsala Tibetan: one series uses the numeral… 
Review
2013
Review
2013
Background: Cervical cancer, although largely preventable, remains the most common cause of cancer mortality among women… 
2012
2012
First-generation college students enter higher education with deficits, any one of which could prompt them to leave college… 
Review
2008
Review
2008
As the field of decision sciences in general and operations management in particular has matured from theory building to theory… 
2008
2008
New models of schooling are necessary as educational institutions attempt to transition into the digital age. This article is an… 
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… 
1996
1996
We present a uniform approach for proving the polynomial time decidability of various simulation and equivalence relations for… 
1995
1995
Abstract Although parasite modification of host behaviour is well established, little is known about the effects of parasites on… 
1992
1992
The unique satisfiability problem for general Boolean expressions has attracted interest in recent years in connection with basic…