Found 279 Documents (Results 1–100)
From non-punctuality to non-adjacency: a quest for decidability of timed temporal logics with quantifiers. (English) Zbl 07918427
MSC:
68-XX
Boosting definability bipartition computation using SAT witnesses. (English) Zbl 07855154
Gaggl, Sarah (ed.) et al., Logics in artificial intelligence. 18th European conference, JELIA 2023, Dresden, Germany, September 20–22, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14281, 697-711 (2023).
MSC:
68T27
Parameterized complexity of propositional inclusion and independence logic. (English) Zbl 07810570
Hansen, Helle Hvid (ed.) et al., Logic, language, information, and computation. 29th international workshop, WoLLIC 2023, Halifax, NS, Canada, July 11–14, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13923, 274-291 (2023).
MSC:
03B70
Propositional proof skeletons. (English) Zbl 1543.68258
Sankaranarayanan, Sriram (ed.) et al., 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 2023, Paris, France, April 22–27, 2023. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 13993, 329-347 (2023).
An isomorphism-invariant distance function on propositional formulas in CNF. (English) Zbl 1523.68044
A comprehensive study of \(k\)-portfolios of recent SAT solvers. (English) Zbl 07880723
Meel, Kuldeep S. (ed.) et al., 25th international conference on theory and applications of satisfiability testing, SAT 2022, Haifa, Israel, August 2–5, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 236, Article 2, 18 p. (2022).
Propositional satisfiability logic via ant colony optimization in Hopfield neural network. (English) Zbl 07807408
Why does propositional quantification make modal and temporal logics on trees robustly hard? (English) Zbl 07577569
Parameterised complexity of model checking and satisfiability in propositional dependence logic. (English) Zbl 1534.68108
A non-clausal tableau calculus for MinSat. (English) Zbl 1482.68269
Reviewer: Łukasz Czajka (Dortmund)
Recursive backdoors for SAT. (English) Zbl 07724246
Bonchi, Filippo (ed.) et al., 46th international symposium on mathematical foundations of computer science, MFCS 2021, August 23–27, 2021, Tallinn, Estonia. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 202, Article 73, 18 p. (2021).
MSC:
68Qxx
A study of symmetry breaking predicates and model counting. (English) Zbl 1507.68221
Biere, Armin (ed.) et al., Tools and algorithms for the construction and analysis of systems. 26th international conference, TACAS 2020, held as part of the European joint conferences on theory and practice of software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 12078, 115-134 (2020).
Parameterised complexity of model checking and satisfiability in propositional dependence logic. (English) Zbl 07266051
Herzig, Andreas (ed.) et al., Foundations of information and knowledge systems. 11th international symposium, FoIKS 2020, Dortmund, Germany, February 17–21, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12012, 157-174 (2020).
CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement. (English) Zbl 1451.68248
MSC:
68T20
The complete set of minimal simple graphs that support unsatisfiable 2-CNFs. (English) Zbl 1442.05217
Knowledge compilation languages as proof systems. (English) Zbl 1441.68153
Janota, Mikoláš (ed.) et al., Theory and applications of satisfiability testing – SAT 2019. 22nd international conference, SAT 2019, Lisbon, Portugal, July 9–12, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11628, 90-99 (2019).
A tableau calculus for non-clausal maximum satisfiability. (English) Zbl 1435.68372
Cerrito, Serenella (ed.) et al., Automated reasoning with analytic tableaux and related methods. 28th international conference, TABLEAUX 2019, London, UK, September 3–5, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11714, 58-73 (2019).
On propositional coding techniques for the distinguishability of objects in finite sets. (Russian. English summary) Zbl 1425.94047
Complexity and expressivity of propositional dynamic logics with finitely many variables. (English) Zbl 1492.03013
Efficient SAT-based encodings of conditional cardinality constraints. (English) Zbl 1415.68185
Barthe, Gilles (ed.) et al., LPAR-22. 22nd international conference on logic for programming, artificial intelligence and reasoning, Awassa, Ethiopia, November 17–21, 2018. Selected papers. Manchester: EasyChair. EPiC Ser. Comput. 57, 181-195 (2018).
MSC:
68T20
Exploiting treewidth for projected model counting and its limits. (English) Zbl 1511.68195
Beyersdorff, Olaf (ed.) et al., 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. Cham: Springer. Lect. Notes Comput. Sci. 10929, 165-184 (2018).
From SAT to maximum independent set: a new approach to characterize tractable classes. (English) Zbl 1403.68073
Eiter, Thomas (ed.) et al., LPAR-21. 21st international conference on logic for programming, artificial intelligence and reasoning, Maun, Botswana, May 8–12, 2017. Selected papers. Manchester: EasyChair. EPiC Series in Computing 46, 286-299 (2017).
Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems. (English) Zbl 1423.68474
The connectivity of Boolean satisfiability: dichotomies for formulas and circuits. (English) Zbl 1378.68093
Total nondeterministic Turing machines and a p-optimal proof system for SAT. (English) Zbl 1489.68095
Kari, Jarkko (ed.) et al., Unveiling dynamics and complexity. 13th conference on computability in Europe, CiE 2017, Turku, Finland, June 12–16, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10307, 364-374 (2017).
The weight in enumeration. (English) Zbl 1485.68114
Drewes, Frank (ed.) et al., Language and automata theory and applications. 11th international conference, LATA 2017, Umeå, Sweden, March 6–9, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10168, 208-219 (2017).
The configurable SAT solver challenge (CSSC). (English) Zbl 1402.68161
MSC:
68T20
Constraint CNF: SAT and CSP language under one roof. (English) Zbl 1428.68284
Carro, Manuel (ed.) et al., Technical communications of the 32nd international conference on logic programming, ICLP 2016, October 16–21, 2016, New York, NY, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. OASIcs – OpenAccess Ser. Inform. 52, Article 12, 15 p. (2016).
The incremental satisfiability problem for a two conjunctive normal form. (English) Zbl 1401.68119
Arrazola-Ramírez, José Ramón (ed.) et al., Selected papers of the 10th Latin American workshop on logic/languages, algorithms and new methods of reasoning (LANMR), Puebla, Mexico, August 15, 2016. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 328, 31-45 (2016).
On satisfiability trees. (English) Zbl 1365.03014
MSC:
03B05
An experiment with satisfiability modulo SAT. (English) Zbl 1356.68208
MSC:
68T15
03B05
Backdoors to q-Horn. (English) Zbl 1336.68126
Theorem proving decomposition algorithm based on semi-extension rule. (Chinese. English summary) Zbl 1349.68208
MSC:
68T15
Approximate model counting via extension rule. (English) Zbl 1356.68109
Wang, Jianxin (ed.) et al., Frontiers in algorithmics. 9th international workshop, FAW 2015, Guilin, China, July 3–5, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-19646-6/pbk; 978-3-319-19647-3/ebook). Lecture Notes in Computer Science 9130, 229-240 (2015).
Complexity of propositional independence and inclusion logic. (English) Zbl 1465.68104
Italiano, F. (ed.) et al., Mathematical foundations of computer science 2015. 40th international symposium, MFCS 2015, Milan, Italy, August 24–28, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9234, 269-280 (2015).
A parametrized propositional dynamic logic with application to service synthesis. (English) Zbl 1385.03034
Goré, Rajeev (ed.) et al., Advances in modal logic. Vol. 10. Proceedings of the 10th conference (AiML 2014), Groningen, Netherlands, August 5–8, 2014. London: College Publications (ISBN 978-1-84890-151-3/pbk). 34-53 (2014).
A dynamic restart strategy for solving SAT problem. (Chinese. English summary) Zbl 1313.68196
MSC:
68T20
Normal form expressions of propositional projection temporal logic. (English) Zbl 1423.68278
Cai, Zhipeng (ed.) et al., Computing and combinatorics. 20th international conference, COCOON 2014, Atlanta, GA, USA, August 4–6, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8591, 84-93 (2014).
Backdoors to q-Horn. (English) Zbl 1354.68123
Portier, Natacha (ed.) et al., 30th international symposium on theoretical aspects of computer science, STACS’ 13, Kiel, Germany, February 27 – March 2, 2013. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-50-7). LIPIcs – Leibniz International Proceedings in Informatics 20, 67-79 (2013).
The problem of checking the satisfiability of formulae of decidable theories (survey). (Russian) Zbl 1324.03002
Reviewer: R. I. Manuilenko
Advanced SAT techniques for abstract argumentation. (English) Zbl 1401.68312
Leite, João (ed.) et al., Computational logic in multi-agent systems. 14th international workshop, CLIMA XIV, Corunna, Spain, September 16–18, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40623-2/pbk). Lecture Notes in Computer Science 8143. Lecture Notes in Artificial Intelligence, 138-154 (2013).
MSC:
68T27
Better algorithms for satisfiability problems for formulas of bounded rank-width. (English) Zbl 1280.68239
Generating event-sequence test cases by answer set programming with the incidence matrix. (English) Zbl 1281.68076
Dovier, Agostino (ed.) et al., Technical communications of the 28th international conference on logic programming (ICLP 2012), September 4–8, 2012, Budapest, Hungary. Papers based on the presentations at the conference. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-43-9). LIPIcs – Leibniz International Proceedings in Informatics 17, 86-97, electronic only (2012).
Producing and verifying extremely large propositional refutations. (English) Zbl 1273.68329
Reviewer: Nail Zamov (Kazan)
MSC:
68T15
Satisfiability: where theory meets practice (invited talk). (English) Zbl 1252.68156
Cégielski, Patrick (ed.) et al., Computer science logic (CSL’12). 26th international workshop, 21th annual conference of the EACSL, September 3–6, 2012, Fontainebleau, France. Selected papers based on the presentations at the conference. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-42-2). LIPIcs – Leibniz International Proceedings in Informatics 16, 12-13, electronic only (2012).
MSC:
68Q25
68T15
On \(\alpha \)-satisfiability and its \(\alpha \)-lock resolution in a finite lattice-valued propositional logic. (English) Zbl 1257.03036
Properties of SLUR formulae. (English) Zbl 1298.68110
Bieliková, Mária (ed.) et al., SOFSEM 2012: Theory and practice of computer science. 38th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 21–27, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-27659-0/pbk). Lecture Notes in Computer Science 7147, 177-189 (2012).
Towards NP-P via proof complexity and search. (English) Zbl 1257.03086
Reviewer: Olaf Beyersdorff (Leeds)
Technology for translating combinatorial problems into Boolean equations. (Russian. English summary) Zbl 1477.68188
Proposition algebra. (English) Zbl 1352.03040
Constraint satisfaction problems in clausal form. II: Minimal unsatisfiability and conflict structure. (English) Zbl 1242.68290
Constraint satisfaction problems in clausal form. I: Autarkies and deficiency. (English) Zbl 1242.68289
Structural and topological characterizations of maximally consistent theories in Łukasiewicz fuzzy propositional logic. (Chinese. English summary) Zbl 1240.03018
Enumerating all solutions of a Boolean CSP by non-decreasing weight. (English) Zbl 1330.68108
Sakallah, Karem A. (ed.) et al., Theory and applications of satisfiability testing – SAT 2011. 14th international conference, SAT 2011, Ann Arbor, MI, USA, June 19–22, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21580-3/pbk). Lecture Notes in Computer Science 6695, 120-133 (2011).
Better algorithms for satisfiability problems for formulas of bounded rank-width. (English) Zbl 1245.68108
Lodaya, Kamal (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2010), December 15–18, 2010, Chennai, India. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-23-1). LIPIcs – Leibniz International Proceedings in Informatics 8, 73-83, electronic only (2010).
A Boolean satisfiability approach to the resource-constrained project scheduling problem. (English) Zbl 1209.90170
MSC:
90B35
Solving satisfiability problems with preferences. (English) Zbl 1208.68199
MSC:
68T20
Boolean logics with relations. (English) Zbl 1206.03019
Reviewer: Bernhard Heinemann (Hagen)
Algorithms for propositional model counting. (English) Zbl 1214.05166
MSC:
05C85
The connectivity of Boolean satisfiability: computational and structural dichotomies. (English) Zbl 1201.03024
Reviewer: Gregory Loren McColm (Tampa)
Introduction to mathematics of satisfiability. (English) Zbl 1184.68001
Chapman & Hall/CRC Studies in Informatics Series. Boca Raton, FL: CRC Press (ISBN 978-1-4398-0167-3/hbk; 978-1-4398-0174-1/ebook). xiii, 350 p. (2009).
Reviewer: Catalin Stoean (Craiova)
Satisfaction and friendliness relations within classical logic: proof-theoretic approach. (English) Zbl 1236.03012
Bosch, Peter (ed.) et al., Logic, language, and computation. 7th international Tbilisi symposium on logic, language, and computation, TbiLLC 2007, Tbilisi, Georgia, October 1–5, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-642-00664-7/pbk). Lecture Notes in Computer Science 5422. Lecture Notes in Artificial Intelligence, 180-192 (2009).
An inductive proof for characterizations of maximal consistent theories over the system \(\mathcal{L}^*\). (Chinese. English summary) Zbl 1199.03023
Resolution trees with lemmas: resolution refinements that characterize DLL algorithms with clause learning. (English) Zbl 1159.03009
A note on an extension of PDL. (English) Zbl 1156.03033
The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study. (English) Zbl 1162.68655
MSC:
68T20
How many conflicts does it need to be unsatisfiable? (English) Zbl 1138.68553
Kleine Büning, Hans (ed.) et al., Theory and applications of satisfiability testing – SAT 2008. 11th international conference, SAT 2008, Guangzhou, China, May 12–15, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79718-0/pbk). Lecture Notes in Computer Science 4996, 246-256 (2008).
A CNF class generalizing exact linear formulas. (English) Zbl 1138.68550
Kleine Büning, Hans (ed.) et al., Theory and applications of satisfiability testing – SAT 2008. 11th international conference, SAT 2008, Guangzhou, China, May 12–15, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79718-0/pbk). Lecture Notes in Computer Science 4996, 231-245 (2008).
Weighting strategy for non-clausal resolution. (English) Zbl 1146.68452
MSC:
68T15
68T20
Filter Results by …
Document Type
- Journal Articles (187)
- Collection Articles (85)
- Books (7)
all
top 5
Author
- Kleine Büning, Hans (6)
- Szeider, Stefan (6)
- Gu, Jun (5)
- Hirsch, Edward A. (5)
- Kullmann, Oliver (5)
- Marques-Silva, João P. (5)
- Porschen, Stefan (5)
- Van Gelder, Allen (5)
- Buss, Samuel R. (4)
- Chlebus, Bogdan Stanislaw (4)
- Franco, John V. (4)
- Hooker, John N. jun. (4)
- Kolany, Adam (4)
- Lynce, Inês (4)
- Speckenmeyer, Ewald (4)
- Arvind, Vikraman (3)
- Dantsin, Evgeny (3)
- Fichte, Johannes Klaus (3)
- Giunchiglia, Enrico (3)
- Hemaspaandra, Edith (3)
- Junttila, Tommi A. (3)
- Kautz, Henry A. (3)
- Lettmann, Theodor (3)
- Mahmood, Yasir (3)
- Niemelä, Ilkka N. F. (3)
- Rosenthal, John W. (3)
- Saïs, Lakhdar (3)
- Sebastiani, Roberto (3)
- Selman, Bart (3)
- Virtema, Jonni (3)
- Vollmer, Heribert (3)
- Woltran, Stefan (3)
- Xu, Yang (3)
- Zhang, Hantao (3)
- Zhou, Hongjun (3)
- Bonet, Maria Luisa (2)
- Crato, Nuno (2)
- Creignou, Nadia (2)
- Danecki, Ryszard (2)
- Dechter, Rina (2)
- Demri, Stéphane P. (2)
- Ganian, Robert (2)
- Gaspers, Serge (2)
- Gent, Ian Philip (2)
- Goerdt, Andreas (2)
- Gomes, Carla P. (2)
- Hannula, Miika (2)
- Heule, Marijn J. H. (2)
- Hliněný, Petr (2)
- Hoos, Holger H. (2)
- Horrocks, Ian (2)
- Hutter, Frank (2)
- Immerman, Neil (2)
- Jabbour, Said (2)
- Järvisalo, Matti (2)
- Konev, Boris (2)
- Kontinen, Juha (2)
- Lagniez, Jean-Marie (2)
- Leyton-Brown, Kevin (2)
- Liberatore, Paolo (2)
- Lierler, Yuliya (2)
- Lozinskii, Eliezer L. (2)
- Marek, V. Wiktor (2)
- Marquis, Pierre (2)
- Meier, Arne (2)
- Miguel, Ian (2)
- Nightingale, Peter W. (2)
- Obdržálek, Jan (2)
- Ognjanović, Zoran (2)
- Ordyniak, Sebastian (2)
- Papadimitriou, Christos Harilaos (2)
- Patel-Schneider, Peter F. (2)
- Pratt, Vaughan R. (2)
- Pretolani, Daniele (2)
- Purdom, Paul Walton jun. (2)
- Ramanujan, M. S. (2)
- Randerath, Bert (2)
- Rašković, Miodrag D. (2)
- Riis, Søren (2)
- Rish, Irina (2)
- Saurabh, Saket (2)
- Shilov, Nikolay V. (2)
- Streett, Robert S. (2)
- Truszczyński, Mirosław (2)
- Vlada, Marin (2)
- Wah, Benjamin W.-S. (2)
- Wang, Guojun (2)
- Wang, Jinyan (2)
- Wu, Jingli (2)
- Yin, Minghao (2)
- Zhao, Xishun (2)
- Aguzzoli, Stefano (1)
- Akgün, Özgür (1)
- Alekhnovich, Michael (1)
- Allender, Eric W. (1)
- Almaawi, Alyas (1)
- Anjos, Miguel F. (1)
- Atserias, Albert (1)
- Ausiello, Giorgio (1)
- Bach, Jakob (1)
- and 313 more Authors
all
top 5
Serial
- Ann. Math. Artif. Intell. (17)
- J. Autom. Reasoning (13)
- Artif. Intell. (12)
- Discrete Appl. Math. (10)
- Inf. Process. Lett. (9)
- Theor. Comput. Sci. (6)
- Fundam. Inform. (5)
- ACM Trans. Comput. Log. (5)
- J. Log. Program. (4)
- J. Comput. Syst. Sci. (3)
- SIAM J. Comput. (3)
- Stud. Log. (3)
- Inf. Comput. (3)
- J. Log. Comput. (3)
- J. Math. Sci., New York (3)
- Constraints (3)
- Log. J. IGPL (3)
- Theory Pract. Log. Program. (3)
- Log. Methods Comput. Sci. (3)
- Inf. Control (2)
- Bull. Sect. Log., Univ. Łódź, Dep. Log. (2)
- Ann. Pure Appl. Logic (2)
- J. Comput. Sci. Technol. (2)
- Algorithmica (2)
- Sci. China, Ser. A (2)
- Ann. Oper. Res. (2)
- J. Exp. Theor. Artif. Intell. (2)
- Theory Comput. Syst. (2)
- Theor. Inform. Appl. (2)
- J. Shaanxi Norm. Univ., Nat. Sci. Ed. (2)
- J. Softw. (2)
- J. Discrete Algorithms (2)
- J. Satisf. Boolean Model. Comput. (2)
- Comput. Linguist. Comput. Lang. (1)
- Computing (1)
- Fuzzy Sets Syst. (1)
- J. Assoc. Comput. Mach. (1)
- J. Math. Psychol. (1)
- Math. Comput. Simul. (1)
- Math. Syst. Theory (1)
- Notre Dame J. Formal Logic (1)
- Program. Comput. Softw. (1)
- Publ. Inst. Math., Nouv. Sér. (1)
- Rep. Math. Logic (1)
- Sov. Math., Dokl. (1)
- Synthese (1)
- J. Algorithms (1)
- Comput. Artif. Intell. (1)
- Parallel Comput. (1)
- J. Symb. Comput. (1)
- Comput. Oper. Res. (1)
- Int. J. Intell. Syst. (1)
- J. Southwest Jiaotong Univ. (1)
- Formal Asp. Comput. (1)
- Random Struct. Algorithms (1)
- Artif. Intell. Rev. (1)
- ORSA J. Comput. (1)
- Elektron. Informationsverarbeitung Kybernetik (1)
- Eur. J. Oper. Res. (1)
- Int. J. Comput. Math. (1)
- RAIRO, Inform. Théor. Appl. (1)
- Comput. Complexity (1)
- J. Logic Lang. Inf. (1)
- J. Appl. Non-Class. Log. (1)
- J. Fuzzy Math. (1)
- Electron. J. Comb. (1)
- J. Artif. Intell. Res. (JAIR) (1)
- Sci. China, Ser. E (1)
- Soft Comput. (1)
- J. Comb. Optim. (1)
- Int. J. Appl. Math. (1)
- Jt. Bull. NCC IIS, Ser. Comput. Sci. (1)
- Tr. Inst. Prikl. Mat. Mekh. (1)
- J. Log. Algebr. Program. (1)
- J. Northeast. Univ., Nat. Sci. (1)
- J. Appl. Log. (1)
- Int. J. Comput. Intell. Appl. (1)
- Appl. Comput. Sci., Ber. Prakt. Inf. (1)
- Camb. Tracts Theor. Comput. Sci. (1)
- Lect. Notes Comput. Sci. (1)
- Malays. J. Math. Sci. (1)
- Izv. Irkutsk. Gos. Univ., Ser. Mat. (1)
- Prikl. Diskretn. Mat. (1)
all
top 5
Year of Publication
- 2024 (1)
- 2023 (6)
- 2022 (5)
- 2021 (3)
- 2020 (6)
- 2019 (4)
- 2018 (5)
- 2017 (9)
- 2016 (7)
- 2015 (6)
- 2014 (6)
- 2013 (4)
- 2012 (8)
- 2011 (6)
- 2010 (8)
- 2009 (7)
- 2008 (10)
- 2007 (6)
- 2006 (8)
- 2005 (13)
- 2004 (7)
- 2003 (5)
- 2002 (11)
- 2001 (6)
- 2000 (15)
- 1999 (12)
- 1998 (4)
- 1997 (10)
- 1996 (10)
- 1995 (6)
- 1994 (5)
- 1993 (10)
- 1992 (10)
- 1991 (2)
- 1990 (4)
- 1989 (4)
- 1988 (2)
- 1987 (6)
- 1986 (3)
- 1985 (4)
- 1984 (3)
- 1983 (1)
- 1982 (3)
- 1981 (1)
- 1980 (3)
- 1979 (4)
all
top 3
Software
- Chaff (26)
- MiniSat (20)
- Walksat (13)
- SATO (10)
- BerkMin (6)
- Lingeling (6)
- Glucose (5)
- Plingeling (5)
- DIMACS (4)
- Leibniz (4)
- Treengeling (4)
- sharpSAT (4)
- CPLEX (3)
- DRAT-trim (3)
- Graphplan (3)
- PBS (3)
- PSATO (3)
- Potassco (3)
- SATIRE (3)
- SATzilla (3)
- Sugar (3)
- Zchaff2004 (3)
- AMPL (2)
- ASSAT (2)
- Cmodels (2)
- Coprocessor (2)
- CryptoMiniSat (2)
- Gecode (2)
- Gurobi (2)
- Ltur (2)
- ManySAT (2)
- Runsolver (2)
- SAT competition (2)
- SMAC (2)
- SMT-LIB (2)
- SaDiCaL (2)
- Smodels (2)
- Velev SAT Benchmarks (2)
- nauty (2)
- z3 (2)
- AIGER (1)
- Auto-WEKA (1)
- Azucar (1)
- BEE (1)
- BG-WalkSAT (1)
- BIRD2 (1)
- Boolector (1)
- CBMC (1)
- CDCLSym (1)
- COMET (1)
- CP-nets (1)
- CPCES (1)
- CSPLib (1)
- CUD@SAT (1)
- CUDA (1)
- CVC (1)
- CVC Lite (1)
- CVC4 (1)
- CaDiCaL (1)
- Cadmium (1)
- Cassowary (1)
- Clingcon (1)
- Clingo (1)
- Concorde (1)
- CsegGraph (1)
- DOC-BRelax (1)
- DepQBF (1)
- E Theorem Prover (1)
- ESRA (1)
- EVC (1)
- Essence (1)
- FINDER (1)
- FRODO__2 (1)
- FaCT++ (1)
- GANAK (1)
- Genocop (1)
- GidL (1)
- GitHub (1)
- GridSAT (1)
- Gringo (1)
- HeerHugo (1)
- HordeSat (1)
- ICS (1)
- IDP (1)
- KLEE (1)
- Kissat (1)
- Kodkod (1)
- Korat (1)
- LKH (1)
- LMHS (1)
- LOQO (1)
- Lparse (1)
- MAX-2-SAT (1)
- MINION (1)
- MINOS (1)
- MIPLIB (1)
- MUSer2 (1)
- MathSAT (1)
- MaxHS (1)
- MaxSolver (1)
- and 63 more Software Packages
