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)

Semantic Scholar uses AI to extract papers important to this topic.

2010

2010

- Venkatesan Guruswami, Yuan Zhou
- SODA
- 2010

We study the approximability of two natural Boolean constraint satisfaction problems: Horn satisfiability and exact hitting setâ€¦Â (More)

Is this relevant?

2009

2009

- Roberto Sebastiani, Michele Vescovi
- CADE
- 2009

The recent quest for tractable logic-based languages arising from the eld of bio-medical ontologies has raised a lot of attentionâ€¦Â (More)

Is this relevant?

2008

2008

- David A. Cohen, Martin C. Cooper, Peter Jeavons
- Theor. Comput. Sci.
- 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)

Is this relevant?

2005

2005

A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas

- Cristopher Moore, Gabriel Istrate, Demetrios D. Demopoulos, Moshe Y. Vardi
- APPROX-RANDOM
- 2005

We compute the probability of satisfiability of a class of random Horn-SAT formulae, motivated by a connection with theâ€¦Â (More)

Is this relevant?

1999

1999

- Gabriel Istrate
- SODA
- 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

- Giorgio Gallo, Claudio Gentile, Daniele Pretolani, Gabriella Rago
- Math. Program.
- 1998

In this paper we consider the Maximum Horn Satisfiability problem, which is reduced to the problem of finding a minimumâ€¦Â (More)

Is this relevant?

1996

1996

Â

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)

Is this relevant?

1988

1988

- Giorgio Gallo, Maria Grazia ScutellÃ
- Inf. Process. Lett.
- 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?