Recognition and dualization of disguised bidual Horn functions.
From MaRDI portal
Publication:1853017
DOI10.1016/S0020-0190(01)00301-5zbMATH Open1051.68139OpenAlexW2035725027MaRDI QIDQ1853017FDOQ1853017
Authors: Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
Publication date: 21 January 2003
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00301-5
Recommendations
Cites Work
- LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
- Removing redundancy from a clause
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Title not available (Why is that?)
- The Complexity of Enumeration and Reliability Problems
- Renaming a Set of Clauses as a Horn Set
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- On the Complexity of Timetable and Multicommodity Flow Problems
- On generating all maximal independent sets
- Horn functions and submodular Boolean functions
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Horn functions and their DNFs
- Complexity of identification and dualization of positive Boolean functions
- Recognizing disguised NR(1) instances of the satisfiability problem
- The Maximum Latency and Identification of Positive Boolean Functions
- Dual subimplicants of positive Boolean functions
- Title not available (Why is that?)
- Dualization of regular Boolean functions
- Double Horn functions
- Bidual Horn functions and extensions
Cited In (4)
This page was built for publication: Recognition and dualization of disguised bidual Horn functions.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853017)