betaFeedback
PDF

WorksComputer Science

A note on the intractability of enumerating the maximal satisfiable subformulas of a Horn expression

Machine checks

No machine checks are available from the Hub API for this paper.

Paper details

vlnc:W_fh7f78g2
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 9

downloads · 1

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement