Skip to main navigation
Skip to search
Skip to main content
Utrecht University Home
Help & FAQ
Link opens in a new tab
Search content at Utrecht University
Home
People
Research units
Research output
Activities
In the media
Prizes & Grants
General Boolean Formula Minimization with QBF Solvers
Eduardo Calò
, Jordi Levy
Sub Natural Language Processing
Research output
:
Working paper
›
Preprint
›
Academic
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'General Boolean Formula Minimization with QBF Solvers'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Quantified Boolean Formulas
100%
Boolean Formulas
100%
Connectives
25%
Sigma-2
25%
Brute Force
25%
Disjunctive Normal Form
25%
Minimization Algorithm
25%
SAT Solver
25%
Quine
25%
Propositional Formula
25%
Hardware Design
25%
Natural Language Translation
25%
Variable Assignment
25%
Equivalent Equation
25%
Karnaugh
25%
Conjunctive Normal Form
25%
Minimal Equation
25%
Computer Science
Boolean Formula
100%
Classical Problem
20%
Disjunctive Normal Form
20%
Propositional Formula
20%
Hardware Design
20%
Conjunctive Normal Form
20%
Equivalence Checking
20%
Variable Assignment
20%