Detecting Embedded Horn Structure in Propositional Logic.pdf.pdf' (115.49 kB)
Download file

Detecting Embedded Horn Structure in Propositional Logic

Download (115.49 kB)
journal contribution
posted on 01.07.1977, 00:00 authored by V. Chandru, John N. Hooker
We show that the problem of finding a maximum renamable Horn problem within a propositional satisfiability problem is NP-hard but can be formulated as a set packing and therefore a maximum clique problem, for which numerous algorithms and heuristics have been developed.

History

Date

01/07/1977

Usage metrics

Exports