• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 266 matches

• 2025
• 
  Yong Lai, Zhenghang Xu, Minghao Yin:
  PBCounter: weighted model counting on pseudo-boolean formulas. Frontiers Comput. Sci. 19(3): 193402 (2025)
• 
  Serdar Kadioglu, Elton Yechao Zhu, Gili Rosenberg, John Kyle Brubaker, Martin J. A. Schuetz, Grant Salton, Zhihuai Zhu, Helmut G. Katzgraber:
  BoolXAI: Explainable AI Using Expressive Boolean Formulas. AAAI 2025: 28900-28906
• 
  Andreas Plank, Martina Seidl, Manuel Kauers:
  Solution Counts of Some Prominent Quantified Boolean Formulas Families. SAC 2025: 1035-1042
• 
  Marcel Simader, Adrian Rebola-Pardo, Martina Seidl:
  FERAT: A New Expansion-Based Certification Framework for Quantified Boolean Formulas. SAC 2025: 1043-1050
• 2024
• 
  Wenjing Chang, Mengyu Guo, Junwei Luo:
  Predicting the satisfiability of Boolean formulas by incorporating gated recurrent unit (GRU) in the Transformer framework. PeerJ Comput. Sci. 10: e2169 (2024)
• 
  Mark Peyrer, Maximilian Heisinger, Martina Seidl:
  PyQBF: A Python Framework for Solving Quantified Boolean Formulas. IFM 2024: 279-287
• 
  Florent Capelli, Jean-Marie Lagniez, Andreas Plank, Martina Seidl:
  A Top-Down Tree Model Counter for Quantified Boolean Formulas. IJCAI 2024: 1853-1861
• 
  Leif Eriksson, Victor Lagerkvist, Sebastian Ordyniak, George Osipov, Fahad Panolan, Mateusz Rychlicki:
  Solving Quantified Boolean Formulas with Few Existential Variables. IJCAI 2024: 1889-1897
• 
  Simone Heisinger, Maximilian Heisinger, Adrian Rebola-Pardo, Martina Seidl:
  Quantifier Shifting for Quantified Boolean Formulas Revisited. IJCAR (1) 2024: 325-343
• 
  Martina Seidl:
  Models and Counter-Models of Quantified Boolean Formulas (Invited Talk). SAT 2024: 1:1-1:7
• 
  Leif Eriksson, Victor Lagerkvist, George Osipov, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki:
  Solving Quantified Boolean Formulas with Few Existential Variables. CoRR abs/2405.06485 (2024)
• 
  Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
  Globally Interpretable Classifiers via Boolean Formulas with Dynamic Propositions. CoRR abs/2406.01114 (2024)
• 
  Clemens Hofstadler, Manuel Kauers, Martina Seidl:
  Symmetries of Dependency Quantified Boolean Formulas. CoRR abs/2410.15848 (2024)
• 2023
• 
  Evgeny Dantsin, Alexander Wolpert:
  An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF. J. Satisf. Boolean Model. Comput. 14(1): 1-15 (2023)
• 
  Gili Rosenberg, John Kyle Brubaker, Martin J. A. Schuetz, Grant Salton, Zhihuai Zhu, Elton Yechao Zhu, Serdar Kadioglu, Sima E. Borujeni, Helmut G. Katzgraber:
  Explainable Artificial Intelligence Using Expressive Boolean Formulas. Mach. Learn. Knowl. Extr. 5(4): 1760-1795 (2023)
• 
  Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy:
  On the Density of States of Boolean Formulas. CCIA 2023: 369-382
• 
  Andreas Plank, Sibylle Möhle, Martina Seidl:
  Enumerative Level-2 Solution Counting for Quantified Boolean Formulas (Short Paper). CP 2023: 49:1-49:10
• 
  Albert Guan:
  Secure Outsourcing of Boolean Formulas Truth Assignment Problem. DSC 2023: 1-5
• 
  Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
  Short Boolean Formulas as Explanations in Practice. JELIA 2023: 90-105
• 
  Marco A. López Medina, José Raymundo Marcial-Romero, José Antonio Hernández Servín, Sandra Morales-Hernández:
  A Method for Counting Models on Cubic Boolean Formulas. MCPR 2023: 69-78
• 
  Andreas Plank, Martina Seidl:
  QMusExt: A Minimal (Un)satisfiable Core Extractor for Quantified Boolean Formulas. SAT 2023: 20:1-20:10
• 
  Oliver Kullmann, Ankit Shukla:
  Transforming Quantified Boolean Formulas Using Biclique Covers. TACAS (2) 2023: 372-390
• 
  Gili Rosenberg, John Kyle Brubaker, Martin J. A. Schuetz, Grant Salton, Zhihuai Zhu, Elton Yechao Zhu, Serdar Kadioglu, Sima E. Borujeni, Helmut G. Katzgraber:
  Explainable AI using expressive Boolean formulas. CoRR abs/2306.03976 (2023)
• 
  Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
  Short Boolean Formulas as Explanations in Practice. CoRR abs/2307.06971 (2023)
• 
  Yong Lai, Zhenghang Xu, Minghao Yin:
  PBCounter: Weighted Model Counting on Pseudo-Boolean Formulas. CoRR abs/2312.15877 (2023)
• 2022
• 
  Marco A. López Medina, José Raymundo Marcial-Romero, Guillermo De Ita Luna, José Antonio Hernández Servín:
  A method for counting models on grid Boolean formulas. J. Intell. Fuzzy Syst. 42(5): 4719-4726 (2022)
• 
  Yongjie Xu, Fu Song, Taolue Chen:
  ESampler: Boosting sampling of satisfying assignments for Boolean formulas via derivation. J. Syst. Archit. 129: 102615 (2022)
• 
  Aile Ge-Ernst, Christoph Scholl, Juraj Síc, Ralf Wimmer:
  Solving dependency quantified Boolean formulas using quantifier localization. Theor. Comput. Sci. 925: 1-24 (2022)
• 
  Arnab Chatterjee, R. C. Hansdah:
  Deploying Transactional Smart Contracts using Multisignature Boolean Formulas. ICDCN 2022: 170-174
• 
  Andreas Niskanen, Jere Mustonen, Jeremias Berg, Matti Järvisalo:
  Computing Smallest MUSes of Quantified Boolean Formulas. LPNMR 2022: 301-314

skipping 236 more matches