Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,018,054 papers from all fields of science
Search
Sign In
Create Free Account
Horn-satisfiability
Known as:
Horn satisfiability
, Horn SAT
, HORNSAT
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
2-satisfiability
Boolean satisfiability problem
Clause (logic)
Horn clause
Expand
Broader (1)
Logic in computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A PROTOSTELLAR JET EMANATING FROM A HYPERCOMPACT H ii REGION
A. Guzm'an
,
G. Garay
,
Luis F. Rodríguez
,
Y. Contreras
,
C. Dougados
,
S. Cabrit
2016
Corpus ID: 13799975
We present radio continuum observations of the high-mass young stellar object (HMYSO) G345.4938+01.4677 obtained using the…
Expand
Review
2013
Review
2013
Awareness of HPV and Cervical Cancer Vaccine among PHC Physicians in Kuwait
Anoud Aljuwaihel
,
Alaa Al-Jarallah
,
H. Al-Busairi
,
Medhat K. El-Shazly
2013
Corpus ID: 6853839
Background: Cervical cancer, although largely preventable, remains the most common cause of cancer mortality among women…
Expand
2006
2006
Finite Instantiations for Integer Difference Logic
Hyondeuk Kim
,
F. Somenzi
Formal Methods in Computer-Aided Design
2006
Corpus ID: 10163169
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
1997
1997
Song switching in monandrous and polyandrous dunnocks, Prunella modularis
N. Langmore
Animal Behaviour
1997
Corpus ID: 54685313
Abstract The dunnock song repertoire comprises multiple song types, and during bouts of singing males repeat a song type several…
Expand
1995
1995
Polynomial Restrictions of SAT: What Can Be Done with an Efficient Implementation of the Davis and Putnam's Procedure?
A. Rauzy
International Conference on Principles and…
1995
Corpus ID: 14827330
Constraint Solving Problems are NP-Complete and thus computationaly intractable. Two approaches have been used to tackle this…
Expand
1992
1992
The Unique Horn-Satisfiability problem and quadratic Boolean equations
M. Minoux
Annals of Mathematics and Artificial Intelligence
1992
Corpus ID: 10916892
The unique satisfiability problem for general Boolean expressions has attracted interest in recent years in connection with basic…
Expand
1992
1992
Predispositions and learning: behavioural dissociations in the chick
Mark H. Johnson
,
J. Bolhuis
,
G. Horn
Animal Behaviour
1992
Corpus ID: 53155625
1991
1991
Automated program transformation through proof transformation
Peter Madden
1991
Corpus ID: 28703425
We investigate program optimization and program adaptation (or specialization) by the transformation of (constructive) synthesis…
Expand
1988
1988
Reversibility revisited: Stimulus-dependent stability of filial preference in the chick
Johan J. Bolhuis
,
W. J. Trooster
Animal Behaviour
1988
Corpus ID: 53199163
1968
1968
DISHABITUATION AND AROUSAL IN THE RESPONSE OF SINGLE NERVE CELLS IN AN INSECT BRAIN
C. Rowell
,
G. Horn
1968
Corpus ID: 17180059
1. The background activity of neurones in the tritocerebrum of the locust responding to objects moved in the contralateral visual…
Expand
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)
ACCEPT & CONTINUE