Unique key Horn functions
Authors:
- Kristóf BércziKBKristóf Bérczi
- Endre BorosEBEndre Boros
- Ondřej ČepekOČOndřej Čepek
- Petr KučeraPKPetr Kučera
- Kazuhisa MakinoKMKazuhisa Makino
Open Access
- 4 May 2022
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 922, 170-178
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Magyar Tudományos Akadémia (LP2021-1/2021)
- NKFIH
- Kyoto University
- Research Institute for Mathematical Sciences
- Nemzeti Kutatási Fejlesztési és Innovációs Hivatal (FK128673, TKP2020-NKA-06)
- Grantová Agentura České Republiky (19-19463S)
This publication has 22 references indexed in Scilit:
- On computing all abductive explanations from a propositional Horn theoryJournal of the ACM, 2007
- The lattices of closure systems, closure operators, and implicational systems on a finite set: a surveyDiscrete Applied Mathematics, 2003
- On enumerating all minimal solutions of feedback problemsDiscrete Applied Mathematics, 2002
- Quasi-acyclic propositional Horn knowledge bases: optimal compressionIEEE Transactions on Knowledge and Data Engineering, 1995
- Optimal compression of propositional Horn knowledge bases: complexity and approximationArtificial Intelligence, 1993
- On graphs with polynomially solvable maximum‐weight clique problemNetworks, 1989
- An O(mn) algorithm for regular set-covering problemsTheoretical Computer Science, 1987
- Dualization of regular Boolean functionsDiscrete Applied Mathematics, 1987
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- Candidate keys for relationsJournal of Computer and System Sciences, 1978