#### Filter Results:

- Full text PDF available (56)

#### Publication Year

1946

2017

- This year (4)
- Last 5 years (40)
- Last 10 years (58)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Mikolás Janota, William Klieber, Joao Marques-Silva, Edmund M. Clarke
- Artif. Intell.
- 2012

We propose two novel approaches for using CounterexampleGuided Abstraction Refinement (CEGAR) in Quantified Boolean Formula (QBF) solvers. The first approach develops a recursive algorithm whose search is driven by CEGAR (rather than by DPLL). The second approach employs CEGAR as an additional learning technique in an existing DPLL-based QBF solver.… (More)

A set of constraints that cannot be simultaneously satisfied is over-constrained. Minimal relaxations and minimal explanations for over-constrained problems find many practical uses. For Boolean formulas, minimal relaxations of over-constrained problems are referred to as Minimal Correction Subsets (MCSes). MCSes find many applications, including the… (More)

- Mikolás Janota, Joao Marques-Silva
- Theor. Comput. Sci.
- 2015

This article introduces and studies a proof system ∀Exp+Res that enables us to refute quantified Boolean formulas (QBFs). The system ∀Exp+Res operates in two stages: it expands all universal variables through conjunctions and refutes the result by propositional resolution. This approach contrasts with the Q-resolution calculus, which enables refuting QBFs… (More)

- Mikolás Janota, Joao Marques-Silva
- SAT
- 2013

Over the years, proof systems for propositional satisfiability (SAT) have been extensively studied. Recently, proof systems for quantified Boolean formulas (QBFs) have also been gaining attention. Q-resolution is a calculus enabling producing proofs from DPLL-based QBF solvers. While DPLL has become a dominating technique for SAT, QBF has been tackled by… (More)

- Goetz Botterweck, Mikolás Janota, Denny Schneeweiss
- VaMoS
- 2009

Our feature configuration tool ST 2 Configurator integrates (1) a visual interactive representation of the feature model and (2) a formal reasoning engine that calculates consequences of the user’s actions and provides formal explanations. The tool’s software architecture is designed as a chain of components, which provide mappings between visual elements… (More)

- Joao Marques-Silva, Mikolás Janota, Inês Lynce
- ECAI
- 2010

Backbones of propositional theories are literals that are true in every model. Backbones have been used for characterizing the hardness of decision and optimization problems. Moreover, backbones find other applications. For example, backbones are often identified during product configuration. Backbones can also improve the efficiency of solving… (More)

- Mikolás Janota, Victoria Kuzina, Andrzej Wasowski
- MoDELS
- 2008

Mainstream development environments have recently assimilated guidance technologies based on constraint satisfaction. We investigate one class of such technologies, namely, interactive guided derivation of models, where the editing system assists a designer by providing hints about valid editing operations that maintain global correctness. We provide a… (More)

- Mikolás Janota, Joseph Kiniry
- 11th International Software Product Line…
- 2007

A mechanically formalized feature modeling meta-model is presented. This theory is a generic higher-order formalization of a mathematical model synthesizing several feature modeling approaches found in the literature. This meta-model supports not only a better understanding of the various approaches to feature modeling, but also supports reasoning about and… (More)

- Olaf Beyersdorff, Leroy Chew, Mikolás Janota
- STACS
- 2014

Proof systems for quantified Boolean formulas (QBFs) provide a theoretical underpinning for the performance of important QBF solvers. However, the proof complexity of these proof systems is currently not well understood and in particular lower bound techniques are missing. In this paper we exhibit a new and elegant proof technique for showing lower bounds… (More)

- Mikolás Janota, Leroy Chew, Olaf Beyersdorff
- Electronic Colloquium on Computational Complexity
- 2014

Several calculi for quantified Boolean formulas (QBFs) exist, but relations between them are not yet fully understood. This paper defines a novel calculus, which is resolutionbased and enables unification of the principal existing resolution-based QBF calculi, namely Q-resolution, long-distance Q-resolution and the expansion-based calculus ∀Exp+Res. All… (More)