Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,319 papers from all fields of science
Search
Sign In
Create Free Account
True quantified Boolean formula
Known as:
QSAT
, Quantified boolean formula
, Quantified boolean formula problem
Expand
In computational complexity theory, the language TQBF is a formal language consisting of the true quantified Boolean formulas. A (fully) quantified…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
29 relations
2-satisfiability
Abstract syntax tree
Alternating Turing machine
Boolean satisfiability problem
Expand
Broader (1)
Boolean algebra
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Synthesis of a simple self-stabilizing system
Adrià Gascón
,
A. Tiwari
SYNT
2014
Corpus ID: 10142623
With the increasing importance of distributed systems as a computing paradigm, a systematic approach to their design is needed…
Expand
2009
2009
QmiraXT - A Multithreaded QBF Solver
Matthew D. T. Lewis
,
Tobias Schubert
,
B. Becker
Methoden und Beschreibungssprachen zur…
2009
Corpus ID: 2740155
This paper introduces the state-of-the-art multithreaded QBF solver QMiraXT. QMiraXT is the first parallel QBF Solver that…
Expand
2008
2008
Response of the Strickland and Fly River confluence to postglacial sea level rise
J. Lauer
,
G. Parker
,
W. Dietrich
2008
Corpus ID: 55306432
[1] The sand bed portion of the Fly River system in Papua New Guinea was influenced significantly by postglacial sea level rise…
Expand
2008
2008
A New Quantum Evolutionary Local Search Algorithm for MAX 3-SAT Problem
Abdesslem Layeb
,
Djamel-Eddine Saïdouni
Hybrid Artificial Intelligence Systems
2008
Corpus ID: 42512918
The Max Sat problem is very known problem in computer science. It aims to find the best assignment for a set of Boolean variables…
Expand
2006
2006
Dependency Quantified Horn Formulas: Models and Complexity
Uwe Bubeck
,
H. K. Büning
International Conference on Theory and…
2006
Corpus ID: 17736842
Dependency quantified Boolean formulas (DQBF) extend quantified Boolean formulas with Henkin-style partially ordered quantifiers…
Expand
2005
2005
CSP Properties for Quantified Constraints: Definitions and Complexity
L. Bordeaux
,
Marco Cadoli
,
Toni Mancini
AAAI Conference on Artificial Intelligence
2005
Corpus ID: 13617693
Quantified constraints and Quantified Boolean Formulae are typically much more difficult to reason with than classical…
Expand
2004
2004
On Computing Belief Change Operations using Quantified Boolean Formulas
J. Delgrande
,
Torsten Schaub
,
H. Tompits
,
S. Woltran
Journal of Logic and Computation
2004
Corpus ID: 8258972
In this paper, we show how an approach to belief revision and belief contraction can be axiomatized by means of quantified…
Expand
2004
2004
Monotone Literals and Learning in QBF Reasoning
E. Giunchiglia
,
Massimo Narizzano
,
A. Tacchella
International Conference on Principles and…
2004
Corpus ID: 2325646
Monotone literal fixing (MLF) and learning are well-known lookahead and lookback mechanisms in propositional satisfiability (SAT…
Expand
2003
2003
On Boolean Models for Quantified Boolean Horn Formulas
H. K. Büning
,
K. Subramani
,
Xishun Zhao
International Conference on Theory and…
2003
Corpus ID: 32094146
For a Quantified Boolean Formula \(({\it QBF })\) Φ=Qφ, an assignment is a function \(\cal M\) that maps each existentially…
Expand
2001
2001
An Analysis of Backjumping and Trivial Truth in Quantified Boolean Formulas Satisfiability
E. Giunchiglia
,
Massimo Narizzano
,
A. Tacchella
International Conference of the Italian…
2001
Corpus ID: 12503882
Trivial truth and backjumping are two optimization techniques that have been proposed for deciding quantified boolean formulas…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE