BibSLEIGH — quantifier tag

quantifier

quantifier

Tag #quantifier

273 papers:

KDD-2019-WangLYLLZ0 #approach #machine learning #nondeterminism: Deep Uncertainty Quantification: A Machine Learning Approach for Weather Forecasting (BW, JL0, ZY0, HL, TL, YZ0, GZ0), pp. 2087–2095.
CASE-2019-MathesenYPF #adaptation #cyber-physical #nondeterminism #optimisation #probability #robust: Falsification of Cyber-Physical Systems with Robustness Uncertainty Quantification Through Stochastic optimization with Adaptive Restart (LM, SY, GP, GF), pp. 991–997.
CAV-2019-FedyukovichPMG #invariant #synthesis: Quantified Invariants via Syntax-Guided Synthesis (GF, SP, KM, AG), pp. 259–277.
CAV-2019-JonasS #named #performance #smt: Q3B: An Efficient BDD-based SMT Solver for Quantified Bit-Vectors (MJ, JS), pp. 64–73.
CAV-2019-Rabe #functional #incremental #synthesis: Incremental Determinization for Quantifier Elimination and Functional Synthesis (MNR), pp. 84–94.
VMCAI-2019-DeckerP #ltl #model checking #using: Flat Model Checking for Counting LTL Using Quantifier-Free Presburger Arithmetic (ND, AP), pp. 513–534.
CIKM-2018-EsuliF0 #network #sentiment: A Recurrent Neural Network for Sentiment Quantification (AE, AMF, FS0), pp. 1775–1778.
ICPR-2018-Bhugra0ACLC #automation: Automatic Quantification of Stomata for High-Throughput Plant Phenotyping (SB, DM0, AA, SC, BL, AC), pp. 3904–3910.
POPL-2018-LodingMP #proving: Foundations for natural proofs and quantifier instantiation (CL, PM, LP), p. 30.
CAV-2018-FarinierBBP #approach #generative: Model Generation for Quantified Formulas: A Taint-Based Approach (BF, SB, RB, MLP), pp. 294–313.
CAV-2018-NiemetzPRBT #using: Solving Quantified Bit-Vectors Using Invertibility Conditions (AN, MP, AR, CWB, CT), pp. 236–255.
DLT-2017-LodayaS #complexity #first-order #logic: Two-Variable First Order Logic with Counting Quantifiers: Complexity Results (KL, AVS), pp. 260–271.
SEFM-2017-CamilliGSB #development #nondeterminism #towards: Towards Inverse Uncertainty Quantification in Software Development (Short Paper) (MC, AG, PS, CB), pp. 375–381.
Haskell-2017-BottuKSOW #constraints: Quantified class constraints (GJB, GK, TS, BCdSO, PW), pp. 148–161.
ICFP-2017-NuytsVD #dependent type #parametricity #type system: Parametric quantifiers for dependent type theory (AN, AV, DD), p. 29.
POPL-2017-KovacsRV #reasoning: Coming to terms with quantified reasoning (LK, SR, AV), pp. 260–270.
CSL-2017-ChenFH #bound #first-order #logic #rank #slicing: Slicewise Definability in First-Order Logic with Bounded Quantifier Rank (YC, JF, XH), p. 16.
ICTSS-2017-WangTJK #satisfiability #sequence: Homing Sequence Derivation with Quantified Boolean Satisfiability (HEW, KHT, JHRJ, NK), pp. 230–242.
TAP-2017-FazekasHSB #continuation: Skolem Function Continuation for Quantified Boolean Formulas (KF, MJHH, MS, AB), pp. 129–138.
CIKM-2016-YuSHCH #analysis #data-driven #multi #sentiment: Data-Driven Contextual Valence Shifter Quantification for Multi-Theme Sentiment Analysis (HY, JS, MH, MC, JH0), pp. 939–948.
KDD-2016-KarLNC0 #online #optimisation #problem: Online Optimization Methods for the Quantification Problem (PK, SL, HN, SC, FS0), pp. 1625–1634.
PLDI-2016-GleissenthallBR #verification: Cardinalities and universal quantifiers for verifying parameterized systems (KvG, NB, AR), pp. 599–613.
CSL-2016-ChenM #constraints #monad: Quantified Constraint Satisfaction on Monoids (HC, PM), p. 14.
ICALP-v2-2015-ColcombetS #linear #order #set: Limited Set quantifiers over Countable Linear Orderings (TC, AVS), pp. 146–158.
ICALP-v2-2015-MichalewskiM #higher-order #logic #monad: Baire Category Quantifier in Monadic Second Order Logic (HM, MM), pp. 362–374.
CHI-2015-LawsonKLFH #design #problem: Problematising Upstream Technology through Speculative Design: The Case of Quantified Cats and Dogs (SWL, BK, CL, TF, LH), pp. 2663–2672.
DHM-HM-2015-KikuchiSZTGH: Effects of Quantified Instructional Tool on Spray-up Fabrication Method (TK, ES, YZ, YT, AG, HH), pp. 104–113.
ASE-2015-FilieriPY #execution #probability #symbolic computation: Quantification of Software Changes through Probabilistic Symbolic Execution (N) (AF, CSP, GY), pp. 703–708.
DATE-2015-GitinaWRSSB: Solving DQBF through quantifier elimination (KG, RW, SR, MS, CS, BB), pp. 1617–1622.
FoSSaCS-2015-HabermehlK #on the: On Presburger Arithmetic Extended with Modulo Counting Quantifiers (PH, DK), pp. 375–389.
CADE-2015-EchenimPT #equation #generative #logic: Quantifier-Free Equational Logic and Prime Implicate Generation (ME, NP, ST), pp. 311–325.
CAV-2015-ReynoldsDKTB #smt #synthesis: Counterexample-Guided Quantifier Instantiation for Synthesis in SMT (AR, MD, VK, CT, CWB), pp. 198–216.
LICS-2015-Place #regular expression: Separating Regular Languages with Two Quantifiers Alternations (TP), pp. 202–213.
ICALP-v2-2014-Bojanczyk14a #infinity: Weak MSO+U with Path Quantifiers over Infinite Trees (MB), pp. 38–49.
ICALP-v2-2014-PlaceZ #first-order #word: Going Higher in the First-Order Quantifier Alternation Hierarchy on Words (TP, MZ), pp. 342–353.
HCI-AS-2014-MateiRR: Refreshing Quantification and other Ploys to Give Up the Habit — A Repertoire of Relations, Identities, and Rhetorical Devices in Smoking Cessation Applications (SM, CR, RR), pp. 265–276.
ECIR-2014-Sebastiani: Text Quantification (FS0), pp. 819–822.
ICPR-2014-MollerPB #analysis #using: Quantification of Actin Structures Using Unsupervised Pattern Analysis Techniques (BM, EP, NB), pp. 3251–3256.
ICPR-2014-TanYZBYMM #automation #framework #robust: An Automated and Robust Framework for Quantification of Muscle and Fat in the Thigh (CT, ZY, SZ, BB, HJY, CM, DNM), pp. 3173–3178.
PLDI-2014-BorgesFdPV #analysis #composition #probability: Compositional solution space quantification for probabilistic software analysis (MB, AF, Md, CSP, WV), p. 15.
RE-2014-Hinai #social: Quantification of social sustainability in software (MAH), pp. 456–460.
SAC-2014-GuimaraesGF #composition #on the: On the impact of obliviousness and quantification on model composition effort (EG, AG, KF), pp. 1043–1048.
DATE-2014-SeidlK: Partial witnesses from preprocessed quantified Boolean formulas (MS, RK), pp. 1–6.
IJCAR-2014-BaumgartnerBW #finite #proving #theorem proving: Finite Quantification in Hierarchic Theorem Proving (PB, JB, UW), pp. 152–167.
IJCAR-2014-HetzlLRTW #logic #similarity: Introducing Quantified Cuts in Logic with Equality (SH, AL, GR, JT, DW), pp. 240–254.
PODS-2013-AbouziedAPHS #learning #query #verification: Learning and verifying quantified boolean queries by example (AA, DA, CHP, JMH, AS), pp. 49–60.
VLDB-2013-CaoB #implementation #performance #query #relational: Efficient Implementation of Generalized Quantification in Relational Query Languages (BC, AB), pp. 241–252.
ICALP-v2-2013-ChenM #query: Block-Sorted Quantified Conjunctive Queries (HC, DM), pp. 125–136.
IFM-2013-AlbertCPR #abstraction #distributed: Quantified Abstractions of Distributed Systems (EA, JC, GP, GRD), pp. 285–300.
CHI-2013-ReineckeYMMZLG #complexity #predict #visual notation: Predicting users’ first impressions of website aesthetics with a quantification of perceived visual complexity and colorfulness (KR, TY, LM, RM, YZ, JL, KZG), pp. 2049–2058.
SAS-2013-0001MP #abstract domain #automaton: Quantified Data Automata on Skinny Trees: An Abstract Domain for Lists (PG, PM, GP), pp. 172–193.
SAS-2013-BjornerMR #horn clause #on the: On Solving Universally Quantified Horn Clauses (NB, KLM, AR), pp. 105–125.
SAC-2013-AbdallahHA #approach #design: Quantified extreme scenario based design approach (AA, RH, MAA), pp. 1117–1122.
STOC-2013-Ajtai #bound: Lower bounds for RAMs and quantifier elimination (MA), pp. 803–812.
TACAS-2013-JohnC #linear: Extending Quantifier Elimination to Linear Inequalities on Bit-Vectors (AKJ, SC), pp. 78–92.
CADE-2013-KovasznaiFB: : A Tool for Polynomially Translating Quantifier-Free Bit-Vector Formulas into (GK, AF, AB), pp. 443–449.
CADE-2013-ReynoldsTGKDB #finite #smt: Quantifier Instantiation Techniques for Finite Model Finding in SMT (AR, CT, AG, SK, MD, CB), pp. 377–391.
CAV-2013-0001LMN #data type #invariant #learning #linear: Learning Universally Quantified Invariants of Linear Data Structures (PG, CL, PM, DN), pp. 813–829.
CAV-2013-BeyenePR #horn clause: Solving Existentially Quantified Horn Clauses (TAB, CP, AR), pp. 869–882.
CSL-2013-BerkholzKV #bound #logic: Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy (CB, AK, OV), pp. 61–80.
CSL-2013-HarwathS #first-order #invariant #locality #logic #on the: On the locality of arb-invariant first-order logic with modulo counting quantifiers (FH, NS), pp. 363–379.
ICLP-J-2013-YouZZ #logic programming #source code: Disjunctive logic programs with existential quantification in rule heads (JHY, HZ, YZ), pp. 563–578.
SAT-2013-BubeckB #modelling: Nested Boolean Functions as Models for Quantified Boolean Formulas (UB, HKB), pp. 267–275.
SAT-2013-IgnatievJM #approach #satisfiability: Quantified Maximum Satisfiability: — A Core-Guided Approach (AI, MJ, JMS), pp. 250–266.
SAT-2013-LonsingEG #learning #performance #pseudo: Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation (FL, UE, AVG), pp. 100–115.
WCRE-J-2009-LoRRV12 #algorithm #evaluation #mining: Mining quantified temporal rules: Formalism, algorithms, and evaluation (DL, GR, VPR, KV), pp. 743–759.
ICALP-v2-2012-AtseriasD #approximate #bound: Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers (AA, AD), pp. 67–78.
FM-2012-BarringerFHRR #automaton #monitoring #performance #runtime #towards: Quantified Event Automata: Towards Expressive and Efficient Runtime Monitors (HB, YF, KH, GR, DER), pp. 68–84.
ICPR-2012-ElnakibNCPGE #3d #analysis #using: Quantification of age-related brain cortex change using 3D shape analysis (AE, MN, MC, HYP, GLG, AEB), pp. 41–44.
ICPR-2012-TabiaGL #recognition: Motion histogram quantification for human action recognition (HT, MG, LL), pp. 2404–2407.
KR-2012-BordeauxJSM #on the: On Unit-Refutation Complete Formulae with Existentially Quantified Variables (LB, MJ, JPMS, PM).
TOOLS-EUROPE-2012-OlszakBJV #detection: Detection of Seed Methods for Quantification of Feature Confinement (AO, EB, BNJ, JV), pp. 252–268.
LOPSTR-2012-SeghirB #array #program transformation #verification: Simplifying the Verification of Quantified Array Assertions via Code Transformation (MNS, MB), pp. 194–212.
ESOP-2012-LengletW: Expansion for Universal Quantifiers (SL, JBW), pp. 456–475.
CAV-2012-KopfMO #automation: Automatic Quantification of Cache Side-Channels (BK, LM, MO), pp. 564–580.
ICLP-2012-LeeM #modelling: Stable Models of Formulas with Generalized Quantifiers (JL, YM), pp. 61–71.
ICLP-J-2012-AlvianoFLM #complexity #datalog #decidability #semantics: Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues (MA, WF, NL, MM), pp. 701–718.
IJCAR-2012-BruttomessoGR #composition: From Strong Amalgamability to Modularity of Quantifier-Free Interpolation (RB, SG, SR), pp. 118–133.
LICS-2012-ChenD: Decomposing Quantified Conjunctive (or Disjunctive) Formulas (HC, VD), pp. 205–214.
LICS-2012-ChenM #algebra #category theory #constraints #theorem: An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction (HC, MM), pp. 215–224.
SAT-2012-BalabanovCJ: Henkin Quantifiers and Boolean Formulae (VB, HJKC, JHRJ), pp. 129–142.
SAT-2012-GelderWL #preprocessor: Extended Failed-Literal Preprocessing for Quantified Boolean Formulas (AVG, SBW, FL), pp. 86–99.
SMT-2012-PhanBM #satisfiability: Anatomy of Alternating Quantifier Satisfiability (ADP, NB, DM), pp. 120–130.
WCRE-2011-KellensRNSJ #evolution #reasoning #source code #using: Reasoning over the Evolution of Source Code Using Quantified Regular Path Expressions (AK, CDR, CN, RS, VJ), pp. 389–393.
RTA-2011-BruttomessoGR #array #formal method: Rewriting-based Quantifier-free Interpolation for a Theory of Arrays (RB, SG, SR), pp. 171–186.
SAC-2011-RahmanHA11a #named #privacy #towards: ProQuPri: towards anonymity protection with privacy quantification for context-aware applications (FR, MEH, SIA), pp. 453–454.
DAC-2011-SchneiderGCBEP #on the: On the quantification of sustainability and extensibility of FlexRay schedules (RS, DG, SC, UDB, PE, ZP), pp. 375–380.
ESOP-2011-BrauerK #synthesis: Transfer Function Synthesis without Quantifier Elimination (JB, AK), pp. 97–115.
TACAS-2011-JungLWY #generative #invariant: Predicate Generation for Learning-Based Quantifier-Free Loop Invariant Inference (YJ, WL, BYW, KY), pp. 205–219.
CAV-2011-BrauerKK #incremental #satisfiability: Existential Quantification as Incremental SAT (JB, AK, JK), pp. 191–207.
CAV-2011-JohnC #algorithm #composition #equation #linear: A Quantifier Elimination Algorithm for Linear Modular Equations and Disequations (AKJ, SC), pp. 486–503.
CAV-2011-PhamTTC #constraints #fixpoint #named: FixBag: A Fixpoint Calculator for Quantified Bag Constraints (THP, MTT, AHT, WNC), pp. 656–662.
CSL-2011-CantoneLA #decidability #logic #order #set: A Decidable Quantified Fragment of Set Theory Involving Ordered Pairs with Applications to Description Logics (DC, CL, MNA), pp. 129–143.
SAT-2011-BuningZB #normalisation: Transformations into Normal Forms for Quantified Circuits (HKB, XZ, UB), pp. 245–258.
VMCAI-2011-BrilloutKRW: Beyond Quantifier-Free Interpolation in Extensions of Presburger Arithmetic (AB, DK, PR, TW), pp. 88–102.
LATA-2010-JordanZ #first-order: Untestable Properties Expressible with Four First-Order Quantifiers (CJ, TZ), pp. 333–343.
FLOPS-2010-MorihataM #automation #parallel #recursion #using: Automatic Parallelization of Recursive Functions Using Quantifier Elimination (AM, KM), pp. 321–336.
ICPR-2010-CanBG #array: Quantification of Subcellular Molecules in Tissue Microarray (AC, MOB, MJG), pp. 2548–2551.
ICPR-2010-QuelhasMC #3d #using: 3D Cell Nuclei Fluorescence Quantification Using Sliding Band Filter (PQ, AMM, ACC), pp. 2508–2511.
KDD-2010-Feldman #data mining #lessons learnt #mining #scalability: The quantification of advertising: (+ lessons from building businesses based on large scale data mining) (KF), pp. 5–6.
CAV-2010-Monniaux #lazy evaluation: Quantifier Elimination by Lazy Model Enumeration (DM), pp. 585–599.
CSL-2010-Platzer #difference #distributed #hybrid #logic: Quantified Differential Dynamic Logic for Distributed Hybrid Systems (AP), pp. 469–483.
ICTSS-2010-Gladisch #first-order #generative #logic #source code #specification #testing: Test Data Generation for Programs with Quantified First-Order Logic Specifications (CG), pp. 158–173.
IJCAR-2010-Bjorner #linear: Linear Quantifier Elimination as an Abstract Decision Procedure (NB), pp. 316–330.
IJCAR-2010-BrilloutKRW #calculus: An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic (AB, DK, PR, TW), pp. 384–399.
LICS-2010-He #finite #first-order #on the #strict: On the Strictness of the First-Order Quantifier Structure Hierarchy over Finite Structures (YH), pp. 170–178.
SAT-2010-BubeckB: Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN (UB, HKB), pp. 58–70.
WCRE-1999-LoRRV99a #algorithm #evaluation #mining: Mining Quantified Temporal Rules: Formalism, Algorithms, and Evaluation (DL, GR, VPR, KV), pp. 62–71.
DLT-2009-BehleKR #regular expression: Regular Languages Definable by Majority Quantifiers with Two Variables (CB, AK, SR), pp. 91–102.
DLT-2009-MogaveroM #logic: Branching-Time Temporal Logics with Minimal Model Quantifiers (FM, AM), pp. 396–409.
KDD-2009-ShibuyaHK #modelling #multi: Causality quantification and its applications: structuring and modeling of multivariate time series (TS, TH, YK), pp. 787–796.
KDD-2009-XueW #classification: Quantification and semi-supervised classification methods for handling changes in class distribution (JCX, GMW), pp. 897–906.
SIGIR-2009-BolourianMR #named #topic #using: SugarCube: quantification of topic propagation in the blogosphere using percolation theory (AAB, YM, CJvR), pp. 786–787.
SAS-2009-SeghirPW #abstraction #array #refinement: Abstraction Refinement for Quantified Array Assertions (MNS, AP, TW), pp. 3–18.
REFSQ-2009-TourweCBB #collaboration #requirements: Demystifying Release Definition: From Requirements Prioritization to Collaborative Value Quantification (TT, WC, NB, VB), pp. 37–44.
DATE-2009-LeveugleCMV #fault #injection #statistics: Statistical fault injection: Quantified error and confidence (RL, AC, PM, PV), pp. 502–506.
ESOP-2009-CameronD: Existential Quantification for Variant Ownership (NRC, SD), pp. 128–142.
STOC-2009-KolaitisK #graph #random: Random graphs and the parity quantifier (PGK, SK), pp. 705–714.
CAV-2009-GeM #modulo theories #satisfiability: Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories (YG, LMdM), pp. 306–320.
CAV-2009-Jiang #composition #functional: Quantifier Elimination via Functional Composition (JHRJ), pp. 383–397.
CSL-2009-BaranyKR: Cardinality Quantifiers in MLO over Trees (VB, LK, AR), pp. 117–131.
CSL-2009-Dezani-CiancagliniGR: Intersection, Universally Quantified, and Reference Types (MDC, PG, SRDR), pp. 209–224.
SAT-2009-BuningZB #subclass: Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits (HKB, XZ, UB), pp. 391–397.
SIGMOD-2008-DuTZ #named #privacy: Privacy-MaxEnt: integrating background knowledge in privacy quantification (WD, ZT, ZZ), pp. 459–472.
ICALP-B-2008-BojanczykS #first-order #logic: Tree Languages Defined in First-Order Logic with One Quantifier Alternation (MB, LS), pp. 233–245.
ICALP-B-2008-Chen #constraints: Quantified Constraint Satisfaction and the Polynomially Generated Powers Property (HC), pp. 197–208.
ICPR-2008-Abdel-HakimF #detection #novel: A novel stability quantification of detected interest points in scale-space (AEAH, AAF), pp. 1–4.
ECOOP-2008-RajanL #named: Ptolemy: A Language with Quantified, Typed Events (HR, GTL), pp. 155–179.
POPL-2008-GulwaniMT #logic: Lifting abstract interpreters to quantified logical domains (SG, BM, AT), pp. 235–246.
SAC-2008-GoldsztejnMR #algorithm #approximate #performance: An efficient algorithm for a sharp approximation of universally quantified inequalities (AG, CM, MR), pp. 134–139.
DATE-2008-WilleLDG #logic #synthesis: Quantified Synthesis of Reversible Logic (RW, HML, GWD, DG), pp. 1015–1020.
TACAS-2008-McMillan #generative #invariant #proving #using: Quantified Invariant Generation Using an Interpolating Saturation Prover (KLM), pp. 413–427.
CAV-2008-BerdineLMRS #analysis #concurrent #thread: Thread Quantification for Concurrent Shape Analysis (JB, TLA, RM, GR, SS), pp. 399–413.
CSL-2008-CharatonikW #constraints: Quantified Positive Temporal Constraints (WC, MW), pp. 94–108.
ICLP-2008-PearceV #equilibrium #logic #set #source code: Quantified Equilibrium Logic and Foundations for Answer Set Programs (DP, AV), pp. 546–560.
IJCAR-2008-Nipkow #linear: Linear Quantifier Elimination (TN), pp. 18–33.
LICS-2008-ChenMM #constraints #problem: Quantified Constraints and Containment Problems (HC, FRM, BM), pp. 317–328.
SAT-2008-CreignouDER #random: New Results on the Phase Transition for Random Quantified Boolean Formulas (NC, HD, UE, RR), pp. 34–47.
ICALP-2007-BurgisserC #complexity #problem: Exotic Quantifiers, Complexity Classes, and Complete Problems (PB, FC), pp. 207–218.
TLCA-2007-Tatsuta #higher-order #set: Simple Saturated Sets for Disjunction and Second-Order Existential Quantification (MT), pp. 366–380.
SAC-2007-BordeauxZ #constraints #linear: A solver for quantified Boolean and linear constraints (LB, LZ), pp. 321–325.
CASE-2007-IshiiNYOM #behaviour #realtime: Real-time and Long-time Quantification of Behavior of Laboratory Mice Scratching (II, YN, KY, KO, HM), pp. 628–633.
CADE-2007-GeBT #modulo theories #satisfiability #using #verification: Solving Quantified Verification Conditions Using Satisfiability Modulo Theories (YG, CB, CT), pp. 167–182.
LICS-2007-BodirskyC #constraints #similarity: Quantified Equality Constraints (MB, HC), pp. 203–212.
SAT-2007-SamerS #set: Backdoor Sets of Quantified Boolean Formulas (MS, SS), pp. 230–243.
ICALP-v2-2006-GuerriniM #commutative #linear #logic #multi: Commutative Locative Quantifiers for Multiplicative Linear Logic (SG, PM), pp. 396–407.
ICGT-2006-Rensink #graph transformation: Nested Quantification in Graph Transformation Rules (AR), pp. 1–13.
ICPR-v1-2006-SilvaMMO #gesture #interactive #multi #towards: A Multi-agent Based Interactive System Towards Child’s Emotion Performances Quantified Through Affective Body Gestures (PRDS, APM, AM, MO), pp. 1236–1239.
ICPR-v2-2006-CaoXF06a: Camera Motion Quantification and Alignment (XC, JX, HF), pp. 13–16.
ICPR-v2-2006-ZhangN #multi: Style Quantification of Scanned Multi-source Digits (XZ, GN), pp. 1018–10121.
ICPR-v3-2006-BaudrierMNR #comparison #performance: A fast binary-image comparison method with local-dissimilarity quantification (EB, GM, FN, SR), pp. 216–219.
KR-2006-Coste-MarquisFLBM #policy #representation: Representing Policies for Quantified Boolean Formulae (SCM, HF, JL, DLB, PM), pp. 286–297.
OOPSLA-2006-BockischKHAM #control flow #performance: Efficient control flow quantification (CB, SK, MH, MA, MM), pp. 125–138.
SAC-2006-GrandonG #approximate #constraints #distance #parametricity: Inner approximation of distance constraints with existential quantification of parameters (CG, AG), pp. 1660–1661.
DATE-2006-GiunchigliaNT: Quantifier structure in search based procedures for QBFs (EG, MN, AT), pp. 812–817.
ESOP-2006-Ahmed #logic #recursion: Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types (AJA), pp. 69–83.
CSL-2006-BodirskyC #constraints: Collapsibility in Infinite-Domain Quantified Constraint Satisfaction (MB, HC), pp. 197–211.
CSL-2006-Kaiser #automation #game studies #model checking: Game Quantification on Automatic Structures and Hierarchical Model Checking Games (LK), pp. 411–425.
IJCAR-2006-Chaieb #verification: Verifying Mixed Real-Integer Quantifier Elimination (AC), pp. 528–540.
IJCAR-2006-ZamanskyA #calculus #canonical: Canonical Gentzen-Type Calculi with (n, k)-ary Quantifiers (AZ, AA), pp. 251–265.
LICS-2006-DemriL #automaton #ltl: LTL with the Freeze Quantifier and Register Automata (SD, RL), pp. 17–26.
SAT-2006-BubeckB #complexity #dependence #modelling: Dependency Quantified Horn Formulas: Models and Complexity (UB, HKB), pp. 198–211.
SAT-2006-BuningZ: Minimal False Quantified Boolean Formulas (HKB, XZ), pp. 339–352.
SAT-2006-JussilaSB #proving #satisfiability: Extended Resolution Proofs for Symbolic SAT Solving with Quantification (TJ, CS, AB), pp. 54–60.
SAT-2006-TangM: Solving Quantified Boolean Formulas with Circuit Observability Don’t Cares (DT, SM), pp. 368–381.
QAPL-2004-ClarkHM05: Quantified Interference for a While Language (DC, SH, PM), pp. 149–166.
DATE-2005-CabodiCNQ #bound #model checking #set: Circuit Based Quantification: Back to State Set Manipulation within Unbounded Model Checking (GC, MC, SN, SQ), pp. 688–689.
TACAS-2005-LeinoMO #proving #theorem proving: A Two-Tier Technique for Supporting Quantifiers in a Lazily Proof-Explicating Theorem Prover (KRML, MM, XO), pp. 334–348.
SAT-J-2004-BuningZ05 #equivalence #modelling: Equivalence Models for Quantified Boolean Formulas (HKB, XZ), pp. 224–234.
SAT-J-2004-ChenD05 #algebra: Looking Algebraically at Tractable Quantified Boolean Formulas (HC, VD), pp. 71–79.
SAT-J-2004-TangYRM05 #algorithm #analysis #problem #satisfiability: Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems (DT, YY, DR, SM), pp. 292–305.
CSL-2005-ChenD #algorithm #consistency #constraints #game studies: From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction (HC, VD), pp. 232–247.
SAT-2005-AudemardS #approach: A Symbolic Search Based Approach for Quantified Boolean Formulas (GA, LS), pp. 16–30.
SAT-2005-Benedetti: Quantifier Trees for QBFs (MB), pp. 378–385.
SAT-2005-BubeckBZ #equivalence #modelling: Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas (UB, HKB, XZ), pp. 386–392.
SAT-2005-Coste-MarquisBL #branch #heuristic: A Branching Heuristics for Quantified Renamable Horn Formulas (SCM, DLB, FL), pp. 393–399.
SAT-2005-LingSB #logic #satisfiability #synthesis #using: FPGA Logic Synthesis Using Quantified Boolean Satisfiability (ACL, DPS, SDB), pp. 444–450.
ICALP-2004-Skelley #reasoning #source code: Propositional PSPACE Reasoning with Boolean Programs Versus Quantified Boolean Formulas (AS), pp. 1163–1175.
ICPR-v3-2004-KovalevK: A New Method for Quantification of Age-Related Brain Changes (VAK, FK), pp. 770–773.
SAC-2004-LosadaDBB #ad hoc #fuzzy #retrieval #using: Experiments on using fuzzy quantified sentences in adhoc retrieval (DEL, FDH, AB, SB), pp. 1059–1064.
CAV-2004-RayH #deduction #first-order #pipes and filters #using #verification: Deductive Verification of Pipelined Machines Using First-Order Quantification (SR, WAHJ), pp. 31–43.
CSL-2004-Bojanczyk #bound: A Bounding Quantifier (MB), pp. 41–55.
CSL-2004-Miller: Bindings, Mobility of Bindings, and the “generic judgments”-Quantifier: An Abstract (DM), p. 24.
IJCAR-2004-Subramani #integer #source code: Analyzing Selected Quantified Integer Programs (KS), pp. 342–356.
LICS-2004-SeshiaB #bound #using: Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds (SAS, REB), pp. 100–109.
SAT-2004-BuningZ #equivalence #modelling: Equivalence Models for Quantified Boolean Formulas (HKB, XZ), pp. 230–237.
SAT-2004-ChenD #algebra: Looking Algebraically at Tractable Quantified Boolean Formulas (HC, VD), pp. 224–229.
SAT-2004-TangYRM #algorithm #analysis #problem #satisfiability: Analysis of Search Based Algorithms for Satisfiability of Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems (DT, YY, DR, SM), pp. 214–223.
VMCAI-2004-LahiriB #abstraction #invariant: Constructing Quantified Invariants via Predicate Abstraction (SKL, REB), pp. 267–281.
JCDL-2003-GurijalaD: A Quantified Fidelity Criterion for Parameter-Embedded Watermarking of Audio Archives (AG, JRD), pp. 237–239.
Haskell-2003-Trifonov #constraints #simulation: Simulating quantified class constraints (VT), pp. 98–102.
PADL-2003-Schachte #sequence: Sequence Quantification (PS), pp. 128–144.
SAC-2003-XiangYSRS #using: Quantification of Trabecular Bone Mass and Orientation Using Gabor Wavelets (YX, VY, JS, TR, MBS), pp. 183–188.
CADE-2003-Nelson #reasoning: Reasoning about Quantifiers by Matching in the E-graph (GN), p. 166.
CSL-2003-BornerBJK #algorithm #complexity #constraints: Quantified Constraints: Algorithms and Complexity (FB, AAB, PJ, AAK), pp. 58–70.
CSL-2003-Vorobjov03a #effectiveness: Effective Quantifier Elimination over Real Closed Fields (NV), p. 545.
SAT-2003-BuningSZ #modelling #on the: On Boolean Models for Quantified Boolean Horn Formulas (HKB, KS, XZ), pp. 93–104.
SAT-2003-EglySTWZ: Comparing Different Prenexing Strategies for Quantified Boolean Formulas (UE, MS, HT, SW, MZ), pp. 214–228.
FLOPS-2002-Garcia-DiazN #constraints: Solving Mixed Quantified Constraints over a Domain Based on Real Numbers and Herbrand Terms (MGD, SN), pp. 103–118.
ICPR-v1-2002-HiranoHTOE #3d #image #using: Quantification of Shrinkage of Lung Lobe from Chest CT Images Using the 3D Extended Voronoi Division and its Application to the Benign/Malignant Discrimination of Tumor Shadows (YH, JiH, JiT, HO, KE), pp. 751–754.
CADE-2002-Moller #difference #library #named: DDDLIB: A Library for Solving Quantified Difference Inequalities (JBM), pp. 129–133.
ICDAR-2001-VincentF #approach: Gray Level Use in a Handwriting Fractal Approach and Morphological Properties Quantification (NV, TF), pp. 307–311.
PODS-2001-AgrawalA #algorithm #data mining #design #mining #on the #privacy: On the Design and Quantification of Privacy Preserving Data Mining Algorithms (DA, CCA).
ICEIS-v1-2001-CarvalhoRMNK #fuzzy #logic #using: Quantification of the Emotional Quotient of the Intelligence using the Classic and Fuzzy Logic (LFdC, RR, RRdM, SMN, CK), pp. 361–365.
ICSE-2001-KrishnamurthyS #distributed #specification #testing: The Specification and Testing of Quantified Progress Properties in Distributed Systems (PK, PAGS), pp. 201–210.
IJCAR-2001-CerritoM #logic: Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation (SC, MCM), pp. 137–151.
IJCAR-2001-GiunchigliaNT #named #satisfiability: QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability (EG, MN, AT), pp. 364–369.
SAT-2001-HuntMS #complexity #constraints #probability #problem: Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction Problems (HBHI, MVM, RES), pp. 217–230.
ICALP-2000-Libkin #constraints #independence: Variable Independence, Quantifier Elimination, and Constraint Representations (LL), pp. 260–271.
ICML-2000-VilaltaO #bias #classification #distance #evaluation #metric: A Quantification of Distance Bias Between Evaluation Metrics In Classification (RV, DO), pp. 1087–1094.
KR-2000-GinsbergP #algorithm #finite #satisfiability: Satisfiability Algorithms and Finite Quantification (MLG, AJP), pp. 690–701.
RTA-1999-CaronSTT #satisfiability: Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting (ACC, FS, ST, MT), pp. 103–117.
CSL-1999-Bradfield #fixpoint #game studies: Fixpoint Alternation and the Game Quantifier (JCB), pp. 350–361.
CSL-1999-LautemannW #reduction: MonadicNLIN and Quantifier-Free Reductions (CL, BW), pp. 322–337.
CSL-1999-Stewart #array: Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws (IAS), pp. 374–388.
KR-1998-CervesatoFM #calculus #complexity #model checking: The Complexity of Model Checking in Modal Event Calculi with Quantifiers (IC, MF, AM), pp. 368–379.
KR-1998-CostelloP: Quantifiers and Operations on Modalities and Contexts (TC, AP), pp. 270–281.
TOOLS-ASIA-1998-BlasbandR: All-Purpose Quantifiers (DB, JCR), pp. 8–17.
HPDC-1998-Al-TawilM: LogGP Quantified: The Case for MPI (KAT, CAM), pp. 366–367.
STOC-1998-TherienW #word: Over Words, Two Variables Are as Powerful as One Quantifier Alternation (DT, TW), pp. 234–240.
CSL-1998-BaazV #fuzzy #logic: Quantifier Elimination in Fuzzy Logic (MB, HV), pp. 399–414.
LICS-1998-DawarHS #finite: Ordering Finite Variable Types with Generalized Quantifiers (AD, LH, AS), pp. 28–43.
LICS-1998-Yokouchi: Completeness of Type Assignment Systems with Intersection, Union, and Type Quantifiers (HY), pp. 368–379.
VLDB-1997-ClaussenKMP #database #object-oriented #optimisation #query: Optimizing Queries with Universal Quantification in Object-Oriented and Object-Relational Databases (JC, AK, GM, KP), pp. 286–295.
HCI-SEC-1997-LathanN #performance: Quantification of Human Performance in Extreme Environments (CEL, DJN), pp. 1005–1008.
ALP-1997-AbdennadherS #constraints #generative: Model Generation with Existentially Quantified Variables and Constraints (SA, HS), pp. 256–272.
PLILP-1997-BowersHI #logic programming: Resolution for Logic Programming with Universal Quantifiers (AFB, PMH, FI), pp. 63–77.
CSL-1997-Schweikardt #monad: The Monadic Quantifier Alternation Hierarchy over Grids and Pictures (NS), pp. 441–460.
LICS-1997-MatzT #graph #infinity #monad: The Monadic Quantifier Alternation Hierarchy over Graphs is Infinite (OM, WT), pp. 236–244.
ICALP-1996-BookVW #on the #probability: On Type-2 Probabilistic Quantifiers (RVB, HV, KWW), pp. 369–380.
ECOOP-1996-GaweckiM #perspective #type system: Integrating Subtyping, Matching and Type Quantification: A Practical Perspective (AG, FM), pp. 26–47.
CADE-1996-Ohlbach #named: SCAN — Elimination of Predicate Quantifiers (HJO), pp. 161–165.
CADE-1996-Salzer #axiom #multi: Optimal Axiomatizations for Multiple-Valued Operators and Quantifiers Based on Semi-lattices (GS), pp. 688–702.
LICS-1996-Nurmonen #finite #order: Counting Modulo Quantifiers on Finite Linearly Ordered Trees (JN), pp. 484–493.
DLT-1995-DrosteK #composition: Trace Languages Definable with Modular Quantifiers (MD, DK), pp. 386–395.
KDD-1995-Thiesson #network #semistructured data: Accelerated Quantification of Bayesian Networks with Incomplete Data (BT), pp. 306–311.
POPL-1995-CastagnaP #bound #decidability #named: Corrigendum: Decidable Bounded Quantification (GC, BCP), p. 408.
POPL-1995-Vorobyov #bound #decidability: Structural Decidable Extensions of Bounded Quantification (SGV), pp. 164–175.
SAC-1995-BoscLP #flexibility #query #relational: Quantified statements in a flexible relational query language (PB, LL, OP), pp. 488–492.
DAC-1995-HagenHK #heuristic #layout: Quantified Suboptimality of VLSI Layout Heuristics (LWH, DJHH, ABK), pp. 216–221.
CAV-1995-Kupferman #branch #logic: Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions (OK), pp. 325–338.
LICS-1995-DawarG: Generalized Quantifiers and 0-1 Laws (AD, EG), pp. 54–64.
LICS-1995-Gottlob #finite: Relativized Logspace and Generalized Quantifiers over Finite Structures (GG), pp. 65–78.
POPL-1994-CastagnaP #bound #decidability: Decidable Bounded Quantification (GC, BCP), pp. 151–162.
LICS-1994-DawarH #power of: The Expressive Power of Finitely Many Generalized Quantifiers (AD, LH), pp. 20–29.
LICS-1994-Otto: Generalized Quantifiers for Simple Properties (MO), pp. 30–39.
CSL-1993-MakowskyP: Oracles and Quantifiers (JAM, YBP), pp. 189–222.
CSL-1993-Stewart #fixpoint: Incorporating Generalized Quantifiers and the Least Fixed Point Operator (IAS), pp. 318–333.
KR-1992-GabbayO #higher-order #logic: Quantifier Elimination in Second-Order Predicate Logic (DMG, HJO), pp. 425–435.
POPL-1992-Pierce #bound #decidability: Bounded Quantification is Undecidable (BCP), pp. 305–315.
LICS-1992-VaananenK #finite #game studies: Generalized Quantifiers and Pebble Games on Finite Structures (PGK, JAV), pp. 348–359.
CSL-1991-Seibert #word: Quantifier Hierarchies over Word Relations (SS), pp. 329–352.
STOC-1990-PanconesiR #approximate: Quantifiers and Approximation (AP, DR), pp. 446–456.
CSL-1990-FlogelKB #subclass: Subclasses of Quantified Boolean Formulas (AF, MK, HKB), pp. 145–155.
SIGMOD-1989-Bry #evaluation #performance #query #revisited #towards: Towards an Efficient Evaluation of General Queries: Quantifier and Disjunction Processing Revisited (FB), pp. 193–204.
ICALP-1989-Cardone #bound #recursion #relational #semantics: Relational Semantics for Recursive Types and Bounded Quantification (FC), pp. 164–178.
STOC-1989-Ierardi #algebra #formal method: Quantifier Elimination in the Theory of an Algebraically-closed Field (DI), pp. 138–147.
CSL-1989-Stark89a #logic programming #source code: A Quantifier-Free Completion of Logic Programs (RFS), pp. 384–395.
ICALP-1988-StraubingTT #regular expression: regular Languages Defined with Generalized Quantifiers (HS, DT, WT), pp. 561–575.
LFP-1988-Martini #bound #modelling: Bounded Quantifiers Have Interval Models (SM), pp. 164–173.
LICS-1988-BruceL #bound #inheritance: A Modest Model of Records, Inheritance and Bounded Quantification (KBB, GL), pp. 38–50.
VLDB-1987-Dayal #approach #query: Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates, and Quantifiers (UD), pp. 197–208.
ICALP-1987-HaferT #logic #monad: Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree (TH, WT), pp. 269–279.
CSL-1987-KarpinskiBS #complexity #horn clause #on the: On the Computational Complexity of Quantified Horn Clauses (MK, HKB, PHS), pp. 129–137.
POPL-1986-JeffersonK #execution #specification: Executable Specifications with Quantifiers in the FASE System (SJ, SNK), pp. 318–326.
CADE-1986-Konolige #logic: Resolution and Quantified Epistemic Logics (KK), pp. 199–208.
ICLP-1986-Naish86 #prolog: Negation and Quantifiers in NU-Prolog (LN), pp. 624–634.
PODS-1983-Dayal #approach #query: Processing Queries with Quantifiers: A Horticultural Approach (UD), pp. 125–136.
SIGMOD-1983-JarkeK #performance #query: Range Nesting: A Fast Method to Evaluate Quantified Queries (MJ, JK), pp. 196–206.
SIGMOD-1982-BernsteinB #calculus #performance #relational #testing: Fast Methods for Testing Quantified Relational Calculus Assertions (PAB, BTB), pp. 39–50.
ICALP-1979-BroyDPPW #data type: Existential Quantifiers in Abstract Data Types (MB, WD, HP, PP, MW), pp. 73–87.
STOC-1978-ReddyL #bound: Presburger Arithmetic with Bounded Quantifier Alternation (CRR, DWL), pp. 320–325.
SIGIR-1971-Kuhn #query: Quantification in Query Systems (JLK), pp. 81–93.