Switch to: Citations

Add references

You must login to add references.
  1. Optimal compression of propositional Horn knowledge bases: complexity and approximation.Peter L. Hammer & Alexander Kogan - 1993 - Artificial Intelligence 64 (1):131-145.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Redundancy in logic I: CNF propositional formulae.Paolo Liberatore - 2005 - Artificial Intelligence 163 (2):203-232.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Removing redundancy from a clause.Georg Gottlob & Christian G. Fermüller - 1993 - Artificial Intelligence 61 (2):263-289.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
    • Home | Bibliographies | About PhilArchive | Contact us | Code of conduct

    CDP Phiosophy Documentation Center
    PhilPapers logo by Andrea Andrews and Meghan Driscoll.
    This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications).

    Use of this site is subject to terms & conditions.
    All rights reserved by The PhilPapers Foundation

    Server: philpapers-web-c4c498947-z4tjs uwo