Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
quantifier alternation
Description:
Quantifier alternation is the pattern of switching between existential and universal quantifiers in a logical formula or related formal expression.
Related topics:
Formal Methods in Verification (13%),
semigroups and automata theory (13%),
Advanced Topology and Set Theory (13%),
Logic, programming, and type systems (11%),
Advanced Graph Theory Research (8%),
Computability, Logic, AI Algorithms (7%)
show all 6
OpenAlex ID:
keywords/quantifier-alternation
Alternation
1981
·
Ashok K. Chandra
, Dexter C. Kozen
, et al.
·
Journal of the ACM
·
1,812
PDF
Efficient Testing of Large Graphs
2000
·
Noga Alon
, Eldar Fischer
, et al.
·
COMBINATORICA
·
396
What’s Decidable About Arrays?
2005
·
Aaron R. Bradley
, Zohar Manna
, et al.
·
Lecture notes in computer science
·
357
Complexity of deciding Tarski algebra
1988
·
D. Yu Grigor'ev
·
Journal of Symbolic Computation
·
227
PDF
Unification under a mixed prefix
1992
·
Dale Miller
·
Journal of Symbolic Computation
·
189
PDF
Finding Loop Invariants for Programs over Arrays Using a Theorem Prover
2009
·
Laura Kovács
, Andrei Voronkov
·
Lecture notes in computer science
·
165
The complexity of quantifier elimination and cylindrical algebraic decomposition
2007
·
Christopher W. Brown
, James H. Davenport
·
International Symposium on Symbolic and Algebraic Computation
·
163
Over words, two variables are as powerful as one quantifier alternation
1998
·
Denis Thérien
, Thomas Wilke
·
ACM Symposium on Theory of Computing (STOC)
·
149
PDF
Paxos made EPR: decidable reasoning about distributed protocols
2017
·
Oded Padon
, Giuliano Losa
, et al.
·
Proceedings of the ACM on Programming Languages
·
143
PDF
Complexity of quantifier elimination in the theory of algebraically closed fields
2006
·
A. L. Chistov
, D. Yu. Grigor'ev
·
Springer eBooks
·
135
Word Equations with Length Constraints: What’s Decidable?
2013
·
Vijay Ganesh
, Mia Minnes
, et al.
·
Lecture notes in computer science
·
103
Logical specifications of infinite computations
1994
·
Wolfgang Thomas
, Helmut Lescow
·
Lecture notes in computer science
·
101
Backdoor Sets of Quantified Boolean Formulas
2008
·
Marko Samer
, Stefan Szeider
·
Journal of Automated Reasoning
·
100
The Pebbling Problem is Complete in Polynomial Space
1980
·
John R. Gilbert
, Thomas Lengauer
, et al.
·
SIAM Journal on Computing
·
93
Verifying Hyperliveness
2019
·
Norine Coenen
, Bernd Finkbeiner
, et al.
·
Lecture notes in computer science
·
92
PDF
Presburger arithmetic with bounded quantifier alternation
1978
·
C. R. Reddy
, D. W. Loveland
·
ACM Symposium on Theory of Computing (STOC)
·
90
Efficient testing of large graphs
2003
·
N. Alon
, M. Krivelevich
, et al.
·
Annual Symposium on Foundations of Computer Science
·
87
Asymptotically optimal encodings of conformant planning in QBF
2007
·
Jussi Rintanen
·
ANU Open Research (Australian National University)
·
77
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
2005
·
Viktor Kuncak
, Huu Hai Nguyen
, et al.
·
Lecture notes in computer science
·
75
A Logic-Based Framework for Verifying Consensus Algorithms
2014
·
Cezara Drăgoi
, Thomas A. Henzinger
, et al.
·
Lecture notes in computer science
·
72
Theory of models with generalized atomic formulas
1960
·
H. Jerome Keisler
·
Journal of Symbolic Logic
·
71
Monitoring Hyperproperties by Combining Static Analysis and Runtime Verification
2018
·
Borzoo Bonakdarpour
, Cesar Sanchez
, et al.
·
Lecture notes in computer science
·
66
Über die Erfüllbarkeit derjenigen Zählausdrücke, welche in der Normalform zwei benachbarte Allzeichen enthalten
1933
·
László Kalmár
·
Mathematische Annalen
·
66
The Complexity of Monitoring Hyperproperties
2018
·
Borzoo Bonakdarpour
, Bernd Finkbeiner
·
IEEE Computer Security Foundations Workshop (CSFW)
·
63
PDF
Subclasses of presburger arithmetic and the weak EXP hierarchy
2014
·
Christoph Haase
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
58
PDF
Show more works
View as search
Works count:
368
Citation count:
7,331
Year
Topic
Type