Polynomial-time inference of all valid implications for Horn and related formulae

1990/09/01 by Endre Boros, E. Boros, Yves Crama +2 · 1 citation
Computer Science · Mathematics · #Advanced Algebra and Logic #Bounded function #Class (philosophy) #Combinatorics #Computer science #Conjunctive normal form #Discrete mathematics #French horn #Inference #Logic, Reasoning, and Knowledge #Machine Learning and Algorithms #Mathematical analysis #Mathematics #Polynomial #Prime (order theory) #Quadratic equation #Time complexity

paper · doi:10.1007/bf01531068

crossref issued 1990/09/01 · crossref published 1990/09/01 · crossref published-online 1990/09/01 · crossref published-print 1990/09/01 · openalex publication_date 1990/09/01 · crossref created 2005/04/18 · crossref deposited 2019/05/03 · openalex created_date 2025/10/10 · crossref indexed 2026/01/08 · openalex updated_date 2026/07/23

Citations

• Recognizing disguised NR(1) instances of the satisfiability problem
• Renaming a Set of Clauses as a Horn Set
• The complexity of theorem-proving procedures
• A Machine-Oriented Logic Based on the Resolution Principle
• The Complexity of Enumeration and Reliability Problems

Cited by

• Endre Boros [wikipedia]