Autark assignments of Horn CNFs

Kei Kimura, Kazuhisa Makino

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, we consider autark and linear autark assignments of Horn CNFs. We first study maximal autark assignments of Horn CNFs and devise a linear time algorithm of computing these assignments. This complements the previous work by Marek which reveals the properties of minimal autark assignments of Horn CNFs. We then consider linear autark assignments of Horn CNFs and give a combinatorial characterization of the existence of such an assignment. By making use of this characterization, we devise a linear time algorithm of finding linear autark assignments of Horn CNFs.

Original languageEnglish
Pages (from-to)297-309
Number of pages13
JournalJapan Journal of Industrial and Applied Mathematics
Volume35
Issue number1
DOIs
Publication statusPublished - Mar 1 2018
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Engineering(all)
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Autark assignments of Horn CNFs'. Together they form a unique fingerprint.

Cite this