Mikoláš Janota

Available identifiers

zbMath Open janota.mikolasWikidataQ102369905 ScholiaQ102369905MaRDI QIDQ253961

List of research outcomes

Publication	Date of Publication	Type
Invariant neural architecture for learning term synthesis in instantiation proving	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	2023-06-29	Paper
Targeted configuration of an SMT solver	2023-06-02	Paper
Guiding an automated theorem prover with neural rewriting	2022-12-07	Paper
On exponential lower bounds for partially ordered resolution	2021-12-09	Paper
MiFuMax -- a literate MaxSAT solver. System description	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	2019-12-16	Paper
Towards Smarter MACE-style Model Finders	2019-07-04	Paper
Circuit-based search space pruning in QBF	2018-08-10	Paper
Minimal sets on propositional formulae. Problems and reductions	2017-11-21	Paper
Algorithms for computing backbones of propositional formulae	2017-11-07	Paper
Proof complexity of resolution-based QBF calculi	2017-01-24	Paper
On Q-resolution and CDCL QBF solving	2016-09-05	Paper
Quantified maximum satisfiability	2016-04-20	Paper
Solving QBF with counterexample guided refinement	2016-03-08	Paper
On the query complexity of selecting minimal sets for monotone predicates	2016-03-08	Paper
PackUp: tools for package upgradability solving	2016-02-23	Paper
Exploiting resolution-based representations for MaxSAT solving	2015-11-20	Paper
Expansion-based QBF solving versus Q-resolution	2015-04-01	Paper
On Unification of QBF Resolution-Based Calculi	2014-10-14	Paper
Algorithms for computing minimal equivalent subformulas	2014-10-13	Paper
On QBF Proofs and Preprocessing	2014-01-17	Paper
Solving QBF with counterexample guided refinement	2013-08-12	Paper
On propositional QBF expansions and Q-resolution	2013-08-05	Paper
Quantified maximum satisfiability: a core-guided approach	2013-08-05	Paper
Abstraction-based algorithm for 2QBF	2011-06-17	Paper
On computing backbones of propositional theories	2011-05-11	Paper
Counterexample guided abstraction refinement algorithm for propositional circumscription	2010-10-01	Paper

Research outcomes over time

This page was built for person: Mikoláš Janota