## Tag #transitive

### 106 papers:

- SCAM-2018-IslamIMRRS #detection #research #using
- [Research Paper] Detecting Evolutionary Coupling Using Transitive Association Rules (MAI, MMI, MM, BR, CKR, KAS), pp. 113–122.
- CSL-2018-0001R #induction #infinity #logic #reasoning
- Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent (LC0, RNSR), p. 16.
- CSL-2018-FerrarottiBV #higher-order #logic
- Expressivity Within Second-Order Transitive-Closure Logic (FF, JVdB, JV), p. 18.
- ECIR-2017-HuiB #crowdsourcing #quality
- Transitivity, Time Consumption, and Quality of Preference Judgments in Crowdsourcing (KH, KB), pp. 239–251.
- ICSE-2017-CoblenzNAMS #java #named
- Glacier: transitive class immutability for Java (MJC, WN, JA, BAM, JS), pp. 496–506.
- ICML-2016-ShahBGW #modelling #statistics
- Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues (NBS, SB, AG, MJW), pp. 11–20.
- ICPR-2016-Bai0CH #kernel
- A transitive aligned Weisfeiler-Lehman subtree kernel (LB0, LR0, LC, ERH), pp. 396–401.
- KDD-2016-OuCPZ0 #graph #symmetry
- Asymmetric Transitivity Preserving Graph Embedding (MO, PC0, JP, ZZ, WZ0), pp. 1105–1114.
- ICSME-2015-NishikawaWFOM #traceability
- Recovering transitive traceability links among software artifacts (KN, HW, YF, KO, RM), pp. 576–580.
- KDD-2015-OuCWW0 #component #similarity
- Non-transitive Hashing with Latent Similarity Components (MO, PC, FW, JW, WZ), pp. 895–904.
- KDD-2015-TanSZ0 #learning
- Transitive Transfer Learning (BT, YS, EZ, QY), pp. 1155–1164.
- PLATEAU-2015-CoblenzSMWS
- Comparing transitive to non-transitive object immutability (MJC, JS, BAM, SW, FS), pp. 47–48.
- AFL-2014-Vorel #automaton #set
- Subset Synchronization of Transitive Automata (VV), pp. 370–381.
- DLT-2014-BerdinskyK #automation #graph #on the
- On Automatic Transitive Graphs (DB, BK), pp. 1–12.
- FDG-2014-Schreiber #education #game studies #named
- Harmony: A game to teach transitive game balance (IS).
- DUXU-ELAS-2014-WinklerP #design #named #smarttech #towards
- ReFlexLab: Designing Transitive Wearable Technologies towards Poetic Aesthetics (CW, SP), pp. 731–738.
- DUXU-ELAS-2014-WinklerP14a #design #named #smarttech #towards
- Erratum: ReFlexLab: Designing Transitive Wearable Technologies towards Poetic Aesthetics (CW, SP).
- LICS-CSL-2014-CharatonikKM #decidability #logic
- Decidability of weak logics with deterministic transitive closure (WC, EK, FM), p. 10.
- PODS-2013-Figueira #on the #testing #xpath
- On XPath with transitive axes and data tests (DF), pp. 249–260.
- SIGMOD-2013-WangLKFF #crowdsourcing
- Leveraging transitive relations for crowdsourced joins (JW, GL, TK, MJF, JF), pp. 229–240.
- ICALP-v2-2013-GottlobPT #query
- Querying the Guarded Fragment with Transitivity (GG, AP, LT), pp. 287–298.
- SEFM-2013-PerceboisST #graph transformation #invariant #verification
- Rule-Level Verification of Graph Transformations for Invariants Based on Edges’ Transitive Closure (CP, MS, HNT), pp. 106–121.
- CADE-2013-Mayer #hybrid #logic #proving
- A Proof Procedure for Hybrid Logic with Binders, Transitivity and Relation Hierarchies (MCM), pp. 76–90.
- CSL-2013-MichaliszynO #logic
- Elementary Modal Logics over Transitive Structures (JM, JO), pp. 563–577.
- ICGT-2012-BergmannRSTV #incremental #pattern matching #performance
- Incremental Pattern Matching for the Efficient Computation of Transitive Closure (GB, IR, TS, PT, DV), pp. 386–400.
- STOC-2012-KaufmanL #graph #symmetry
- Edge transitive ramanujan graphs and symmetric LDPC good codes (TK, AL), pp. 359–366.
- CSL-2012-KieronskiM #logic
- Two-Variable Universal Logic with Transitive Closure (EK, JM), pp. 396–410.
- ICALP-v1-2011-BermanBGRWY
- Steiner Transitive-Closure Spanners of Low-Dimensional Posets (PB, AB, EG, SR, DPW, GY), pp. 760–772.
- SAS-2011-VerdoolaegeCB #approximate #integer #tuple
- Transitive Closures of Affine Integer Tuple Relations and Their Overapproximations (SV, AC, AB), pp. 216–232.
- SAC-2011-DingSW #algorithm #parallel
- FPGA based parallel transitive closure algorithm (ZD, WS, MYW), pp. 393–394.
- DATE-2011-Al-DujailyMXYP #concurrent #detection #network #runtime #using
- Run-time deadlock detection in networks-on-chip using coupled transitive closure networks (RAD, TSTM, FX, AY, MP), pp. 497–502.
- ICALP-v2-2010-BolligGMZ #automaton #logic
- Pebble Weighted Automata and Transitive Closure Logics (BB, PG, BM, MZ), pp. 587–598.
- ICPR-2010-BhatBSS #sequence #video #visual notation #word
- Transitive Closure Based Visual Words for Point Matching in Video Sequence (KKSB, MOB, GS, FS), pp. 3300–3303.
- RecSys-2010-SymeonidisTM #network #predict #similarity #social
- Transitive node similarity for link prediction in social networks with positive and negative links (PS, ET, YM), pp. 183–190.
- SIGIR-2010-FilaliNL #ambiguity #query
- Transitive history-based query disambiguation for query reformulation (KF, AN, CL), pp. 849–850.
- ASE-2010-RatanotayanonCS #feature model #using
- Using transitive changesets to support feature location (SR, HJC, SES), pp. 341–344.
- ICALP-v2-2009-Michaliszyn #decidability
- Decidability of the Guarded Fragment with the Transitive Closure (JM), pp. 261–272.
- CAiSE-2009-Guizzardi #concept #modelling #problem #revisited
- The Problem of Transitivity of Part-Whole Relations in Conceptual Modeling Revisited (GG), pp. 94–109.
- PODS-2008-CateS #automaton #logic #xpath
- XPath, transitive closure logic, and nested tree walking automata (BtC, LS), pp. 251–260.
- DLT-2008-CarpiD #automaton #problem
- The Synchronization Problem for Strongly Transitive Automata (AC, FD), pp. 240–251.
- ICPR-2008-MirzaeiR #clustering #using
- Combining hierarchical clusterings using min-transitive closure (AM, MR), pp. 1–4.
- SMT-2007-RozanovS08 #constraints #generative #logic #similarity
- Generating Minimum Transitivity Constraints in P-time for Deciding Equality Logic (MR, OS), pp. 3–17.
- ECIR-2007-Nanopoulos #collaboration #correlation
- Collaborative Filtering Based on Transitive Correlations Between Items (AN), pp. 368–380.
- PODS-2006-Cate #xpath
- The expressivity of XPath with transitive closure (BtC), pp. 328–337.
- SAC-2006-ChenC #on the #representation
- On the transitive closure representation and adjustable compression (YC, DC), pp. 450–455.
- ASPLOS-2006-XuHB #memory management #reduction
- A regulated transitive reduction (RTR) for longer memory race recording (MX, MDH, RB), pp. 49–60.
- SAC-2005-JayadevaprakashMP #generative #graph #using
- Generating association graphs of non-cooccurring text objects using transitive methods (NJ, SM, MJP), pp. 141–145.
- SAC-2005-Morimoto #mining
- Optimized transitive association rule: mining significant stopover between events (YM), pp. 543–544.
- CADE-2005-KonevWZ #logic
- Temporal Logics over Transitive States (BK, FW, MZ), pp. 182–203.
- CSL-2005-Kieronski #equivalence
- Results on the Guarded Fragment with Equivalence or Transitive Relations (EK), pp. 309–324.
- KR-2004-Halpern04a
- Intransitivity and Vagueness (JYH), pp. 121–129.
- SAC-2004-Chen #algorithm
- A new algorithm for computing transitive closures (YC), pp. 1091–1092.
- CSL-2004-ImmermanRRSY #bound #decidability #logic
- The Boundary Between Decidability and Undecidability for Transitive-Closure Logics (NI, AMR, TWR, SS, GY), pp. 160–174.
- IJCAR-2004-KazakovN
- A Resolution Decision Procedure for the Guarded Fragment with Transitive Guards (YK, HdN), pp. 122–136.
- FoSSaCS-2003-Kieronski
- The Two-Variable Guarded Fragment with Transitive Guards Is 2EXPTIME-Hard (EK), pp. 299–312.
- STOC-2002-BaswanaHS #algorithm #maintenance
- Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths (SB, RH, SS), pp. 117–123.
- ICDAR-2001-VielhauerSM #verification
- Transitivity Based Enrollment Strategy for Signature Verification (CV, RS, AM), p. 1263–?.
- RTA-2001-Struth #calculus
- Deriving Focused Calculi for Transitive Relations (GS), pp. 291–305.
- DAC-2001-LinC #graph #named #representation
- TCG: A Transitive Closure Graph-Based Representation for Non-Slicing Floorplans (JML, YWC), pp. 764–769.
- LICS-2001-SzwastT #on the #problem
- On the Decision Problem for the Guarded Fragment with Transitivity (WS, LT), pp. 147–156.
- PODS-2000-GeertsK #approximate #database #linear #logic #using
- Linear Approximation of Planar Spatial Databases Using Transitive-Closure Logic (FG, BK), pp. 126–135.
- KR-2000-HaarslevM #reasoning #strict
- Expressive ABox Reasoning with Number Restrictions, Role Hierarchies, and Transitively Closed Roles (VH, RM), pp. 273–284.
- TACAS-2000-JonssonN #infinity #verification
- Transitive Closures of Regular Relations for Verifying Infinite-State Systems (BJ, MN), pp. 220–234.
- CAV-2000-BryantV #constraints #satisfiability
- Boolean Satisfiability with Transitivity Constraints (REB, MNV), pp. 85–98.
- LICS-2000-LemstromH #approximate #logic #pattern matching
- Approximate Pattern Matching is Expressible in Transitive Closure Logic (KL, LH), pp. 157–167.
- STOC-1999-KingS #algorithm #maintenance
- A Fully Dynamic Algorithm for Maintaining the Transitive Closure (VK, GS), pp. 492–498.
- LICS-1999-GanzingerMV
- The Two-Variable Guarded Fragment with Transitive Relations (HG, CM, MV), pp. 24–34.
- LICS-1999-Ruhl
- Counting and Addition Cannot Express Deterministic Transitive Closure (MR), pp. 326–334.
- PLDI-1997-HeintzeM #analysis #control flow #linear
- Linear-time Subtransitive Control Flow Analysis (NH, DAM), pp. 261–272.
- CAV-1997-ImmermanV #logic #model checking
- Model Checking and Transitive-Closure Logic (NI, MYV), pp. 291–302.
- KR-1996-LeeG #parallel #reasoning #relational
- Parallel Transitive Reasoning in Mixed Relational Hierarchies (YL, JG), pp. 576–587.
- LICS-1995-EtessamiI
- Tree Canonization and Transitive Closure (KE, NI), pp. 331–341.
- PODS-1994-SuciuP #algebra #algorithm #exponential #set
- Any Algorithm in the Complex Object Algebra with Powerset Needs Exponential Space to Compute Transitive Closure (DS, JP), pp. 201–209.
- SIGMOD-1994-DarR #algorithm #performance
- A Performance Study of Transitive Closure Algorithms (SD, RR), pp. 454–465.
- LICS-1994-BachmairG
- Rewrite Techniques for Transitive Relations (LB, HG), pp. 384–393.
- VLDB-1993-HoutsmaWF #algorithm #evaluation #implementation #parallel #performance
- Implementation and Performance Evaluation of a Parallel Transitive Closure Algorithm on PRISMA/DB (MAWH, ANW, JF), pp. 206–217.
- DAC-1993-MatsunagaMB #on the
- On Computing the Transitive Closure of a State Transition Relation (YM, PCM, RKB), pp. 260–265.
- LICS-1992-GraedelM #logic #nondeterminism
- Deterministic vs. Nondeterministic Transitive Closure Logic (EG, GLM), pp. 58–63.
- PODS-1991-Jakobsson #algorithm
- Mixed-Approach Algorithms for Transitive Closure (HJ), pp. 199–205.
- DAC-1991-ChakradharA #algorithm #generative #testing
- A Transitive Closure Based Algorithm for Test Generation (STC, VDA), pp. 353–358.
- STOC-1991-Babai #finite #generative #graph #random
- Local Expansion of Vertex-Transitive Graphs and Random Generation in Finite Groups (LB), pp. 164–174.
- CSL-1991-BarguryM #automaton #multi #power of
- The Expressive Power of Transitive Closue and 2-way Multihead Automata (YB, JAM), pp. 1–14.
- CSL-1991-Gradel #logic #on the
- On Transitive Closure Logic (EG), pp. 149–163.
- CSL-1991-Tyszkiewicz #logic #query
- Infinitary Queries and Their Asymptotic Probabilities I: Properties Definable in Transitive Closue Logic (JT), pp. 396–410.
- SIGMOD-1990-UllmanY #complexity
- The Input/Output Complexity of Transitive Closure (JDU, MY), pp. 44–53.
- VLDB-1990-AgrawalJ #algorithm #hybrid
- Hybrid Transitive Closure Algorithms (RA, HVJ), pp. 326–334.
- VLDB-1990-CheineyM #clustering #parallel
- A Parallel Strategy for Transitive Closure usind Double Hash-Based Clustering (JPC, CdM), pp. 347–358.
- VLDB-1990-HoutsmaAC #approach #distributed #set
- Distributed Transitive Closure Computations: The Disconnection Set Approach (MAWH, PMGA, SC), pp. 335–346.
- STOC-1990-KaoK #algorithm #graph #parallel #performance #towards
- Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms for Planar Digraphs (MYK, PNK), pp. 181–192.
- SIGMOD-1989-AgrawalBJ #knowledge base #performance #scalability
- Efficient Management of Transitive Relationships in Large Data and Knowledge Bases (RA, AB, HVJ), pp. 253–262.
- VLDB-1989-LiptonN
- Estimating the Size of Generalized Transitive Closures (RJL, JFN), pp. 165–171.
- PODS-1988-SippuS #query #relational
- A Generalized Transitive Closure for Relational Queries (SS, ESS), pp. 325–332.
- VLDB-1988-IoannidisR #algorithm #performance
- Efficient Transitive Closure Algorithms (YEI, RR), pp. 382–394.
- ICALP-1988-Diekert #commutative #for free #monad
- Transitive Orientations, Möbius Functions, and Complete Semi-Thue Systems for Free Partially Commutative Monoids (VD), pp. 176–187.
- ICALP-1988-RudichB #morphism
- Optimal Circuits and Transitive Automorphism Groups (SR, LB), pp. 516–524.
- ICALP-1988-Simon #on the #reduction
- On Minimum Flow and Transitive Reduction (KS), pp. 535–546.
- SIGMOD-1987-JagadishAN #case study #recursion
- A Study of Transitive Closure As a Recursion Mechanism (HVJ, RA, LN), pp. 331–344.
- VLDB-1987-AgrawalJ #algorithm #database
- Direct Algorithms for Computing the Transitive Closure of Database Relations (RA, HVJ), pp. 255–266.
- VLDB-1987-Lu #database
- New Strategies for Computing the Transitive Closure of a Database Relation (HL), pp. 267–274.
- VLDB-1986-Ioannidis #on the #relational
- On the Computation of the Transitive Closure of Relational Operators (YEI), pp. 403–411.
- ICALP-1986-Simon #algorithm #graph
- An Improved Algorithm for Transitive Closure on Acyclic Digraphs (KS), pp. 376–386.
- STOC-1983-Spinrad
- Transitive Orientation in O(n²) Time (JPS), pp. 457–466.
- SIGMOD-1980-ParkerP #dependence #embedded #multi
- Inferences Involving Embedded Multivalued Dependencies and Transitive Dependencies (DSPJ, KPG), pp. 52–57.
- STOC-1980-Tompa80a #algorithm #implementation #polynomial #sublinear
- Two Familiar Transitive Closure Algorithms which Admit No Polynomial Time, Sublinear Space Implementations (MT), pp. 333–338.
- ICALP-1976-BloniarzFM
- A Note on the Average Time to Compute Transitive Closures (PAB, MJF, ARM), pp. 425–434.
- STOC-1976-Hirschberg #algorithm #component #parallel #problem
- Parallel Algorithms for the Transitive Closure and the Connected Component Problems (DSH), pp. 55–57.