Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,425,483 papers from all fields of science
Search
Sign In
Create Free Account
Horn clause
Known as:
Horn formula
, Universal Horn theory
, Definite clause
Expand
In mathematical logic and logic programming, a Horn clause is a logical formula of a particular rule-like form which gives it useful properties for…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
37 relations
ALF
Automated theorem proving
Blake canonical form
Boolean satisfiability problem
Expand
Broader (1)
Logic in computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
Design and simulation of a 1 to 14 GHz broadband electromagnetic compatibility DRGH antenna
M. Botello-Pérez
,
H. Jardón-Aguilar
,
I. Ruiz
International Conference on Electrical and…
2005
Corpus ID: 23373859
This work presents the design and simulation of a 1-14 GHz double ridged guide horn antenna (DRGH) with coaxial input feed…
Expand
Highly Cited
2004
Highly Cited
2004
Reflection in Membership Equational Logic, Many-Sorted Equational Logic, Horn Logic with Equality, and Rewriting Logic
M. Clavel
,
J. Meseguer
,
Miguel Palomino
Workshop on Rewriting Logic and Its Applications
2004
Corpus ID: 6896688
Review
2001
Review
2001
Security for Mobility
H. R. Nielson
,
F. Nielson
,
Mikael Buchholtz
Foundations of Security Analysis and Design
2001
Corpus ID: 26378404
We show how to use static analysis to provide information about security issues related to mobility. First the syntax and…
Expand
1999
1999
Horn Clause Computation with DNA Molecules
Satoshi Kobayashi
Journal of combinatorial optimization
1999
Corpus ID: 30034887
In this paper, we will propose Horn clause computation as an underlying computational framework of DNA computer. Horn clause…
Expand
Highly Cited
1990
Highly Cited
1990
Constraint Analysis: A Design Process for Specifying Operations on Objects
S. Urban
,
L. Delcambre
IEEE Transactions on Knowledge and Data…
1990
Corpus ID: 37734241
A design process for an object-oriented database design environment, known as constraint analysis, is presented. Given the…
Expand
Highly Cited
1989
Highly Cited
1989
Completion Without Failure11This research was supported in part by the National Science Foundation under grants DCR 85–13417 and DCR 85–16243.
L. Bachmair
,
N. Dershowitz
,
D. Plaisted
1989
Corpus ID: 808085
Highly Cited
1989
Highly Cited
1989
A direct method for locating the focus of expansion
S. Negahdaripour
,
Berthold K. P. Horn
Computer Vision Graphics and Image Processing
1989
Corpus ID: 5568221
1988
1988
Non-Horn clause logic programming without contrapositives
D. Plaisted
Journal of automated reasoning
1988
Corpus ID: 3161861
We present an extension of Prolog-style Horn clause logic programming to full first order logic. This extension has some…
Expand
Highly Cited
1988
Highly Cited
1988
On Word Problems in Horn Theories
Emmanuel Kounalis
,
M. Rusinowitch
Journal of symbolic computation
1988
Corpus ID: 34324643
Highly Cited
1987
Highly Cited
1987
Implementation of Recursive Queries for a Data Language Based on Pure Horn Logic
D. Saccá
,
C. Zaniolo
International Conference on Logic Programming
1987
Corpus ID: 34451798
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