Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
64 | Éric Grégoire, Bertrand Mazure, Cédric Piette |
MUST: Provide a Finer-Grained Explanation of Unsatisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2007, 13th International Conference, CP 2007, Providence, RI, USA, September 23-27, 2007, Proceedings, pp. 317-331, 2007, Springer, 978-3-540-74969-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
unsatisfiability, MUC, MUS, MUST, CSP, explanation, constraint networks |
53 | Ohad Shacham, Karen Yorav |
On-The-Fly Resolve Trace Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 44th Design Automation Conference, DAC 2007, San Diego, CA, USA, June 4-8, 2007, pp. 594-599, 2007, IEEE. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
49 | João Marques-Silva 0001, Vasco M. Manquinho |
Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings, pp. 225-230, 2008, Springer, 978-3-540-79718-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
49 | Loganathan Lingappan, Niraj K. Jha |
Efficient Design for Testability Solution Based on Unsatisfiability for Register-Transfer Level Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 26(7), pp. 1339-1345, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
49 | Zhenyu Chen 0001, Decheng Ding |
Variable Minimal Unsatisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings, pp. 262-273, 2006, Springer, 3-540-34021-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
49 | Jinbo Huang |
MUP: a minimal unsatisfiability prover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASP-DAC ![In: Proceedings of the 2005 Conference on Asia South Pacific Design Automation, ASP-DAC 2005, Shanghai, China, January 18-21, 2005, pp. 432-437, 2005, ACM Press, 0-7803-8737-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
49 | Albert Atserias |
On sufficient conditions for unsatisfiability of random formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 51(2), pp. 281-311, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Random CNF formulas, propositional resolution, satisfiability, datalog, phase transitions, pebble games |
49 | Evguenii I. Goldberg, Yakov Novikov |
Verification of Proofs of Unsatisfiability for CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: 2003 Design, Automation and Test in Europe Conference and Exposition (DATE 2003), 3-7 March 2003, Munich, Germany, pp. 10886-10891, 2003, IEEE Computer Society, 0-7695-1870-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
49 | Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito 0001 |
Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTCS ![In: Theoretical Computer Science, 7th Italian Conference, ICTCS 2001, Torino, Italy, October 4-6, 2001, Proceedings, pp. 328-338, 2001, Springer, 3-540-42672-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
39 | Vasco M. Manquinho, João Marques-Silva 0001, Jordi Planes |
Algorithms for Weighted Boolean Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings, pp. 495-508, 2009, Springer, 978-3-642-02776-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
39 | Sudeshna Dasgupta, Vijay Chandru |
Minimal Unsatisfiable Sets: Classification and Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIAN ![In: Advances in Computer Science - ASIAN 2004, Higher-Level Decision Making, 9th Asian Computing Science Conference, Dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday, Chiang Mai, Thailand, December 8-10, 2004, Proceedings, pp. 330-342, 2004, Springer, 3-540-24087-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Minimal Unsatisfiable Sets, satisfiability, propositional logic, Boolean formulas |
36 | Koen Claessen, Ann Lillieström |
Automated Inference of Finite Unsatisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-22, 22nd International Conference on Automated Deduction, Montreal, Canada, August 2-7, 2009. Proceedings, pp. 388-403, 2009, Springer, 978-3-642-02958-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
36 | Roberto Asín, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell |
Efficient Generation of Unsatisfiability Proofs and Cores in SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings, pp. 16-30, 2008, Springer, 978-3-540-89438-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Allen Van Gelder |
Verifying Propositional Unsatisfiability: Pitfalls to Avoid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2007, 10th International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings, pp. 328-333, 2007, Springer, 978-3-540-72787-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Steven D. Prestwich, Inês Lynce |
Local Search for Unsatisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings, pp. 283-296, 2006, Springer, 3-540-37206-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Mustafa Jarrar, Stijn Heymans |
Unsatisfiability Reasoning in ORM Conceptual Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDBT Workshops ![In: Current Trends in Database Technology - EDBT 2006, EDBT 2006 Workshops PhD, DataX, IIDB, IIHA, ICSNW, QLQP, PIM, PaRMA, and Reactivity on the Web, Munich, Germany, March 26-31, 2006, Revised Selected Papers, pp. 517-534, 2006, Springer, 3-540-46788-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Loganathan Lingappan, Niraj K. Jha |
Unsatisfiability Based Efficient Design for Testability Solution for Register-Transfer Level Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VTS ![In: 23rd IEEE VLSI Test Symposium (VTS 2005), 1-5 May 2005, Palm Springs, CA, USA, pp. 418-423, 2005, IEEE Computer Society, 0-7695-2314-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Ashish Tiwari 0001 |
An Algebraic Approach for the Unsatisfiability of Nonlinear Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings, pp. 248-262, 2005, Springer, 3-540-28231-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich |
Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings, pp. 15-26, 2003, Springer, 3-540-40543-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
36 | Piotr Berman, Marek Karpinski |
Approximating minimum unsatisfiability of linear equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 514-516, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
28 | Bing Li, Chao Wang 0001, Fabio Somenzi |
Abstraction refinement in symbolic model checking using satisfiability as the only decision procedure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 7(2), pp. 143-155, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Unsatisfiability proof, Bounded model checking, Satisfiability problem, Abstraction refinement |
28 | Hans Kleine Büning |
An Upper Bound for Minimal Resolution Refutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 12th International Workshop, CSL '98, Annual Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998, Proceedings, pp. 171-178, 1998, Springer, 3-540-65922-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
propositional formulas, length of proofs, minimal unsatisfiability, resolution |
28 | Vasek Chvátal, Bruce A. Reed |
Mick Gets Some (the Odds Are on His Side) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 620-627, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
unsatisfiability, truth assignment, randomly generated boolean formula, probability, time complexity, satisfiability, conjunctive normal form, linear-time algorithm |
28 | Peter B. Andrews |
Refutations by Matings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 25(8), pp. 801-807, 1976. The full citation details ...](Pics/full.jpeg) |
1976 |
DBLP DOI BibTeX RDF |
clause-occurrence, mating, unsatisfiability, first-order logic, resolution, merge, cycle, Automatic theorem proving, refutation |
26 | K. Subramani 0001 |
Optimal Length Resolution Refutations of Difference Constraint Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 43(2), pp. 121-137, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Difference constraint systems, Resolution refutation, Optimal length, Minimum unsatisfiable subset, Fourier-Motzkin elimination |
26 | Lukas Kroc, Ashish Sabharwal, Bart Selman |
Relaxed DPLL Search for MaxSAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings, pp. 447-452, 2009, Springer, 978-3-642-02776-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
26 | Engin Uzuncaova, Sarfraz Khurshid |
Constraint Prioritization for Efficient Analysis of Declarative Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FM ![In: FM 2008: Formal Methods, 15th International Symposium on Formal Methods, Turku, Finland, May 26-30, 2008, Proceedings, pp. 310-325, 2008, Springer, 978-3-540-68235-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Nathan Segerlind |
On the Relative Efficiency of Resolution-Like Proofs and Ordered Binary Decision Diagram Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pp. 100-111, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
lower bounds, resolution, ordered binary decision diagrams, propositional proof complexity |
26 | Joanna Golinska-Pilarek, Ewa Orlowska |
Tableaux and Dual Tableaux: Transformation of Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 85(3), pp. 283-302, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
first-order logic with identity, tableaux systems, Rasiowa-Sikorski proof system |
26 | Jun Liu 0001, Luis Martínez-López 0001, Yang Xu 0001, Zhirui Lu |
Automated Reasoning Algorithm for Linguistic Valued Lukasiewicz Propositional Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 37th International Symposium on Multiple-Valued Logic, ISMVL 2007, 13-16 May 2007, Oslo, Norway, pp. 29, 2007, IEEE Computer Society, 978-0-7695-2831-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Jianmin Zhang, ShengYu Shen, Sikun Li |
A Heuristic Local Search Algorithm for Unsatisfiable Cores Extraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (3) ![In: Computational Science and Its Applications - ICCSA 2007, International Conference, Kuala Lumpur, Malaysia, August 26-29, 2007. Proceedings. Part III, pp. 649-659, 2007, Springer, 978-3-540-74482-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Unsatisfiable core, Unit clause propagation, Binary clause resolution, Equality reduction, Local search |
26 | Engin Uzuncaova, Sarfraz Khurshid |
Kato: A Program Slicing Tool for Declarative Specifications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSE ![In: 29th International Conference on Software Engineering (ICSE 2007), Minneapolis, MN, USA, May 20-26, 2007, pp. 767-770, 2007, IEEE Computer Society, 0-7695-2828-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Dominique D'Almeida, Jean-François Condotta, Christophe Lecoutre, Lakhdar Sais |
Relaxation of Qualitative Constraint Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SARA ![In: Abstraction, Reformulation, and Approximation, 7th International Symposium, SARA 2007, Whistler, Canada, July 18-21, 2007, Proceedings, pp. 93-108, 2007, Springer, 978-3-540-73579-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Miguel F. Anjos |
An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 48(1-2), pp. 1-14, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 90C22, 03B05, 90C09, 90C90, 68T15 |
26 | Engin Uzuncaova, Sarfraz Khurshid |
Program slicing for declarative models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGSOFT Softw. Eng. Notes ![In: ACM SIGSOFT Softw. Eng. Notes 31(6), pp. 1-2, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Allen Van Gelder |
Independently Checkable Proofs from Decision Procedures: Issues and Progress. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 12th International Conference, LPAR 2005, Montego Bay, Jamaica, December 2-6, 2005, Proceedings, pp. 1, 2005, Springer, 3-540-30553-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | Albert Atserias |
Definability on a Random 3-CNF Formula. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 26-29 June 2005, Chicago, IL, USA, Proceedings, pp. 458-466, 2005, IEEE Computer Society, 0-7695-2266-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | Babita Sharma, Paritosh K. Pandya, Supratik Chakraborty |
Bounded Validity Checking of Interval Duration Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems, 11th International Conference, TACAS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005, Proceedings, pp. 301-316, 2005, Springer, 3-540-25333-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | Kenneth L. McMillan, Nina Amla |
Automatic Abstraction without Counterexamples. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems, 9th International Conference, TACAS 2003, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003, Warsaw, Poland, April 7-11, 2003, Proceedings, pp. 2-17, 2003, Springer, 3-540-00898-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
26 | Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy |
A sharp threshold in proof complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece, pp. 337-346, 2001, ACM, 1-58113-349-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
26 | Luís Baptista, João Marques-Silva 0001 |
Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2000, 6th International Conference, Singapore, September 18-21, 2000, Proceedings, pp. 489-494, 2000, Springer, 3-540-41053-8. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
26 | Oliver Kullmann |
An Application of Matroid Theory to the SAT Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 15th Annual IEEE Conference on Computational Complexity, Florence, Italy, July 4-7, 2000, pp. 116-, 2000, IEEE Computer Society, 0-7695-0674-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Nick Feng, Alan J. Hu, Sam Bayless, Syed M. Iqbal, Patrick Trentin, Mike Whalen, Lee Pike, John Backes |
DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2401.10703, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
23 | Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, Marc Vinyals |
Proving Unsatisfiability with Hitting Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 15th Innovations in Theoretical Computer Science Conference, ITCS 2024, January 30 to February 2, 2024, Berkeley, CA, USA, pp. 48:1-48:20, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-309-6. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
23 | Nick Feng, Alan J. Hu, Sam Bayless, Syed M. Iqbal, Patrick Trentin, Mike Whalen, Lee Pike, John Backes |
DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS (1) ![In: Tools and Algorithms for the Construction and Analysis of Systems - 30th International Conference, TACAS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part I, pp. 3-23, 2024, Springer, 978-3-031-57245-6. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
23 | Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, Marc Vinyals |
Proving Unsatisfiability with Hitting Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR23, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
23 | Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, Marc Vinyals |
Proving Unsatisfiability with Hitting Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.06241, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Dawn Michaelson, Dominik Schreiber, Marijn J. H. Heule, Benjamin Kiesl-Reiter, Michael W. Whalen |
Unsatisfiability Proofs for Distributed Clause-Sharing SAT Solvers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS (1) ![In: Tools and Algorithms for the Construction and Analysis of Systems - 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Paris, France, April 22-27, 2023, Proceedings, Part I, pp. 348-366, 2023, Springer, 978-3-031-30822-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Denis Firsov, Sven Laur, Ekaterina Zhuchko |
Unsatisfiability of Comparison-Based Non-malleability for Commitments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAC ![In: Theoretical Aspects of Computing - ICTAC 2022 - 19th International Colloquium, Tbilisi, Georgia, September 27-29, 2022, Proceedings, pp. 188-194, 2022, Springer, 978-3-031-17714-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Nobutaka Suzuki, Takuya Okada, Yeondae Kwon |
On CSS Unsatisfiability Problem in the Presense of DTDs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Inf. Syst. ![In: IEICE Trans. Inf. Syst. 104-D(6), pp. 801-815, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Marijn J. H. Heule |
Proofs of Unsatisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Satisfiability ![In: Handbook of Satisfiability - Second Edition, pp. 635-668, 2021, IOS Press, 978-1-64368-160-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Hans Kleine Büning, Oliver Kullmann |
Minimal Unsatisfiability and Autarkies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Satisfiability ![In: Handbook of Satisfiability - Second Edition, pp. 571-633, 2021, IOS Press, 978-1-64368-160-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Abderrahim Ait Wakrime, Mouna Rekik 0001, Saïd Jabbour |
Cloud service composition using minimal unsatisfiability and genetic algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Concurr. Comput. Pract. Exp. ![In: Concurr. Comput. Pract. Exp. 32(15), 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Hans Kleine Büning, Piotr Wojciechowski 0002, K. Subramani 0001 |
NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Struct. Comput. Sci. ![In: Math. Struct. Comput. Sci. 30(7), pp. 736-751, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh |
Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2001.11973, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
23 | Daya Ram Gaur, Muhammad Khan |
Testing Unsatisfiability of Constraint Satisfaction Problems via Tensor Products. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.03766, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
23 | Daya Ram Gaur, Muhammad Khan |
Testing Unsatisfiability of Constraint Satisfaction Problems via Tensor Products. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAIM ![In: International Symposium on Artificial Intelligence and Mathematics, ISAIM 2020, Fort Lauderdale, Florida, USA, January 6-8, 2020., 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
23 | Jingchao Chen |
Fast Verifying Proofs of Propositional Unsatisfiability via Window Shifting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAIM ![In: International Symposium on Artificial Intelligence and Mathematics, ISAIM 2020, Fort Lauderdale, Florida, USA, January 6-8, 2020., 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
23 | Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh |
Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, pp. 1460-1466, 2020, ijcai.org. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Ziliang Chen, Zhanfu Yang |
Graph Neural Reasoning May Fail in Certifying Boolean Unsatisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1909.11588, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
23 | Norbert Manthey, Tobias Philipp |
Checking Unsatisfiability Proofs in Parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POS@SAT ![In: Proceedings of Pragmatics of SAT 2015, Austin, Texas, USA, September 23, 2015 / Pragmatics of SAT 2018, Oxford, UK, July 7, 2018., pp. 34-49, 2018, EasyChair. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Hoda Abbasizanjani, Oliver Kullmann |
Minimal Unsatisfiability and Minimal Strongly Connected Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2018 - 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings, pp. 329-345, 2018, Springer, 978-3-319-94143-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Rohan Fossé, Laurent Simon |
On the Non-degeneracy of Unsatisfiability Proof Graphs Produced by SAT Solvers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - 24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings, pp. 128-143, 2018, Springer, 978-3-319-98333-2. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Miguel F. Anjos, Manuel V. C. Vieira |
On semidefinite least squares and minimal unsatisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 217, pp. 79-96, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Tobias Philipp, Adrián Rebola-Pardo |
Towards a Semantics of Unsatisfiability Proofs with Inprocessing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: LPAR-21, 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana, May 7-12, 2017, pp. 65-84, 2017, EasyChair. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Oliver Kullmann |
Minimal unsatisfiability and deficiency: recent developments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1610.08575, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
23 | Jingchao Chen |
Fast Verifying Proofs of Propositional Unsatisfiability via Window Shifting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1611.04838, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
23 | Takuro Kutsuna, Yoshinao Ishii |
Analyzing Unsatisfiability in Bounded Model Checking Using Max-SMT and Dual Slicing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FMICS-AVoCS ![In: Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings, pp. 65-80, 2016, Springer, 978-3-319-45942-4. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Tobias Philipp |
Unsatisfiability Proofs for Parallel SAT Solver Portfolios with Clause Sharing and Inprocessing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GCAI ![In: GCAI 2016. 2nd Global Conference on Artificial Intelligence, September 19 - October 2, 2016, Berlin, Germany, pp. 24-38, 2016, EasyChair. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Oliver Kullmann, Xishun Zhao |
Parameters for minimal unsatisfiability: Smarandache primitive numbers and full clauses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1505.02318, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
23 | Till Mossakowski, Lutz Schröder |
On Inconsistency and Unsatisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Informatics ![In: Int. J. Softw. Informatics 9(2), pp. 141-152, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
23 | Abderrahim Ait Wakrime, Saïd Jabbour |
Minimum Unsatisfiability based QoS Web Service Composition over the Cloud Computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISDA ![In: 15th International Conference on Intelligent Systems Design and Applications, ISDA 2015, Marrakech, Morocco, December 14-16, 2015, pp. 540-545, 2015, IEEE, 978-1-4673-8709-5. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Yiyuan Wang, Dantong Ouyang, Liming Zhang 0005 |
Improved Algorithm of Unsatisfiability-based Maximum Satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOST-1 ![In: Proceedings of the 1st International Workshop on Semantic Technologies (IWOST), Changchun, China, March 9-12, 2015., pp. 93-103, 2015, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
23 | Ruben Martins, Saurabh Joshi 0001, Vasco M. Manquinho, Inês Lynce |
On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Satisf. Boolean Model. Comput. ![In: J. Satisf. Boolean Model. Comput. 9(1), pp. 59-81, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Marijn Heule, Warren A. Hunt Jr., Nathan Wetzler |
Bridging the gap between easy generation and efficient verification of unsatisfiability proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Softw. Test. Verification Reliab. ![In: Softw. Test. Verification Reliab. 24(8), pp. 593-607, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Marijn Heule, Norbert Manthey, Tobias Philipp |
Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POS@SAT ![In: POS-14. Fifth Pragmatics of SAT workshop, a workshop of the SAT 2014 conference, part of FLoC 2014 during the Vienna Summer of Logic, July 13, 2014, Vienna, Austria, pp. 12-25, 2014, EasyChair. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Lavinia María Picollo |
Yablo's Paradox in Second-Order Languages: Consistency and Unsatisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 101(3), pp. 601-617, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Lu-lu Wu, Hai-Jun Zhou, Mikko Alava, Erik Aurell, Pekka Orponen |
Witness of unsatisfiability for a random 3-satisfiability formula ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1303.2413, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
23 | Ricardo Menchaca-Mendez |
Unsatisfiability Bounds for Random Constraint Satisfaction Problems from an Energetic Interpolation Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2013 |
RDF |
|
23 | Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller |
Theorem proving for prenex Gödel logic with Delta: checking validity and unsatisfiability ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. Methods Comput. Sci. ![In: Log. Methods Comput. Sci. 8(1), 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Dimitris Achlioptas, Ricardo Menchaca-Mendez |
Unsatisfiability Bounds for Random CSPs from an Energetic Interpolation Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I, pp. 1-12, 2012, Springer, 978-3-642-31593-0. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Benjamin Andres, Benjamin Kaufmann, Oliver Matheis, Torsten Schaub |
Unsatisfiability-based optimization in clasp. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP (Technical Communications) ![In: Technical Communications of the 28th International Conference on Logic Programming, ICLP 2012, September 4-8, 2012, Budapest, Hungary, pp. 211-221, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-43-9. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Martin Fürer |
Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings, pp. 387-398, 2012, Springer, 978-3-642-29343-6. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Oliver Kullmann |
Constraint Satisfaction Problems in Clausal Form II: Minimal Unsatisfiability and Conflict Structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 109(1), pp. 83-119, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Koen Claessen, Ann Lillieström |
Automated Inference of Finite Unsatisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 47(2), pp. 111-132, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Jakob Nordström, Alexander A. Razborov |
On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I, pp. 642-653, 2011, Springer, 978-3-642-22005-0. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Federico Heras, João Marques-Silva 0001 |
Read-Once Resolution for Unsatisfiability-Based Max-SAT Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011, pp. 572-577, 2011, IJCAI/AAAI, 978-1-57735-516-8. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Roberto Javier Asín Achá, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell |
Practical algorithms for unsatisfiability proof and core generation in SAT solvers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AI Commun. ![In: AI Commun. 23(2-3), pp. 145-157, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Vasco M. Manquinho, Ruben Martins, Inês Lynce |
Improving Unsatisfiability-Based Algorithms for Boolean Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings, pp. 181-193, 2010, Springer, 978-3-642-14185-0. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | João Marques-Silva 0001 |
Minimal Unsatisfiability: Models, Algorithms and Applications (Invited Paper). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 40th IEEE International Symposium on Multiple-Valued Logic, ISMVL 2010, Barcelona, Spain, 26-28 May 2010, pp. 9-14, 2010, IEEE Computer Society, 978-0-7695-4024-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Jakob Nordström, Alexander A. Razborov |
On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR09, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
23 | Manuel Clavel, Marina Egea, Miguel Angel García de Dios |
Checking Unsatisfiability for OCL Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Commun. Eur. Assoc. Softw. Sci. Technol. ![In: Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 24, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Jakob Nordström, Alexander A. Razborov |
On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0910.3127, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
23 | David Pereira, Inês Lynce, Steven D. Prestwich |
On Improving Local Search for Unsatisfiability ![Search on Bibsonomy](Pics/bibsonomy.png) |
LSCS ![In: Proceedings 6th International Workshop on Local Search Techniques in Constraint Satisfaction, LSCS 2009, Lisbon, Portugal, 20 September 2009., pp. 41-53, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Hans Kleine Büning, Oliver Kullmann |
Minimal Unsatisfiability and Autarkies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Satisfiability ![In: Handbook of Satisfiability, pp. 339-401, 2009, IOS Press, 978-1-58603-929-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Stefan Kupferschmid, Tino Teige, Bernd Becker 0001, Martin Fränzle |
Proofs of Unsatisfiability for mixed Boolean and Non-linear Arithmetic Constraint Formulae. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MBMV ![In: Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV), Berlin, Germany, March 2-4, 2009, pp. 27-36, 2009, Universitätsbibliothek Berlin, Germany. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
23 | Richard Ostrowski, Lionel Paris |
Detecting Boolean Functions for Proving Unsatisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: ICTAI 2009, 21st IEEE International Conference on Tools with Artificial Intelligence, Newark, New Jersey, USA, 2-4 November 2009, pp. 409-416, 2009, IEEE Computer Society, 978-0-7695-3920-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Michael Molloy 0001 |
When does the giant component bring unsatisfiability? ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 28(6), pp. 693-734, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Knot Pipatsrisawat, Adnan Darwiche |
A New Clause Learning Scheme for Efficient Unsatisfiability Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17, 2008, pp. 1481-1484, 2008, AAAI Press, 978-1-57735-368-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
23 | Allen Van Gelder |
Verifying RUP Proofs of Propositional Unsatisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAIM ![In: International Symposium on Artificial Intelligence and Mathematics, ISAIM 2008, Fort Lauderdale, Florida, USA, January 2-4, 2008, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|