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

Horn clause

Known as: Horn formula, Universal Horn theory, Definite clause 
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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Automatic program verification and symbolic model checking tools interface with theorem proving technologies that check… Expand
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2013
Highly Cited
2013
One of the main challenges in software verification is efficient and precise compositional analysis of programs with procedures… Expand
  • figure 4
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Temporal verification of universal (i.e., valid for all computation paths) properties of various kinds of programs, e.g… Expand
  • figure 1
  • table 1
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Program proving can be viewed as solving for unknown relations (such as loop invariants, procedure summaries and so on) that… Expand
  • figure 2
  • figure 4
  • figure 5
  • table 1
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Even the entire Web corpus does not explicitly answer all questions, yet inference can uncover many implicit answers. But where… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We show how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules (RuleML Logic… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
This paper starts with the project of finding a large subclass of NP which exhibits a dichotomy. The approach is to find this… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
  • D. Poole
  • Artif. Intell.
  • 1993
  • Corpus ID: 11707680
This paper presents a simple framework for Horn-clause abduction, with probabilities associated with hypotheses. The framework… Expand
  • figure I
Is this relevant?
Highly Cited
1985
Highly Cited
1985
A set of Horn clauses, augmented with a ‘guard’ mechanism, is shown to be a simple and yet powerful parallel logic programming… Expand
  • figure 6.1
  • figure 6.2
  • figure 6.3
  • figure 6.4
  • table 6.1
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Certain first-order sentences, called "dependencies," about relations in a database are defined and studied. These dependencies… Expand
  • figure 1.2
Is this relevant?