Switch to: References

Add citations

You must login to add citations.
  1. Conflict-driven answer set solving: From theory to practice.Martin Gebser, Benjamin Kaufmann & Torsten Schaub - 2012 - Artificial Intelligence 187-188 (C):52-89.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Propositional proof systems based on maximum satisfiability.Maria Luisa Bonet, Sam Buss, Alexey Ignatiev, Antonio Morgado & Joao Marques-Silva - 2021 - Artificial Intelligence 300 (C):103552.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • QCDCL with cube learning or pure literal elimination – What is best?Benjamin Böhm, Tomáš Peitl & Olaf Beyersdorff - 2024 - Artificial Intelligence 336 (C):104194.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Algorithms for computing minimal equivalent subformulas.Anton Belov, Mikoláš Janota, Inês Lynce & Joao Marques-Silva - 2014 - Artificial Intelligence 216:309-326.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Complexity issues related to propagation completeness.Martin Babka, Tomáš Balyo, Ondřej Čepek, Štefan Gurský, Petr Kučera & Václav Vlček - 2013 - Artificial Intelligence 203 (C):19-34.
    Download  
     
    Export citation  
     
    Bookmark  
    		•
  • Polynomial calculus for optimization.Ilario Bonacina, Maria Luisa Bonet & Jordi Levy - 2024 - Artificial Intelligence 337 (C):104208.
    Download  
     
    Export citation  
     
    Bookmark  
    		•
    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-6b8b7fc7ff-qzffw uwo