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  
  • On the power of clause-learning SAT solvers as resolution engines.Knot Pipatsrisawat & Adnan Darwiche - 2011 - Artificial Intelligence 175 (2):512-525.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Redundancy in logic I: CNF propositional formulae.Paolo Liberatore - 2005 - Artificial Intelligence 163 (2):203-232.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Redundancy in logic II: 2CNF and Horn propositional formulae.Paolo Liberatore - 2008 - Artificial Intelligence 172 (2-3):265-299.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Redundancy in logic III: Non-monotonic reasoning.Paolo Liberatore - 2008 - Artificial Intelligence 172 (11):1317-1359.
    Download  
     
    Export citation  
     
    Bookmark   2 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-7674574dd6-vfs6p uwo