| Publication | Date of Publication | Type |
|---|
Invariant neural architecture for learning term synthesis in instantiation proving
Journal of Symbolic Computation | 2024-12-09 | Paper |
| Solving hard Mizar problems with instantiation and strategy invention | 2024-12-04 | Paper |
| Towards learning quantifier instantiation in SMT | 2024-07-12 | Paper |
| SAT-based leximax optimisation algorithms | 2024-07-12 | Paper |
Computing generating sets of minimal size in finite algebras
Journal of Symbolic Computation | 2023-06-29 | Paper |
Targeted configuration of an SMT solver
Lecture Notes in Computer Science | 2023-06-02 | Paper |
| Guiding an automated theorem prover with neural rewriting | 2022-12-07 | Paper |
On exponential lower bounds for partially ordered resolution
Journal on Satisfiability, Boolean Modeling and Computation | 2021-12-09 | Paper |
MiFuMax -- a literate MaxSAT solver. System description
Journal on Satisfiability, Boolean Modeling and Computation | 2021-12-09 | Paper |
| SAT-based encodings for optimal decision trees with explicit paths | 2021-04-07 | Paper |
New resolution-based QBF calculi and their proof complexity
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
Towards Smarter MACE-style Model Finders
EPiC Series in Computing | 2019-07-04 | Paper |
| Circuit-based search space pruning in QBF | 2018-08-10 | Paper |
Minimal sets on propositional formulae. Problems and reductions
Artificial Intelligence | 2017-11-21 | Paper |
Algorithms for computing backbones of propositional formulae
AI Communications | 2017-11-07 | Paper |
| Proof complexity of resolution-based QBF calculi | 2017-01-24 | Paper |
On Q-resolution and CDCL QBF solving
Theory and Applications of Satisfiability Testing – SAT 2016 | 2016-09-05 | Paper |
Quantified maximum satisfiability
Constraints | 2016-04-20 | Paper |
Solving QBF with counterexample guided refinement
Artificial Intelligence | 2016-03-08 | Paper |
On the query complexity of selecting minimal sets for monotone predicates
Artificial Intelligence | 2016-03-08 | Paper |
PackUp: tools for package upgradability solving
Journal of Satisfiability, Boolean Modeling and Computation | 2016-02-23 | Paper |
Exploiting resolution-based representations for MaxSAT solving
Lecture Notes in Computer Science | 2015-11-20 | Paper |
Expansion-based QBF solving versus Q-resolution
Theoretical Computer Science | 2015-04-01 | Paper |
On Unification of QBF Resolution-Based Calculi
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Algorithms for computing minimal equivalent subformulas
Artificial Intelligence | 2014-10-13 | Paper |
On QBF Proofs and Preprocessing
Logic for Programming, Artificial Intelligence, and Reasoning | 2014-01-17 | Paper |
Solving QBF with counterexample guided refinement
Theory and Applications of Satisfiability Testing – SAT 2012 | 2013-08-12 | Paper |
On propositional QBF expansions and Q-resolution
Theory and Applications of Satisfiability Testing – SAT 2013 | 2013-08-05 | Paper |
Quantified maximum satisfiability: a core-guided approach
Theory and Applications of Satisfiability Testing – SAT 2013 | 2013-08-05 | Paper |
Abstraction-based algorithm for 2QBF
Theory and Applications of Satisfiability Testing - SAT 2011 | 2011-06-17 | Paper |
| On computing backbones of propositional theories | 2011-05-11 | Paper |
Counterexample guided abstraction refinement algorithm for propositional circumscription
Logics in Artificial Intelligence | 2010-10-01 | Paper |
