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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1988-2017
02419882017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
We study the approximability of two natural Boolean constraint satisfaction problems: Horn satisfiability and exact hitting set… (More)
Is this relevant?
2009
2009
The recent quest for tractable logic-based languages arising from the eld of bio-medical ontologies has raised a lot of attention… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2008
2008
The submodular function minimization problem (SFM) is a fundamental problem in combinatorial optimization and several fully… (More)
Is this relevant?
2006
2006
  • A. Roy
  • J. Artif. Intell. Res.
  • 2006
A δ-model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be… (More)
  • figure 1
Is this relevant?
2005
2005
We compute the probability of satisfiability of a class of random Horn-SAT formulae, motivated by a connection with the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1999
1999
Phase transitions in combinatorial problems were first displayed in the seminal work by Erdiis and RCnyi [ER60] on random graphs… (More)
Is this relevant?
1998
1998
In this paper we consider the Maximum Horn Satisfiability problem, which is reduced to the problem of finding a minimum… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1992
1992
  • Michel Minoux
  • Annals of Mathematics and Artificial Intelligence
  • 1992
The unique satisfiability problem for general Boolean expressions has attracted interest in recent years in connection with basic… (More)
  • figure 1
Is this relevant?
1988
1988
We address the well-known satisfiability problem (SAT). i.e., the problem of checking whether a given propositional formula is… (More)
Is this relevant?