BibSLEIGH — induction tag

induction

induction

Tag #induction

546 papers:

PADL-2020-ShakerinG #mining #using: Whitebox Induction of Default Rules Using High-Utility Itemset Mining (FS, GG), pp. 168–176.
POPL-2020-HarkKGK #bound #probability #verification: Aiming low is harder: induction for lower bounds in probabilistic program verification (MH, BLK, JG, JPK), p. 28.
CSL-2020-KupkeR #logic: Expressive Logics for Coinductive Predicates (CK, JR), p. 18.
EDM-2019-AusinABC #learning #policy: Leveraging Deep Reinforcement Learning for Pedagogical Policy Induction in an Intelligent Tutoring System (MSA, HA, TB, MC).
DLT-2019-KuperbergPP #algorithm #automaton: Coinductive Algorithms for Büchi Automata (DK, LP, DP), pp. 206–220.
ICFP-2019-VezzosiM0 #programming language: Cubical agda: a dependently typed programming language with univalence and higher inductive types (AV, AM, AA0), p. 29.
ECIR-p2-2019-SyedIGSV #detection #learning #natural language #query: Inductive Transfer Learning for Detection of Well-Formed Natural Language Search Queries (BS, VI, MG0, MS0, VV), pp. 45–52.
KDD-2019-MengY0N #framework #named: HATS: A Hierarchical Sequence-Attention Framework for Inductive Set-of-Sets Embeddings (CM, JY, BR0, JN), pp. 783–792.
PLDI-2019-ZhuXMJ #framework #learning #synthesis: An inductive synthesis framework for verifiable reinforcement learning (HZ0, ZX, SM, SJ), pp. 686–701.
POPL-2019-CavalloH #type system: Higher inductive types in cubical computational type theory (EC, RH0), p. 27.
POPL-2019-KaposiKA: Constructing quotient inductive-inductive types (AK, AK, TA), p. 24.
PPDP-2019-Kikuchi0S #program transformation #proving #term rewriting #theorem proving: Inductive Theorem Proving in Non-terminating Rewriting Systems and Its Application to Program Transformation (KK, TA0, IS), p. 14.
ICSE-2019-Sivaraman0BK #code search #logic programming: Active inductive logic programming for code search (AS, TZ0, GVdB, MK), pp. 292–303.
ESOP-2019-BasoldKL #horn clause #proving #recursion: Coinduction in Uniform: Foundations for Corecursive Proof Search with Horn Clauses (HB, EK, YL), pp. 783–813.
CADE-2019-RegerV #proving: Induction in Saturation-Based Proof Search (GR, AV), pp. 477–494.
CAV-2019-FeldmanWSS #invariant: Inferring Inductive Invariants from Phase Structures (YMYF, JRW, SS, MS), pp. 405–425.
CAV-2019-GaoKDRSAK #proving: Numerically-Robust Inductive Proof Rules for Continuous Dynamical Systems (SG, JK, JVD, NR, ASL, NA, SK), pp. 137–154.
CAV-2019-KrishnanVGG: Interpolating Strong Induction (HGVK, YV, VG, AG), pp. 367–385.
FSCD-2018-KaposiK #syntax: A Syntax for Higher Inductive-Inductive Types (AK, AK), p. 18.
FSCD-2018-TimanyS #coq #cumulative: Cumulative Inductive Types In Coq (AT, MS), p. 16.
SEFM-2018-BendikGWC #online: Online Enumeration of All Minimal Inductive Validity Cores (JB, EG, MWW, IC), pp. 189–204.
CIKM-2018-NimishakaviMGT #framework #multi #streaming: Inductive Framework for Multi-Aspect Streaming Tensor Completion with Side Information (MN, BM, MG, PPT), pp. 307–316.
ICML-2018-GanapathiramanS #modelling #parametricity: Inductive Two-layer Modeling with Parametric Bregman Transfer (VG, ZS, XZ, YY), pp. 1622–1631.
ICML-2018-LiGD #bias #learning #network: Explicit Inductive Bias for Transfer Learning with Convolutional Networks (XL0, YG, FD), pp. 2830–2839.
ICML-2018-ZhangDG #matrix #multi #performance: Fast and Sample Efficient Inductive Matrix Completion via Multi-Phase Procrustes Flow (XZ, SSD, QG), pp. 5751–5760.
KDD-2018-LiuHLH #network #on the #taxonomy: On Interpretation of Network Embedding via Taxonomy Induction (NL, XH, JL, XH), pp. 1812–1820.
POPL-2018-LampropoulosPP #generative: Generating good generators for inductive relations (LL, ZP, BCP), p. 30.
SAS-2018-Zuleger #abstraction #invariant #proving #termination: Inductive Termination Proofs with Transition Invariants and Their Relationship to the Size-Change Abstraction (FZ), pp. 423–444.
GPCE-2018-Al-SibahiJDW #refinement #verification: Verification of high-level transformations with inductive refinement types (ASAS, TPJ, ASD, AW), pp. 147–160.
CASE-2018-HuaH #concept #learning #logic programming #semantics: Concept Learning in AutomationML with Formal Semantics and Inductive Logic Programming (YH, BH), pp. 1542–1547.
ESOP-2018-MoorePR #verification: Program Verification by Coinduction (BMM, LP, GR), pp. 589–618.
CAV-2018-AbateDKKP #modulo theories #synthesis: Counterexample Guided Inductive Synthesis Modulo Theories (AA, CD, PK, DK, EP), pp. 270–288.
CSL-2018-0001R #infinity #logic #reasoning #transitive: Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent (LC0, RNSR), p. 16.
IJCAR-2018-CiobacaL #approach #proving #reachability #term rewriting: A Coinductive Approach to Proving Reachability Properties in Logically Constrained Term Rewriting Systems (SC, DL), pp. 295–311.
CIAA-2017-Pous #algorithm #automaton: CoInductive Automata Algorithms (DP), p. xvii-xviii.
FSCD-2017-0001TK #approach #confluence #proving: Improving Rewriting Induction Approach for Proving Ground Confluence (TA0, YT, YK), p. 18.
CIKM-2017-GuptaLHA #sequence #taxonomy #using: Taxonomy Induction Using Hypernym Subsequences (AG, RL, HH, KA), pp. 1329–1338.
KDD-2017-ZhanZ #learning #multi: Inductive Semi-supervised Multi-Label Learning with Co-Training (WZ, MLZ), pp. 1305–1314.
CAV-2017-LeT0C #decidability #logic: A Decidable Fragment in Separation Logic with Inductive Predicates and Arithmetic (QLL, MT, JS0, WNC), pp. 495–517.
CAV-2017-UnnoTS #automation #horn clause: Automating Induction for Solving Horn Clauses (HU0, ST, HS), pp. 571–591.
CSL-2017-Pavaux #functional: Inductive and Functional Types in Ludics (AP), p. 20.
EDM-2016-ChaplotYCK #automation #data-driven #graph: Data-driven Automated Induction of Prerequisite Structure Graphs (DSC, YY, JGC, KRK), pp. 318–323.
FM-2016-TaLKC #automation #logic #proving: Automated Mutual Explicit Induction Proof in Separation Logic (QTT, TCL, SCK, WNC), pp. 659–676.
FSCD-2016-0001T #confluence #proving: Ground Confluence Prover based on Rewriting Induction (TA0, YT), p. 12.
KDD-2016-SiCHRD #matrix: Goal-Directed Inductive Matrix Completion (SS, KYC, CJH, NR, ISD), pp. 1165–1174.
LOPSTR-2016-FarkaKH #recursion: Coinductive Soundness of Corecursive Type Class Resolution (FF, EK, KH), pp. 311–327.
POPL-2016-AltenkirchK #type system #using: Type theory in type theory using quotient inductive types (TA, AK), pp. 18–29.
POPL-2016-BrotherstonGKR #logic #model checking: Model checking for symbolic-heap separation logic with inductive predicates (JB, NG, MIK, RR), pp. 84–96.
POPL-2016-PadonISKS #decidability #invariant: Decidability of inferring inductive invariants (OP, NI, SS, AK, MS), pp. 217–231.
PPDP-2016-NagaoN #proving: Proving inductive validity of constrained inequalities (TN, NN0), pp. 50–61.
FSE-2016-GhassabaniGW #generative #performance #safety: Efficient generation of inductive validity cores for safety properties (EG, AG, MWW), pp. 314–325.
ESOP-2016-MineBR #algorithm #constraints #invariant #source code #theorem proving: An Algorithm Inspired by Constraint Solvers to Infer Inductive Invariants in Numeric Programs (AM, JB, TWR), pp. 560–588.
EDM-2015-DoroudiHAB #comprehension #how #learning #refinement #robust #towards: Towards Understanding How to Leverage Sense-making, Induction/Refinement and Fluency to Improve Robust Learning (SD, KH, VA, EB), pp. 376–379.
RTA-2015-EndrullisHHP0 #equation #framework #reasoning: A Coinductive Framework for Infinitary Rewriting and Equational Reasoning (JE, HHH, DH, AP, AS), pp. 143–159.
ICFP-2015-DannerLR #functional #semantics: Denotational cost semantics for functional languages with inductive types (ND, DRL, R), pp. 140–151.
ICGT-2015-DyckG #invariant: Inductive Invariant Checking with Partial Negative Application Conditions (JD, HG), pp. 237–253.
HIMI-IKD-2015-FujinawaSINHTH #behaviour: Induction of Human Behavior by Presentation of Environmental Acoustics (EF, SS, MI, TN, OH, TT, MH), pp. 582–594.
HIMI-IKD-2015-IwamotoH #using: Induction of a Relaxed State Using a Vibration Stimulus Based on the Respiratory Cycle (NI, HH), pp. 386–395.
CIKM-2015-ShinCLD #matrix #recommendation: Tumblr Blog Recommendation with Boosted Inductive Matrix Completion (DS, SC, KCL, ISD), pp. 203–212.
MLDM-2015-GovadaJMS #approach #hybrid #learning #using: Hybrid Approach for Inductive Semi Supervised Learning Using Label Propagation and Support Vector Machine (AG, PJ, SM, SKS), pp. 199–213.
OOPSLA-2015-PolozovG #framework #named #synthesis: FlashMeta: a framework for inductive program synthesis (OP, SG), pp. 107–126.
PLDI-2015-ChuJT #automation #imperative #proving #source code: Automatic induction proofs of data-structures in imperative programs (DHC, JJ, MTT), pp. 457–466.
POPL-2015-Sojakova #algebra: Higher Inductive Types as Homotopy-Initial Algebras (KS), pp. 31–42.
PPDP-2015-Cousot #abstract interpretation #verification: Verification by abstract interpretation, soundness and abstract induction (PC), pp. 1–4.
ICSE-v2-2015-SedelmaierL #education #learning #re-engineering: Active and Inductive Learning in Software Engineering Education (YS, DL), pp. 418–427.
SAC-2015-BasgaluppBP #algorithm #evolution #multi: Evolving decision-tree induction algorithms with a multi-objective hyper-heuristic (MPB, RCB, VP), pp. 110–117.
CASE-2015-MeddouriDF #analysis #generative #performance #predict #using: Performance analysis of an autonomous induction generator under different operating conditions using predictive control (SM, LAD, LF), pp. 1118–1124.
CGO-2015-OanceaR #analysis #scalability: Scalable conditional induction variables (CIV) analysis (CEO, LR), pp. 213–224.
FoSSaCS-2015-CloustonBGB #programming #reasoning #recursion: Programming and Reasoning with Guarded Recursion for Coinductive Types (RC, AB, HBG, LB), pp. 407–421.
TACAS-2015-MolnarDVB #incremental #ltl #model checking #proving: Saturation-Based Incremental LTL Model Checking with Inductive Proofs (VM, DD, AV, TB), pp. 643–657.
CADE-2015-PientkaC #programming #proving: Inductive Beluga: Programming Proofs (BP, AC), pp. 272–281.
CSL-2015-Berardi #comprehension #higher-order: Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness (SB), pp. 343–358.
VMCAI-2015-Cousot: Abstracting Induction by Extrapolation and Interpolation (PC), pp. 19–42.
VMCAI-2015-ReynoldsK #smt: Induction for SMT Solvers (AR, VK), pp. 80–98.
JCDL-2014-MorenoD #clustering #web #word: PageRank-based Word Sense Induction within Web Search Results Clustering (JGM, GD), pp. 465–466.
VLDB-2015-ZengPP14 #logic programming #named #scalability: QuickFOIL: Scalable Inductive Logic Programming (QZ, JMP, DP), pp. 197–208.
ICALP-v2-2014-BonsangueRABR #algebra: A Coalgebraic Foundation for Coinductive Union Types (MMB, JR, DA, FSdB, JJMMR), pp. 62–73.
FM-2014-LeinoM #automation #proving #verification: Co-induction Simply — Automatic Co-inductive Proofs in a Program Verifier (KRML, MM), pp. 382–398.
RTA-TLCA-2014-Czajka #confluence #proving #λ-calculus: A Coinductive Confluence Proof for Infinitary λ-Calculus (LC), pp. 164–178.
SEFM-2014-TatsutaC #logic #verification: Completeness of Separation Logic with Inductive Definitions for Program Verification (MT, WNC), pp. 20–34.
ICGT-2014-JansenGN #execution #generative #pointer #source code #symbolic computation: Generating Inductive Predicates for Symbolic Execution of Pointer-Manipulating Programs (CJ, FG, TN), pp. 65–80.
CHI-2014-MikkonenGORK #named #open source: OJAS: open source bi-directional inductive power link (JM, RG, MO, HR, AK), pp. 1049–1058.
HCI-AS-2014-NakanoTA #case study #experience #html #set #user interface: A Preliminary Study of Relation Induction between HTML Tag Set and User Experience (AN, AT, MA), pp. 49–56.
KDD-2014-WangNH #adaptation #learning #scalability: Large-scale adaptive semi-supervised learning via unified inductive and transductive model (DW, FN, HH), pp. 482–491.
KDIR-2014-Nakano #string: Emergent Induction of L-system Grammar from a String with Deletion-type Transmutation (RN), pp. 397–402.
KDIR-2014-NielandtMBT #xpath: Wrapper Induction by XPath Alignment (JN, RDM, AB, GDT), pp. 492–500.
KR-2014-DeneckerV #principle #revisited #semantics: The Well-Founded Semantics Is the Principle of Inductive Definition, Revisited (MD, JV).
KR-2014-Lin14a #axiom #first-order #higher-order #semantics: A First-Order Semantics for Golog and ConGolog under a Second-Order Induction Axiom for Situations (FL).
ECOOP-2014-AnconaC #object-oriented #type system: Sound and Complete Subtyping between Coinductive Types for Object-Oriented Languages (DA, AC), pp. 282–307.
LOPSTR-2014-Balaniuk #synthesis: Drill and Join: A Method for Exact Inductive Program Synthesis (RB), pp. 219–237.
POPL-2014-LagoSA #functional #higher-order #on the #probability #source code: On coinductive equivalences for higher-order probabilistic functional programs (UDL, DS, MA), pp. 297–308.
PPDP-2014-AotoS #proving #theorem: Decision Procedures for Proving Inductive Theorems without Induction (TA, SS), pp. 237–248.
ICSE-2014-BocicB #invariant #verification #web: Inductive verification of data model invariants for web applications (IB, TB), pp. 620–631.
FoSSaCS-2014-AntonopoulosGHKO #logic #problem: Foundations for Decision Problems in Separation Logic with General Inductive Predicates (TA, NG, CH, MIK, JO), pp. 411–425.
CAV-2014-BirgmeierBW #abstraction: Counterexample to Induction-Guided Abstraction-Refinement (CTIGAR) (JB, ARB, GW), pp. 831–848.
ICLP-J-2014-MantadelisRM #exclamation: Tabling, Rational Terms, and Coinduction Finally Together! (TM, RR, PM), pp. 429–443.
IJCAR-2014-Blanchette0T #logic: Unified Classical Logic Completeness — A Coinductive Pearl (JCB, AP, DT), pp. 46–60.
LICS-CSL-2014-BonchiPPR: Coinduction up-to in a fibrational setting (FB, DP, DP, JR), p. 9.
LICS-CSL-2014-BrotherstonFPG #logic #satisfiability: A decision procedure for satisfiability in separation logic with inductive predicates (JB, CF, JANP, NG), p. 10.
TFPIE-2013-Caldwell #functional: Structural Induction Principles for Functional Programmers (JC), pp. 16–26.
LATA-2013-RotBR #equivalence #proving: Coinductive Proof Techniques for Language Equivalence (JR, MMB, JJMMR), pp. 480–492.
IFM-2013-IshiiMN #automaton #calculus #hybrid #verification: Inductive Verification of Hybrid Automata with Strongest Postcondition Calculus (DI, GM, SN), pp. 139–153.
IFM-2013-MorgensternGS #game studies #incremental #using: Solving Games Using Incremental Induction (AM, MG, KS), pp. 177–191.
TLCA-2013-HancockMGMA #recursion: Small Induction Recursion (PH, CM, NG, LM, TA), pp. 156–172.
ICEIS-v1-2013-FominaEV #concept #modelling: Noise Models in Inductive Concept Formation (MVF, APE, VNV), pp. 444–450.
ICEIS-v1-2013-HuangLCW: A Rule Induction with Hierarchical Decision Attributes (CCH, SHL, ZXC, YPW), pp. 95–102.
MLDM-2013-OthmanB #reduction: Preceding Rule Induction with Instance Reduction Methods (OO, CHB), pp. 209–218.
OOPSLA-2013-DilligDLM #abduction #generative #invariant: Inductive invariant generation via abductive inference (ID, TD, BL, KLM), pp. 443–456.
PADL-2013-Moura #implementation #logic programming #performance: A Portable and Efficient Implementation of Coinductive Logic Programming (PM), pp. 77–92.
POPL-2013-FarzanKP #data flow #graph: Inductive data flow graphs (AF, ZK, AP), pp. 129–142.
POPL-2013-HurNDV #power of #proving: The power of parameterization in coinductive proof (CKH, GN, DD, VV), pp. 193–206.
ICSE-2013-GoodenoughWK: Eliminative induction: a basis for arguing system confidence (JBG, CBW, AZK), pp. 1161–1164.
SAC-2013-MartinaP #multi #protocol #security #using #verification: Verifying multicast-based security protocols using the inductive method (JEM, LCP), pp. 1824–1829.
DAC-2013-CarloYM #3d #delivery #integration #on the #power management: On the potential of 3D integration of inductive DC-DC converter for high-performance power delivery (SC, WY, SM), p. 8.
CADE-2013-ClaessenJRS #automation #proving #using: Automating Inductive Proofs Using Theory Exploration (KC, MJ, DR, NS), pp. 392–406.
CAV-2013-KloosMNP #incremental: Incremental, Inductive Coverability (JK, RM, FN, RP), pp. 158–173.
CSL-2013-Leivant #semantics #type system: Global semantic typing for inductive and coinductive computing (DL), pp. 469–483.
ICLP-J-2013-JansenJJ #compilation #prolog: Compiling Input* FO(·) inductive definitions into tabled prolog rules for IDP3 (JJ, AJ, GJ), pp. 691–704.
FLOPS-2012-SaeedloeiG #constraints #logic programming: Coinductive Constraint Logic Programming (NS, GG), pp. 243–259.
ICML-2012-Nowozin: Improved Information Gain Estimates for Decision Tree Induction (SN), p. 77.
ICPR-2012-AtaY: Searching for the optimal ordering of classes in rule induction (SA, OTY), pp. 1277–1280.
ICPR-2012-LeeKD #learning: Learning action symbols for hierarchical grammar induction (KL, TKK, YD), pp. 3778–3782.
KDD-2012-ZhangH #learning #multi: Inductive multi-task learning with multiple view data (JZ, JH), pp. 543–551.
BX-2012-PachecoCH #lens: Delta Lenses over Inductive Types (HP, AC, ZH), pp. 21–37.
ECOOP-2012-Ancona #object-oriented #semantics: Soundness of Object-Oriented Languages with Coinductive Big-Step Semantics (DA), pp. 459–483.
PEPM-2012-Katayama #functional #programming #source code: An analytical inductive functional programming system that avoids unintended programs (SK), pp. 43–52.
PEPM-2012-Voigtlander #bidirectional #synthesis: Ideas for connecting inductive program synthesis and bidirectionalization (JV), pp. 39–42.
POPL-2012-MadhusudanQS #proving #recursion: Recursive proofs for inductive tree data-structures (PM, XQ, AS), pp. 123–136.
DAC-2012-Seshia #deduction #named #synthesis #verification: Sciduction: combining induction, deduction, and structure for verification and synthesis (SAS), pp. 356–365.
FoSSaCS-2012-AtkeyGJJ: Fibrational Induction Meets Effects (RA, NG, BJ, PJ), pp. 42–57.
CAV-2012-Bradley #incremental #verification: IC3 and beyond: Incremental, Inductive Verification (ARB), p. 4.
CAV-2012-HassanBS #incremental #model checking: Incremental, Inductive CTL Model Checking (ZH, ARB, FS), pp. 532–547.
IJCAR-2012-FalkeK #linear: Rewriting Induction + Linear Arithmetic = Decision Procedure (SF, DK), pp. 241–255.
LICS-2012-Aumann #game studies: Backward induction in games of perfect information (RJA), p. 1.
LICS-2012-AwodeyGS #type system: Inductive Types in Homotopy Type Theory (SA, NG, KS), pp. 95–104.
LICS-2012-Schuster #algebra #case study: Induction in Algebra: A First Case Study (PS), pp. 581–585.
VMCAI-2012-Leino #automation #smt: Automating Induction with an SMT Solver (KRML), pp. 315–331.
RTA-2011-AotoYC #higher-order #theorem: Natural Inductive Theorems for Higher-Order Rewriting (TA, TY, YC), pp. 107–121.
ICFP-2011-AhnS #combinator #data type #recursion: A hierarchy of mendler style recursion combinators: taming inductive datatypes with negative occurrences (KYA, TS), pp. 234–246.
GCM-2010-PicardM11 #embedded #graph #problem #representation: Coinductive Graph Representation: the Problem of Embedded Lists (CP, RM).
AGTIVE-2011-FurstMM #graph grammar #heuristic #process: Graph Grammar Induction as a Parser-Controlled Heuristic Search Process (LF, MM, VM), pp. 121–136.
HCI-DDA-2011-YinR #elicitation: An Inductive Inference Model to Elicit Noncompensatory Judgment Strategies (JY, LR), pp. 414–422.
KDD-2011-RashidiC #learning #query: Ask me better questions: active learning queries based on rule induction (PR, DJC), pp. 904–912.
PLDI-2011-SrivastavaGCF #synthesis: Path-based inductive synthesis for program inversion (SS, SG, SC, JSF), pp. 492–503.
POPL-2011-HengleinN #axiom #regular expression: Regular expression containment: coinductive axiomatization and computational interpretation (FH, LN), pp. 385–398.
FoSSaCS-2011-AtkeyJG #question #refinement: When Is a Type Refinement an Inductive Type? (RA, PJ, NG), pp. 72–87.
ICLP-2011-AlrajehKRU #approach #refinement: An Inductive Approach for Modal Transition System Refinement (DA, JK, AR, SU), pp. 106–116.
ICLP-J-2011-CorapiRVPS #design #learning #using: Normative design using inductive learning (DC, AR, MDV, JAP, KS), pp. 783–799.
ICLP-J-2011-Haemmerle11a #constraints #semantics: (Co-)Inductive semantics for Constraint Handling Rules (RH), pp. 593–609.
PASTE-2010-CalmanZ #analysis #information retrieval #interprocedural: Interprocedural induction variable analysis based on interprocedural SSA form IR (SC, JZ), pp. 37–44.
LATA-2010-SaeedloeiG #realtime #verification: Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R) (NS, GG), pp. 536–548.
IFM-2010-Stratulat #proving: Integrating Implicit Induction Proofs into Certified Proof Environments (SS), pp. 320–335.
CIKM-2010-CumminsLO #information retrieval #perspective #process: Examining the information retrieval process from an inductive perspective (RC, ML, CO), pp. 89–98.
CIKM-2010-SotoudehA #detection #framework #using: Partial drift detection using a rule induction framework (DS, AA), pp. 769–778.
ICML-2010-OntanonP #approach #learning #multi: Multiagent Inductive Learning: an Argumentation-based Approach (SO, EP), pp. 839–846.
KDIR-2010-NakanoY: Number Theory-based Induction of Deterministic Context-free L-system Grammar (RN, NY), pp. 194–199.
OOPSLA-2010-ItzhakyGIS #synthesis: A simple inductive synthesis methodology and its applications (SI, SG, NI, MS), pp. 36–46.
LOPSTR-2010-Seki #on the #proving: On Inductive Proofs by Extended Unfold/Fold Transformation Rules (HS), pp. 117–132.
PEPM-2010-Hofmann #functional #named #programming: IGOR2 — an analytical inductive functional programming system: tool demo (MH0), pp. 29–32.
SAC-2010-BarrosBRCF: Evolutionary model tree induction (RCB, MPB, DDR, ACPLFdC, AAF), pp. 1131–1137.
SAC-2010-dAmatoEFFGL #reasoning #semantics #web: Inductive reasoning and semantic web search (Cd, FE, NF, BF, GG, TL), pp. 1446–1447.
SAC-2010-FanizzidE #towards: Towards the induction of terminological decision trees (NF, Cd, FE), pp. 1423–1427.
SAC-2010-LimaEF #adaptation #information management: An adaptive information extraction system based on wrapper induction with POS tagging (RL, BE, FLGdF), pp. 1815–1820.
DAC-2010-ThalmaierNWSBK #invariant #satisfiability: Analyzing k-step induction to compute invariants for SAT-based property checking (MT, MDN, MW, DS, JB, WK), pp. 176–181.
ESOP-2010-NakataU #hoare #logic #semantics: A Hoare Logic for the Coinductive Trace-Based Big-Step Semantics of While (KN, TU), pp. 488–506.
FoSSaCS-2010-PopescuG #algebra #formal method #incremental #process: Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization (AP, ELG), pp. 109–127.
CAV-2010-ChatterjeeK #architecture #automation #communication #generative #invariant #modelling: Automatic Generation of Inductive Invariants from High-Level Microarchitectural Models of Communication Fabrics (SC, MK), pp. 321–338.
CSL-2010-ForsbergS: Inductive-Inductive Definitions (FNF, AS), pp. 454–468.
CSL-2010-GanzowK #algorithm #higher-order #logic #monad: New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures (TG, LK), pp. 366–380.
CSL-2010-GhaniJF #algebra: Fibrational Induction Rules for Initial Algebras (NG, PJ, CF), pp. 336–350.
CSL-2010-OHearn #abduction #deduction #reasoning: Abductive, Inductive and Deductive Reasoning about Resources (PWO), pp. 49–50.
ICLP-2010-CorapiRL10 #abduction #logic programming: Inductive Logic Programming as Abductive Search (DC, AR, EL), pp. 54–63.
ICTSS-2010-WalkinshawBDP #case study #functional #testing: Increasing Functional Coverage by Inductive Testing: A Case Study (NW, KB, JD, JP), pp. 126–141.
IJCAR-2010-Aderhold #automation #axiom #higher-order #recursion #source code #synthesis: Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion (MA), pp. 263–277.
IJCAR-2010-BaeldeMS #proving #theorem proving: Focused Inductive Theorem Proving (DB, DM, ZS), pp. 278–292.
IJCAR-2010-Kapur #abstraction #invariant: Induction, Invariants, and Abstraction (DK), p. 353.
TAP-2010-Blanchette #algebra #analysis #data type #recursion #relational: Relational Analysis of (Co)inductive Predicates, (Co)algebraic Datatypes, and (Co)recursive Functions (JCB), pp. 117–134.
ICDAR-2009-SantoshLR #logic programming #recognition: Inductive Logic Programming for Symbol Recognition (KCS, BL, JPR), pp. 1330–1334.
CSEET-2009-SkandanS #case study #education #experience #re-engineering: Software Engineering Education at TCS Induction — An Experience Report (SS, MS), pp. 16–19.
RTA-2009-KimuraT #calculus: Dual Calculus with Inductive and Coinductive Types (DK, MT), pp. 224–238.
TLCA-2009-SarnatS: Lexicographic Path Induction (JS, CS), pp. 279–293.
CIKM-2009-ZhengSWG #performance: Efficient record-level wrapper induction (SZ, RS, JRW, CLG), pp. 47–56.
MLDM-2009-StahlBA #classification #composition #framework #named #parallel: PMCRI: A Parallel Modular Classification Rule Induction Framework (FTS, MAB, MA), pp. 148–162.
SIGIR-2009-YangC #automation #feature model #taxonomy: Feature selection for automatic taxonomy induction (HY, JC), pp. 684–685.
ECOOP-2009-AnconaL #object-oriented #type system: Coinductive Type Systems for Object-Oriented Languages (DA, GL), pp. 2–26.
LOPSTR-2009-MinG #logic programming: Coinductive Logic Programming with Negation (RM, GG), pp. 97–112.
LOPSTR-2009-Seki #on the #proving: On Inductive and Coinductive Proofs via Unfold/Fold Transformations (HS), pp. 82–96.
PPDP-2009-EastlundF #composition: Making induction manifest in modular ACL2 (CE, MF), pp. 105–116.
SAC-2009-BasgaluppBCFR #algorithm #multi #named #search-based: LEGAL-tree: a lexicographic multi-objective genetic algorithm for decision tree induction (MPB, RCB, ACPLFdC, AAF, DDR), pp. 1085–1090.
ASPLOS-2009-CameronL #architecture #parallel #principle: Architectural support for SWAR text processing with parallel bit streams: the inductive doubling principle (RDC, DL), pp. 337–348.
ESOP-2009-LakinP #functional #higher-order #programming: Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming (MRL, AMP), pp. 47–61.
CADE-2009-SwiderskiPGFS #analysis #dependence #proving #termination #theorem proving: Termination Analysis by Dependency Pairs and Inductive Theorem Proving (SS, MP, JG, CF, PSK), pp. 322–338.
CAV-2009-FuhrmannH #bound #on the #proving: On Extending Bounded Proofs to Inductive Proofs (OF, SH), pp. 278–290.
CSL-2009-Berger #proving: From Coinductive Proofs to Exact Real Arithmetic (UB), pp. 132–146.
CSL-2009-HorbachW #query: Deciding the Inductive Validity of FOR ALL THERE EXISTS * Queries (MH, CW), pp. 332–347.
LICS-2009-Leroux #invariant #problem #reachability: The General Vector Addition System Reachability Problem by Presburger Inductive Invariants (JL), pp. 4–13.
RTA-2008-Stratulat: Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities (SS), pp. 351–365.
FLOPS-2008-Julien #integer #using: Certified Exact Real Arithmetic Using Co-induction in Arbitrary Integer Base (NJ), pp. 48–63.
ICML-2008-RaykarKBDR #automation #feature model #learning #multi: Bayesian multiple instance learning: automatic feature selection and inductive transfer (VCR, BK, JB, MD, RBR), pp. 808–815.
KDD-2008-BlockeelCFGPR #database #mining #prototype: An inductive database prototype based on virtual mining views (HB, TC, ÉF, BG, AP, CR), pp. 1061–1064.
KR-2008-MagnussonD #deduction: Deductive Planning with Inductive Loops (MM, PD), pp. 528–534.
LOPSTR-2008-Kitzelmann #functional #programming: Analytical Inductive Functional Programming (EK), pp. 87–102.
POPL-2008-ChangR #analysis #relational: Relational inductive shape analysis (BYEC, XR), pp. 247–260.
ICSE-2008-SankaranarayananIG #library #logic programming #mining #specification #using: Mining library specifications using inductive logic programming (SS, FI, AG), pp. 131–140.
HPCA-2008-GuptaRSWB #commit #named: DeCoR: A Delayed Commit and Rollback mechanism for handling inductive noise in processors (MSG, KKR, MDS, GYW, DMB), pp. 381–392.
IJCAR-2008-BouhoulaJ #automation #automaton: Automated Induction with Constrained Tree Automata (AB, FJ), pp. 539–554.
SAT-2008-MarienWDB #logic #satisfiability: SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions (MM, JW, MD, MB), pp. 211–224.
TAP-2008-ClaessenS #proving: Finding Counter Examples in Induction Proofs (KC, HS), pp. 48–65.
ICALP-2007-SimonBMG #logic programming: Co-Logic Programming: Extending Logic Programming with Coinduction (LS, AB, AM, GG), pp. 472–483.
TLCA-2007-Abel #normalisation: Strong Normalization and Equi-(Co)Inductive Types (AA0), pp. 8–22.
ICFP-2007-FilinskiS #data type #reasoning: Inductive reasoning about effectful data types (AF, KS), pp. 97–110.
CIKM-2007-FanizzidE #clustering #concept #knowledge base #metric #random #semantics: Randomized metric induction and evolutionary conceptual clustering for semantic knowledge bases (NF, Cd, FE), pp. 51–60.
RecSys-2007-NguyenDB #recommendation #rule-based: Improving new user recommendations with rule-based induction on cold user data (ATN, ND, CB), pp. 121–128.
PADL-2007-LiuP #logic programming: Inductive Logic Programming by Instance Patterns (CL, EP), pp. 230–244.
PLDI-2007-GuoVA #analysis #recursion #synthesis: Shape analysis with inductive recursion synthesis (BG, NV, DIA), pp. 256–265.
POPL-2007-StovringL: A complete, co-inductive syntactic theory of sequential control and state (KS, SBL), pp. 161–172.
PPDP-2007-Gnaedig #termination: Induction for positive almost sure termination (IG), pp. 167–178.
PPDP-2007-Hamana #data type #higher-order #semantics #type system: Higher-order semantic labelling for inductive datatype systems (MH), pp. 97–108.
PPDP-2007-LiuP #logic programming: Nonmonotonic inductive logic programming by instance patterns (CL, EP), pp. 187–196.
SAS-2007-Brotherston #logic #reasoning: Formalised Inductive Reasoning in the Logic of Bunched Implications (JB), pp. 87–103.
SAC-2007-VarroB #automation #logic programming #model transformation #using: Automating model transformation by example using inductive logic programming (DV, ZB), pp. 978–984.
DATE-2007-CabodiNQ #invariant #model checking: Boosting the role of inductive invariants in model checking (GC, SN, SQ), pp. 1319–1324.
SMT-J-2006-BarrettST #data type #formal method: An Abstract Decision Procedure for a Theory of Inductive Data Types (CB, IS, CT), pp. 21–46.
CSL-2007-BlanquiJS #calculus: Building Decision Procedures in the Calculus of Inductive Constructions (FB, JPJ, PYS), pp. 328–342.
ICLP-2007-GuptaBMSM #logic programming: Coinductive Logic Programming and Its Applications (GG, AB, RM, LS, AM), pp. 27–44.
LICS-2007-BrotherstonS #calculus #infinity: Complete Sequent Calculi for Induction and Infinite Descent (JB, AS), pp. 51–62.
RTA-2006-Aoto #equation: Dealing with Non-orientable Equations in Rewriting Induction (TA), pp. 242–256.
AIIDE-2006-McQuigganLL #approach #interactive #predict: Predicting User Physiological Response for Interactive Environments: An Inductive Approach (SWM, SL, JCL), pp. 60–65.
SIGIR-2006-Forman #concept: Tackling concept drift by temporal inductive transfer (GF), pp. 252–259.
SAC-2006-HorvathHW #effectiveness #graph: Effective rule induction from labeled graphs (TH, SH, SW), pp. 611–616.
SAC-2006-NikovskiK #personalisation #recommendation: Induction of compact decision trees for personalized recommendation (DN, VK), pp. 575–581.
DAC-2006-VimjamH #identification #performance #satisfiability: Fast illegal state identification for improving SAT-based induction (VCV, MSH), pp. 241–246.
DATE-2006-LaMeresK #encoding: Bus stuttering: an encoding technique to reduce inductive noise in off-chip data transmission (BJL, SPK), pp. 522–527.
ESOP-2006-Leroy #semantics: Coinductive Big-Step Operational Semantics (XL), pp. 54–68.
ICLP-2006-SimonMBG #logic programming: Coinductive Logic Programming (LS, AM, AB, GG), pp. 330–345.
LICS-2006-Kozen #probability #process #proving: Coinductive Proof Principles for Stochastic Processes (DK), pp. 359–366.
SEFM-2005-OlssonW #correctness #imperative #proving #source code: Customised Induction Rules for Proving Correctness of Imperative Programs (OO, AW), pp. 180–189.
TLCA-2005-Bertot: Filters on CoInductive Streams, an Application to Eratosthenes’ Sieve (YB), pp. 102–115.
ICML-2005-BridewellALT #process: Reducing overfitting in process model induction (WB, NBA, PL, LT), pp. 81–88.
ICML-2005-ZhuL #graph #learning #modelling #scalability: Harmonic mixtures: combining mixture models and graph-based methods for inductive and scalable semi-supervised learning (XZ, JDL), pp. 1052–1059.
SIGIR-2005-UdaniDDS #using #web: Noun sense induction using web search results (GU, SD, AD, TS), pp. 657–658.
SAC-2005-FalcoTCP #approach #programming #search-based: Inductive inference of chaotic series by Genetic Programming: a Solomonoff-based approach (IDF, ET, ADC, AP), pp. 957–958.
DATE-2005-BhaduriV #higher-order #metric: Inductive and Capacitive Coupling Aware Routing Methodology Driven by a Higher Order RLCK Moment Metric (AB, RV), pp. 922–923.
DATE-2005-LaMeresK #encoding: Encoding-Based Minimization of Inductive Cross-Talk for Off-Chip Data Transmission (BJL, SPK), pp. 1318–1323.
FASE-2005-HausmannMS #higher-order: Iterative Circular Coinduction for CoCasl in Isabelle/HOL (DH, TM, LS), pp. 341–356.
CAV-2005-Kaivola #component #invariant #simulation #verification: Formal Verification of Pentium® 4 Components with Symbolic Simulation and Inductive Invariants (RK), pp. 170–184.
CAV-2005-LoginovRS #abstraction #learning #refinement: Abstraction Refinement via Inductive Learning (AL, TWR, SS), pp. 519–533.
CSL-2005-BarrasG #calculus #on the: On the Role of Type Decorations in the Calculus of Inductive Constructions (BB, BG), pp. 151–166.
ICLP-2005-PelovT #satisfiability: Reducing Inductive Definitions to Propositional Satisfiability (NP, ET), pp. 221–234.
ICALP-2004-AbbottAG #representation #using: Representing Nested Inductive Types Using W-Types (MA, TA, NG), pp. 59–71.
RTA-2004-AotoYT #higher-order #theorem: Inductive Theorems for Higher-Order Rewriting (TA, TY, YT), pp. 269–284.
ICML-2004-EsmeirM #algorithm: Lookahead-based algorithms for anytime induction of decision trees (SE, SM).
ICML-2004-JinL #robust: Robust feature induction for support vector machines (RJ, HL).
KR-2004-DeneckerT #calculus: Inductive Situation Calculus (MD, ET), pp. 545–553.
KR-2004-Kern-IsbernerF #information management #representation: Knowledge Discovery by Reversing Inductive Knowledge Representation (GKI, JF), pp. 34–44.
KR-2004-RaedtR #logic programming: Condensed Representations for Inductive Logic Programming (LDR, JR), pp. 438–446.
ICSE-2004-HaRCRD #case study #composition #experience #proving #realtime: Feature-Based Decomposition of Inductive Proofs Applied to Real-Time Avionics Software: An Experience Report (VH, MR, DDC, HR, BD), pp. 304–313.
SAC-2004-MassonRB #database #optimisation #query #set #towards: Optimizing subset queries: a step towards SQL-based inductive databases for itemsets (CM, CR, JFB), pp. 535–539.
CSL-2004-Cordon-FrancoFM #recursion: Provably Total Primitive Recursive Functions: Theories with Induction (ACF, AFM, FFLM), pp. 355–369.
IJCAR-2004-SteelBM #protocol: Attacking a Protocol for Group Key Agreement by Refuting Incorrect Inductive Conjectures (GS, AB, MM), pp. 137–151.
LICS-2004-Berger: A Computational Interpretation of Open Induction (UB), p. 326.
ECDL-2003-FerilliEBM #automation #classification: Automatic Induction of Rules for Classification and Interpretation of Cultural Heritage Material (SF, FE, TMAB, NDM), pp. 152–163.
RTA-2003-BartheS #framework #platform #validation: Validation of the JavaCard Platform with Implicit Induction Techniques (GB, SS), pp. 337–351.
RTA-2003-UrsoK: “Term Partition” for Mathematical Induction (PU, EK), pp. 352–366.
TLCA-2003-Blanqui #algebra #calculus: Inductive Types in the Calculus of Algebraic Constructions (FB), pp. 46–59.
ICEIS-v2-2003-MorenoJCR #fuzzy: Induction of Temporal Fuzzy Chains (JMG, LJ, JJCS, LRB), pp. 308–315.
ICML-2003-LangleyGBS #modelling #process #robust: Robust Induction of Process Models from Time-Series Data (PL, DG, SDB, KS), pp. 432–439.
ICML-2003-YamadaSYT #data-driven #database #standard: Decision-tree Induction from Time-series Data Based on a Standard-example Split Test (YY, ES, HY, KT), pp. 840–847.
SEKE-2003-ChenJ #fuzzy #information management #learning #multi #named: MFILM: a multi-dimensional fuzzy inductive learning method for knowledge acquisition (YTC, BJ), pp. 445–449.
LOPSTR-2003-AlexandreBD #proving #synthesis: Predicate Synthesis from Inductive Proof Attempt of Faulty Conjectures (FA, KB, MD), pp. 20–33.
LOPSTR-2003-LehmannL #generative #proving #theorem proving #using: Inductive Theorem Proving by Program Specialisation: Generating Proofs for Isabelle Using Ecce (HL, ML), pp. 1–19.
DATE-2003-WedlerSK #encoding #using: Using RTL Statespace Information and State Encoding for Induction Based Property Checking (MW, DS, WK), pp. 11156–11157.
FoSSaCS-2003-SprengerD #calculus #on the #proving #reasoning #μ-calculus: On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the μ-Calculus (CS, MD), pp. 425–440.
CADE-2003-AvenhausKSW #exclamation #how #theorem: How to Prove Inductive Theorems? QUODLIBET! (JA, UK, TSS, CPW), pp. 328–333.
CADE-2003-DeplagneKKN #equation #proving #theorem: Proof Search and Proof Check for Equational and Inductive Theorems (ED, CK, HK, QHN), pp. 297–316.
CADE-2003-GieslK #equation: Deciding Inductive Validity of Equations (JG, DK), pp. 17–31.
CAV-2003-MouraRS #bound #model checking #verification: Bounded Model Checking and Induction: From Refutation to Verification (Extended Abstract, Category A) (LMdM, HR, MS), pp. 14–26.
FLOPS-2002-BarbosaO #calculus #process: Coinductive Interpreters for Process Calculi (LSB, JNO), pp. 183–197.
CIKM-2002-LiuYC #bias #classification: Boosting to correct inductive bias in text classification (YL, YY, JGC), pp. 348–355.
ICML-2002-AlphonseM #logic programming #set: Feature Subset Selection and Inductive Logic Programming (ÉA, SM), pp. 11–18.
ICML-2002-GambergerL #case study: Descriptive Induction through Subgroup Discovery: A Case Study in a Medical Domain (DG, NL), pp. 163–170.
ICML-2002-TakechiS: Finding an Optimal Gain-Ratio Subset-Split Test for a Set-Valued Attribute in Decision Tree Induction (FT, ES), pp. 618–625.
KR-2002-Gardenfors #concept #higher-order #similarity: The Role of Higher Order Similarity in Induction and Concept Formation (PG), p. 629.
PEPM-2002-BartheU #continuation: CPS translating inductive and coinductive types (GB, TU), pp. 131–142.
PPDP-2002-FissoreGK #proving #termination: System Presentation — CARIBOO: An induction based proof tool for termination with strategies (OF, IG, HK), pp. 62–73.
SAC-2002-Pillay #algorithm #programming #search-based #using: Using genetic programming for the induction of novice procedural programming solution algorithms (NP), pp. 578–583.
PDP-2002-FolinoPS #parallel #programming #search-based: Improving Induction Decision Trees with Parallel Genetic Programming (GF, CP, GS), pp. 181–18.
ISSTA-2002-Cheng #design #modelling #refactoring #verification: Refactoring design models for inductive verification (YPC), pp. 164–168.
ICDAR-2001-Amin #logic programming #recognition: Recognition of Hand-Printed Characters Based on Structural Description and Inductive Logic Programming (AA), pp. 333–337.
TLCA-2001-Geuvers #dependent type #higher-order #type system: Induction Is Not Derivable in Second Order Dependent Type Theory (HG), pp. 166–181.
TLCA-2001-Matthes #higher-order #λ-calculus #μ-calculus: Parigot’s Second Order λμ-Calculus and Inductive Types (RM), pp. 329–343.
GT-VMT-2001-Pfaltz #approach #concept #empirical #graph: Transformations of Concept Graphs: An Approach to Empirical Induction (JLP), pp. 318–324.
CIKM-2001-JeongH #xml: Induction of Integrated View for XML Data with Heterogeneous DTDs (EJ, CNH), pp. 151–158.
KDD-2001-LinP #natural language #semantics: Induction of semantic classes from natural language text (DL, PP), pp. 317–322.
MLDM-2001-MalerbaELL #first-order #recognition: First-Order Rule Induction for the Recognition of Morphological Patterns in Topographic Maps (DM, FE, AL, FAL), pp. 88–101.
CC-2001-StoutchininAGDJD #pointer: Speculative Prefetching of Induction Pointers (AS, JNA, GRG, JCD, SJ, AD), pp. 289–303.
DAC-2001-MassoudKMW #analysis #difference #modelling: Modeling and Analysis of Differential Signaling for Minimizing Inductive Cross-Talk (YM, JK, DM, JW), pp. 804–809.
FoSSaCS-2001-RocklHB #formal method #higher-order #syntax #π-calculus: Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the π-Calculus and Mechanizing the Theory of Contexts (CR, DH, SB), pp. 364–378.
CAV-2001-AronsPRXZ #automation #verification: Parameterized Verification with Automatically Computed Inductive Assertions (TA, AP, SR, JX, LDZ), pp. 221–234.
CAV-2001-RoychoudhuryR #automation #protocol #verification: Automated Inductive Verification of Parameterized Protocols (AR, IVR), pp. 25–37.
CSL-2001-Martin: A Principle of Induction (KM), pp. 458–468.
CSL-2001-Matthes #rank: Monotone Inductive and Coinductive Constructors of Rank 2 (RM), pp. 600–614.
IJCAR-2001-GieslK #decidability #theorem: Decidable Classes of Inductive Theorems (JG, DK), pp. 469–484.
LICS-2001-Jeffrey #lts #type system: A Symbolic Labelled Transition System for Coinductive Subtyping of Fμ≤ Types (AJ), pp. 323–333.
ICML-2000-WeissI #lightweight: Lightweight Rule Induction (SMW, NI), pp. 1135–1142.
ICML-2000-ZupanBBD #concept #semistructured data: Induction of Concept Hierarchies from Noisy Data (BZ, IB, MB, JD), pp. 1199–1206.
ASE-2000-GoguenLR: Circular Coinductive Rewriting (JAG, KL, GR), pp. 123–132.
FoSSaCS-2000-BartheR #calculus #type system: Constructor Subtyping in the Calculus of Inductive Constructions (GB, FvR), pp. 17–34.
WRLA-2000-GoguenLR #behaviour: Behavioral and Coinductive Rewriting (JAG, KL, GR), pp. 2–23.
CADE-2000-KapurS: Extending Decision Procedures with Induction Schemes (DK, MS), pp. 324–345.
CAV-2000-AyariBK #automaton: Decision Procedures for Inductive Boolean Functions Based on Alternating Automata (AA, DAB, FK), pp. 170–185.
CAV-2000-McMillanQS #composition #model checking: Induction in Compositional Model Checking (KLM, SQ, JBS), pp. 312–327.
CL-2000-BoultonS #automation #recursion: Automatic Derivation and Application of Induction Schemes for Mutually Recursive Functions (RJB, KS), pp. 629–643.
CL-2000-Denecker #logic: Extending Classical Logic with Inductive Definitions (MD), pp. 703–717.
CSL-2000-Jaume #logic programming: Logic Programming and Co-inductive Definitions (MJ), pp. 343–355.
DLT-1999-LopezN: Substitutions from Rauzy induction (LML, PN), pp. 200–209.
ICALP-1999-Miculan #calculus #formal method #lazy evaluation #proving #μ-calculus: Formalizing a Lazy Substitution Proof System for μ-calculus in the Calculus of Inductive Constructions (MM), pp. 554–564.
ICALP-1999-Rutten #automaton: Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously (JJMMR), pp. 645–654.
HCI-EI-1999-MahanMEHD: Countermeasures Against Stress: Dynamic Cognitive Induction (RPM, CJM, LRE, EH, PTD), pp. 691–695.
ICML-1999-BrodieD #learning #using: Learning to Ride a Bicycle using Iterated Phantom Induction (MB, GD), pp. 57–66.
ICML-1999-PalhangS #learning #logic programming: Learning Discriminatory and Descriptive Rules by an Inductive Logic Programming System (MP, AS), pp. 288–297.
ICML-1999-Pompe #recursion: Noise-Tolerant Recursive Best-First Induction (UP), pp. 315–324.
ICML-1999-WuBCS #scalability: Large Margin Trees for Induction and Transduction (DW, KPB, NC, JST), pp. 474–483.
KDD-1999-Cerquides: Applying General Bayesian Techniques to Improve TAN Induction (JC), pp. 292–296.
SAC-1999-Taylor #finite #pattern matching #using: Exon/Intron Discrimination Using the Finite Induction Pattern Matching Technique (PAT), pp. 41–45.
FoSSaCS-1999-Lenisa #bisimulation #equivalence #logic: A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects (ML), pp. 243–257.
CADE-1999-HutterB #contest #design #proving #theorem proving: The Design of the CADE-16 Inductive Theorem Prover Contest (DH, AB), pp. 374–377.
CAV-1999-MannaS #diagrams #verification: Verification of Parameterized Systems by Dynamic Induction on Diagrams (ZM, HS), pp. 25–41.
CSL-1999-AltenkirchR #monad #using: Monadic Presentations of λ Terms Using Generalized Inductive Types (TA, BR), pp. 453–468.
ICLP-1999-ProiettiP: Transforming Inductive Definitions (MP, AP), pp. 486–499.
ITiCSE-1998-RosenSB #student: An augmented induction for HND computer studies students through an early integrated, inter-disciplinary assignment (CR, DS, JIB), pp. 219–222.
ICALP-1998-Lugiez #automaton #proving #theorem proving: A Good Class of Tree Automata and Application to Inductive Theorem Proving (DL), pp. 409–420.
CIKM-1998-DumaisPHS #algorithm #categorisation #learning: Inductive Learning Algorithms and Representations for Text Categorization (STD, JCP, DH, MS), pp. 148–155.
ICML-1998-BlockeelRR #clustering #top-down: Top-Down Induction of Clustering Trees (HB, LDR, JR), pp. 55–63.
ICML-1998-ProvostFK #algorithm #estimation: The Case against Accuracy Estimation for Comparing Induction Algorithms (FJP, TF, RK), pp. 445–453.
ICPR-1998-SanchezPF #approach: A Voronoi-diagram-based approach to oblique decision tree induction (JSS, FP, FJF), pp. 542–544.
LOPSTR-1998-HamfeltN #combinator #composition #logic programming #source code #synthesis: Inductive Synthesis of Logic Programs by Composition of Combinatory Program Schemes (AH, JFN), pp. 143–158.
WRLA-1998-Jouannaud #calculus #equation #logic: Membership equational logic, calculus of inductive instructions, and rewrite logic (JPJ), pp. 388–393.
WRLA-1998-MatsumotoF #automation #behaviour #testing #towards #verification: Test set coinduction — Toward automated verification of behavioural properties (MM, KF), pp. 242–262.
CADE-1998-BrauburgerG #analysis #evaluation #termination: Termination Analysis by Inductive Evaluation (JB, JG), pp. 254–269.
CADE-1998-Crary #fixpoint: Admissibility of Fixpoint Induction over Partial Types (KC), pp. 270–285.
CAV-1998-BellaP: Mechanising BAN Kerberos by the Inductive Method (GB, LCP), pp. 416–427.
CSL-1998-Altenkirch #logic: Logical Relations and Inductive/Coinductive Types (TA), pp. 343–354.
JICSLP-1998-Lavrac #information management #logic programming #relational: Inductive Logic Programming for Relational Knowledge Discovery (NL), pp. 7–24.
LICS-1998-FernandezM #equivalence #interactive: Coinductive Techniques for Operational Equivalence of Interaction Nets (MF, IM), pp. 321–332.
LICS-1998-PavlovicE #calculus: Calculus in Coinductive Form (DP, MHE), pp. 408–417.
RTA-1997-KuhlerW #data type #equation #proving #specification #theorem proving: Conditional Equational Specifications of Data Types with Partial Operations for Inductive Theorem Proving (UK, CPW), pp. 38–52.
TLCA-1997-BrandtH #axiom #recursion #similarity #type system: Coinductive Axiomatization of Recursive Type Equality and Subtyping (MB, FH), pp. 63–81.
TLCA-1997-Lenisa #semantics #λ-calculus: Semantic Techniques for Deriving Coinductive Characterizations of Observational Equivalences for λ-calculi (ML), pp. 248–266.
ICFP-1997-Ostvold #functional #recursion #source code #synthesis: Inductive Synthesis of Recursive Functional Programs (Poster Abstract) (BMØ), p. 323.
HCI-SEC-1997-Yoshida #graph #modelling: User Modeling by Graph-Based Induction (KY), pp. 23–26.
ICML-1997-CohenD #case study #comparative #fault #logic programming #predict: A Comparative Study of Inductive Logic Programming Methods for Software Fault Prediction (WWC, PTD), pp. 66–74.
ICML-1997-Decatur #classification #learning: PAC Learning with Constant-Partition Classification Noise and Applications to Decision Tree Induction (SED), pp. 83–91.
ICML-1997-VilaltaR #classification #multi: Integrating Feature Construction with Multiple Classifiers in Decision Tree Induction (RV, LAR), pp. 394–402.
KDD-1997-ProvostK #algorithm #overview #perspective #scalability: Scaling Up Inductive Algorithms: An Overview (FJP, VK), pp. 239–242.
LOPSTR-1997-SemeraroEMFF #datalog #framework #incremental #logic #synthesis: A Logic Framework for the Incremental Inductive Synthesis of Datalog Theories (GS, FE, DM, NF, SF), pp. 300–321.
TAPSOFT-1997-Jacobs #algebra #behaviour #correctness #proving #specification: Behaviour-Refinement of Coalgebraic Specifications with Coinductive Correctness Proofs (BJ0), pp. 787–802.
TAPSOFT-1997-Lenisa #proving #λ-calculus: A Uniform Syntactical Method for Proving Coinduction Principles in Lambda-Calculi (ML), pp. 309–320.
CADE-1997-DennisBG #bisimulation #proving #using: Using A Generalisation Critic to Find Bisimulations for Coinductive Proofs (LAD, AB, IG), pp. 276–290.
CADE-1997-Matthews #implementation #using: A Practical Implementation of Simple Consequence Relations Using Inductive Definitions (SM), pp. 306–320.
ILPS-1997-Mannila #data mining #database #mining: Inductive Databases and Condensed Representations for Data Mining (HM), pp. 21–30.
LICS-1997-BouhoulaJ #automation: Automata-Driven Automated Induction (AB, JPJ), pp. 14–25.
LICS-1997-EscardoS #algebra #recursion: Induction and Recursion on the Partial Real Line via Biquotients of Bifree Algebras (MHE, TS), pp. 376–386.
LICS-1997-Rathke #fixpoint #process: Unique Fixpoint Induction for Value-Passing Processes (JR), pp. 140–148.
RTA-1996-BerregebBR #commutative #named #proving: SPIKE-AC: A System for Proofs by Induction in Associative-Commutative Theories (NB, AB, MR), pp. 428–431.
ICFP-1996-Howard: Inductive, Coinductive, and Pointed Types (BTH), pp. 102–109.
AKDDM-1996-Dzeroski #database #information management #logic programming: Inductive Logic Programming and Knowledge Discovery in Databases (SD), pp. 117–152.
AKDDM-1996-HanF #data mining #mining: Attribute-Oriented Induction in data Mining (JH, YF), pp. 399–421.
AKDDM-1996-HsuK #learning #optimisation #query #semantics #using: Using Inductive Learning To Generate Rules for Semantic Query Optimization (CNH, CAK), pp. 425–445.
AKDDM-1996-SimoudisLK #data mining #deduction #mining #reasoning: Integrating Inductive and Deductive Reasoning for Data Mining (ES, BL, RK), pp. 353–373.
ICML-1996-Bostrom #logic programming #regular expression #source code: Theory-Guideed Induction of Logic Programs by Inference of Regular Languages (HB), pp. 46–53.
ICML-1996-DonohoR #using: Constructive Induction Using Fragmentary Knowledge (SKD, LAR), pp. 113–121.
KDD-1996-Domingos #linear: Linear-Time Rule Induction (PMD), pp. 96–101.
KDD-1996-Domingos96a #performance: Efficient Specific-to-General Rule Induction (PMD), pp. 319–322.
KDD-1996-FultonKSW #data mining #interactive #mining #towards: Local Induction of Decision Trees: Towards Interactive Data Mining (TF, SK, SS, DLW), pp. 14–19.
KDD-1996-Langley: Induction of Condensed Determinations (PL), pp. 327–330.
KDD-1996-TeranoI #information management #interactive #learning #using: Interactive Knowledge Discovery from Marketing Questionnaire Using Simulated Breeding and Inductive Learning Methods (TT, YI), pp. 279–282.
KDD-1996-UrpaniWS #named: RITIO — Rule Induction Two In One (DU, XW, JS), pp. 339–342.
CADE-1996-BasinM: Structuring Metatheory on Inductive Definitions (DAB, SM), pp. 171–185.
CADE-1996-IrelandB #proving: Extensions to a Generalization Critic for Inductive Proof (AI, AB), pp. 47–61.
CADE-1996-KapurS #automation: Lemma Discovery in Automated Induction (DK, MS), pp. 538–552.
CAV-1996-BerregebBR #automation #commutative #verification: Automated Verification by Induction with Associative-Commutative Operators (NB, AB, MR), pp. 220–231.
CSL-1996-Setzer #decidability: Inductive Definitions with Decidable Atomic Formulas (AS), pp. 414–430.
ICML-1995-Benson #learning #modelling: Inductive Learning of Reactive Action Models (SB), pp. 47–54.
ICML-1995-Cohen #effectiveness #performance: Fast Effective Rule Induction (WWC), pp. 115–123.
ICML-1995-DonohoR #lessons learnt: Lessons from Theory Revision Applied to Constructive Induction (SKD, LAR), pp. 185–193.
ICML-1995-SinghP #algorithm #classification #comparison: A Comparison of Induction Algorithms for Selective and non-Selective Bayesian Classifiers (MS, GMP), pp. 497–505.
ICML-1995-StreetMW #approach #learning #predict: An Inductive Learning Approach to Prognostic Prediction (WNS, OLM, WHW), pp. 522–530.
KDD-1995-Gaines: Structured and Unstructured Induction with EDAGs (BRG), pp. 124–129.
KDD-1995-HwangF #algorithm #performance: Efficient Algorithms for Attribute-Oriented Induction (HYH, AWCF), pp. 168–173.
KDD-1995-MurthyS #effectiveness #heuristic #how #question: Decision Tree Induction: How Effective is the Greedy Heuristic? (SKM, SS), pp. 222–227.
KDD-1995-Siebes #query: Data Surveying: Foundations of an Inductive Query Language (AS), pp. 269–274.
KDD-1995-TsumotoT #automation #multi #recursion #statistics #testing: Automated Selection of Rule Induction Methods Based on Recursive Iteration of Resampling Methods and Multiple Statistical Testing (ST, HT), pp. 312–317.
KDD-1995-WuM #fuzzy: Fuzzy Interpretation of Induction Results (XW, PM), pp. 325–330.
LOPSTR-1995-ParkesW #horn clause #logic programming #synthesis: Logic Program Synthesis by Induction over Horn Clauses (AJP, GAW), p. 170.
PEPM-1995-Deutsch #abstract interpretation #data type #modelling #pointer #semantics: Semantic models and abstract interpretation techniques for inductive data structures and pointers (AD), pp. 226–229.
ASF+SDF-1995-NaidichD #asf+sdf #automation #proving #specification: Specifying an Automated Induction Proof Procedure in ASF+SDF (DN, TBD), pp. 233–254.
TAPSOFT-1995-Geser #proving: Mechanized Inductive Proof of Properties of a Simple Code Optimizer (AG), pp. 605–619.
CAV-1995-CousotC #composition #constraints #equation #fixpoint #game studies #rule-based #semantics: Compositional and Inductive Semantic Definitions in Fixpoint, Equational, Constraint, Closure-condition, Rule-based and Game-Theoretic Form (PC, RC), pp. 293–308.
ICML-1994-KietzL #algorithm #logic programming #performance: An Efficient Subsumption Algorithm for Inductive Logic Programming (JUK, ML), pp. 130–138.
ICML-1994-Muggleton #logic programming: Bayesian Inductive Logic Programming (SM), pp. 371–379.
ICML-1994-Sebag #algorithm #constraints: A Constraint-based Induction Algorithm in FOL (MS), pp. 275–283.
ICML-1994-Utgoff #algorithm #incremental: An Improved Algorithm for Incremental Induction of Decision Trees (PEU), pp. 318–325.
ICML-1994-ZelleMK #bottom-up #logic programming #top-down: Combining Top-down and Bottom-up Techniques in Inductive Logic Programming (JMZ, RJM, JBK), pp. 343–351.
KDD-1994-AronisP #machine learning #relational: Efficiently Constructing Relational Features from Background Knowledge for Inductive Machine Learning (JMA, FJP), pp. 347–358.
KDD-1994-HsuK #optimisation #query #semantics: Rule Induction for Semantic Query Optimization (CNH, CAK), pp. 311–322.
KDD-1994-ShenMOZ #database #deduction #learning #using: Using Metagueries to Integrate Inductive Learning and Deductive Database Technology (WMS, BGM, KO, CZ), pp. 335–346.
KDD-1994-SimoudisLK #database #deduction #mining #reasoning: Integrating Inductive and Deductive Reasoning for Database Mining (ES, BL, RK), pp. 37–48.
KDD-1994-ZuckerCTR #bias #named: DICE: A Discovery Environment Integrating Inductive Bias (JDZ, VC, JT, GR), pp. 275–286.
ALP-1994-Bouhoula #proving: Sufficient Completeness and Parameterized Proofs by Induction (AB), pp. 23–40.
LOPSTR-1994-FlenerP #on the #reasoning #synthesis #using: On the Use of Inductive Reasoning in Program Synthesis: Prejudice and Prospects (PF, LP), pp. 69–87.
PEPM-1994-FegarasSZ #multi #source code: Improving Programs Which Recurse over Multiple Inductive Structures (LF, TS, TZ), pp. 21–32.
CADE-1994-Bouhoula #named #proving: SPIKE: a System for Sufficient Completeness and Parameterized Inductive Proofs (AB), pp. 836–840.
CADE-1994-BronsardRH #order #using: Induction using Term Orderings (FB, USR, RWH), pp. 102–117.
CADE-1994-ChazarainK #proving: Mechanizable Inductive Proofs for a Class of Forall Exists Formulas (JC, EK), pp. 118–132.
CADE-1994-Eriksson #calculus #editing #interactive #named: Pi: an Interactive Derivation Editor for the Calculus of Partial Inductive Definitions (LHE), pp. 821–825.
CADE-1994-Hutter #order #proving #synthesis: Synthesis of Induction Orderings for Existence Proofs (DH), pp. 29–41.
CADE-1994-Paulson #approach #implementation: A Fixedpoint Approach to Implementing (Co)Inductive Definitions (LCP), pp. 148–161.
CADE-1994-Protzen #generative #lazy evaluation: Lazy Generation of Induction Hypotheses (MP), pp. 42–56.
CADE-1994-WirthG #equation #on the: On Notions of Inductive Validity for First-Oder Equational Clauses (CPW, BG), pp. 162–176.
ICDAR-1993-Nagaishi #identification #recognition: Identifying ability of a recognition method based on the field of induction (MN), pp. 926–929.
TLCA-1993-Paulin-Mohring #coq: Inductive Definitions in the system Coq — Rules and Properties (CPM), pp. 328–345.
ICML-1993-Caruana #bias #knowledge-based #learning #multi: Multitask Learning: A Knowledge-Based Source of Inductive Bias (RC), pp. 41–48.
ICML-1993-ClarkM #learning #modelling #using: Using Qualitative Models to Guide Inductive Learning (PC, SM), pp. 49–56.
ICML-1993-Mladenic #combinator #concept #learning #optimisation: Combinatorial Optimization in Inductive Concept Learning (DM), pp. 205–211.
ICML-1993-MusickCR #database #scalability: Decision Theoretic Subsampling for Induction on Large Databases (RM, JC, SJR), pp. 212–219.
ICML-1993-Rymon #problem: An SE-tree based Characterization of the Induction Problem (RR), pp. 268–275.
SEKE-1993-MineauGM #clustering #concept #modelling: Induction of Generic Data Models by Conceptual Clustering (GWM, RG, RM), pp. 554–564.
LOPSTR-1993-BergadanoG #logic programming #source code #synthesis: Inductive Synthesis of Logic Programs and Inductive Logic Programming (FB, DG), pp. 45–56.
LOPSTR-1993-Grobelnik #prolog #source code: Induction of Prolog Programs with Markus (MG), pp. 57–63.
PEPM-1993-Lawall #partial evaluation #proving #using: Proofs by Structural Induction using Partial Evaluation (JLL), pp. 155–166.
TAPSOFT-1993-Becker #confluence #equation #proving #specification: Proving Ground Confluence and Inductive Validity in Constructor Based Equational Specifications (KB0), pp. 46–60.
CAV-1993-GuptaF #parametricity #representation #using: Parametric Circuit Representation Using Inductive Boolean Functions (AG, ALF), pp. 15–28.
ICLP-1993-McCarty #higher-order #logic #prolog #proving #source code: Proving Inductive Properties of Prolog Programs in Second-Order Intuitionistic Logic (LTM), pp. 44–63.
ILPS-1993-Raedt #logic programming: A Brief Introduction to Inductive Logic Programming (LDR), pp. 45–51.
CIKM-1992-KeenR #approximate #database #dependence: Inductive Dependencies and Approximate Databases (DK, AR), pp. 98–114.
ML-1992-BalaMW: The Principal Axes Method for Constructive Induction (JWB, RSM, JW), pp. 20–29.
ML-1992-Carpineto #consistency #performance: Trading Off Consistency and Efficiency in version-Space Induction (CC), pp. 43–48.
ML-1992-FengM #higher-order #logic #towards: Towards Inductive Generalization in Higher Order Logic (CF, SM), pp. 154–162.
ML-1992-IbaL: Induction of One-Level Decision Trees (WI, PL), pp. 233–240.
ML-1992-Janikow #contest #learning: Combining Competition and Cooperation in Supervised Inductive Learning (CZJ), pp. 241–248.
ML-1992-LapointeM #named #performance #recursion #source code: Sub-unification: A Tool for Efficient Induction of Recursive Programs (SL, SM), pp. 273–281.
ML-1992-OliveiraS #feature model #using: Constructive Induction Using a Non-Greedy Strategy for Feature Selection (ALO, ALSV), pp. 355–360.
SEKE-1992-ReynoldsMZ #using: Extracting Procedural Knowledge from Software Systems Using Inductive Leaning in the PM system (RGR, JIM, EZ), pp. 131–139.
LOPSTR-1992-FribourgO #logic programming #source code: A Unifying View of Structural Induction and Computation Induction for Logic Programs (LF, HO), pp. 46–60.
PLDI-1992-Wolfe: Beyond Induction Variables (MW), pp. 162–174.
POPL-1992-CousotC #abstract interpretation #semantics: Inductive Definitions, Semantics and Abstract Interpretation (PC, RC), pp. 83–94.
DAC-1992-RhoS #verification: Inductive Verification of Iterative Systems (JKR, FS), pp. 628–633.
CADE-1992-HuaZ #named: FRI: Failure-Resistant Induction in RRL (XH, HZ), pp. 691–695.
CADE-1992-ZhangH #proving #set #theorem: Proving the Chinese Remainder Theorem by the Cover Set Induction (HZ, XH), pp. 431–445.
CSL-1992-GradelO #finite: Inductive Definability with Counting on Finite Structures (EG, MO), pp. 231–247.
RTA-1991-Avenhaus #equation #proving #theorem: Proving Equational and Inductive Theorems by Completion and Embedding Techniques (JA), pp. 361–373.
KDD-1991-CaiCH #database #relational: Attribute-Oriented Induction in Relational Databases (YC, NC, JH), pp. 213–228.
KDD-1991-Frawley #statistics #using: Using Functions to Encode Domain and Contextual Knowledge in Statistical Induction (WJF), pp. 261–276.
KDD-1991-ManagoK: Induction of Decision Trees from Complex Structured Data (MM, YK), pp. 289–308.
KDD-1991-Pednault #encoding: Minimal-Length Encoding and Inductive Inference (EPDP), pp. 71–92.
KDD-1991-SmythG #using: Rule Induction Using Information Theory (PS, RMG), pp. 159–176.
ML-1991-Aha #approach #incremental: Incremental Constructive Induction: An Instance-Based Approach (DWA), pp. 117–121.
ML-1991-CallanU #approach: A Transformational Approach to Constructive Induction (JPC, PEU), pp. 122–126.
ML-1991-Drastal: Informed Pruning in Constructive Induction (GD), pp. 132–136.
ML-1991-GunschR: Opportunistic Constructive Induction (GHG, LAR), pp. 147–152.
ML-1991-Kadie #learning: Quantifying the Value of Constructive Induction, Knowledge, and Noise Filtering on Inductive Learning (CMK), pp. 153–157.
ML-1991-LeckieZ #approach #learning: Learning Search Control Rules for Planning: An Inductive Approach (CL, IZ), pp. 422–426.
ML-1991-LengB: Constructive Induction on Symbolic Features (BL, BGB), pp. 163–167.
ML-1991-Matheus: The Need for Constructive Induction (CJM), pp. 173–177.
ML-1991-MooneyO #refinement: Constructive Induction in Theory Refinement (RJM, DO), pp. 178–182.
ML-1991-MurphyP: Constructive Induction of M-of-N Terms (PMM, MJP), pp. 183–187.
ML-1991-Quinlan #logic programming: Determinate Literals in Inductive Logic Programming (JRQ), pp. 442–446.
ML-1991-Rouveirol: Completeness for Inductive Procedures (CR), pp. 452–456.
ML-1991-Schlimmer #consistency #database #learning: Database Consistency via Inductive Learning (JCS), pp. 640–644.
ML-1991-SilversteinP #learning #relational: Relational Clichés: Constraining Induction During Relational Learning (GS, MJP), pp. 203–207.
ML-1991-TowellCS #knowledge-based #network: Constructive Induction in Knowledge-Based Neural Networks (GGT, MC, JWS), pp. 213–217.
ML-1991-Walczak #performance #predict: Predicting Actions from Induction on Past Performance (SW), pp. 275–279.
ML-1991-WatanabeY #3d: Decision Tree Induction of 3-D Manufacturing Features (LW, SY), pp. 650–654.
ML-1991-Yeung #approach #network: A Neural Network Approach to Constructive Induction (DYY), pp. 228–232.
LOPSTR-1991-JantkeG #synthesis: Inductive Synthesis of Rewrite Rules as Program Synthesis (KPJ, UG), pp. 65–68.
LOPSTR-1991-WigginsBKH #logic programming #proving #source code #synthesis: Synthesis and Transfomation of Logic Programs from Constructive, Inductive Proof (GAW, AB, IK, JH), pp. 27–45.
CAV-1991-Nesi #higher-order #logic #process #proving #specification: Mechanizing a Proof by Induction of Process Algebrs Specifications in Higher Order Logic (MN), pp. 288–298.
ISLP-1991-Fribourg #automation #generative #proving: Automatic Generation of Simplification Lemmas for Inductive Proofs (LF), pp. 103–116.
ML-1990-CarlsonWF #concept: Search Control, Utility, and Concept Induction (BMC, JBW, DHF), pp. 85–92.
ML-1990-ChanW #analysis #learning #performance #probability: Performance Analysis of a Probabilistic Inductive Learning System (KCCC, AKCW), pp. 16–23.
ML-1990-Hume #learning: Learning Procedures by Environment-Driven Constructive Induction (DVH), pp. 113–121.
ML-1990-Velde #incremental: Incremental Induction of Topologically Minimal Trees (WVdV), pp. 66–74.
SEKE-1990-EstevaR #learning #reuse: Learning to Recognize Reusable Software by Induction (JCE, RGR), pp. 19–24.
PLDI-1990-AmmarguellatH #abstract interpretation #automation #recognition: Automatic Recognition of Induction Variables and Recurrence Relations by Abstract Interpretation (ZA, WLHI), pp. 283–295.
CADE-1990-BundyHSI #proving: Extensions to the Rippling-Out Tactic for Guiding Inductive Proofs (AB, FvH, AS, AI), pp. 132–146.
CADE-1990-Gramlich #named #proving #theorem proving: UNICOM: A Refined Completion Based Inductive Theorem Prover (BG), pp. 655–656.
CADE-1990-Hutter #proving: Guiding Induction Proofs (DH), pp. 147–161.
CADE-1990-Reddy #term rewriting: Term Rewriting Induction (USR), pp. 162–177.
CLP-1990-Fribourg90 #execution #logic programming #prolog #proving #source code: Extracting Logic Programs from Proofs that Use Extended Prolog Execution and Induction (LF), pp. 685–699.
LICS-1990-Freyd #recursion: Recursive Types Reduced to Inductive Types (PJF), pp. 498–507.
PODS-1989-LakshmananM #datalog #game studies #power of: Inductive Pebble Games and the Expressive Power of Datalog (VSL, AOM), pp. 301–310.
RTA-1989-Comon #proving #specification: Inductive Proofs by Specification Transformation (HC), pp. 76–91.
RTA-1989-Vorobyov: Conditional Rewrite Rule Systems with Built-In Arithmetic and Induction (SGV), pp. 492–512.
KR-1989-Helft: Induction as Nonmonotonic Inference (NH), pp. 149–156.
ML-1989-BergadanoGP #deduction #learning #top-down: Deduction in Top-Down Inductive Learning (FB, AG, SP), pp. 23–25.
ML-1989-CaruanaSE #algorithm #bias #multi #search-based #using: Using Multiple Representations to Improve Inductive Bias: Gray and Binary Coding for Genetic Algorithms (RC, JDS, LJE), pp. 375–378.
ML-1989-Chan #learning: Inductive Learning with BCT (PKC), pp. 104–108.
ML-1989-Danyluk #bias #information management: Finding New Rules for Incomplete Theories: Explicit Biases for Induction with Contextual Information (APD), pp. 34–36.
ML-1989-Dietterich #learning: Limitations on Inductive Learning (TGD), pp. 124–128.
ML-1989-DrastalMR #fault: Error Correction in Constructive Induction (GD, RM, SR), pp. 81–83.
ML-1989-FriedrichN #algorithm #learning #using: Using Domain Knowledge to Improve Inductive Learning Algorithms for Diagnosis (GF, WN), pp. 75–77.
ML-1989-Gaines #data-driven #database #empirical #statistics #trade-off: An Ounce of Knowledge is Worth a Ton of Data: Quantitative studies of the Trade-Off between Expertise and Data Based On Statistically Well-Founded Empirical Induction (BRG), pp. 156–159.
ML-1989-GoodmanS #algorithm #probability #set: The Induction of Probabilistic Rule Sets — The Itrule Algorithm (RMG, PS), pp. 129–132.
ML-1989-Manago: Knowledge Intensive Induction (MM), pp. 151–155.
ML-1989-Mehra #framework: Constructive Induction Framework (PM), pp. 474–475.
ML-1989-MooneyO #aspect-oriented #concept #learning: Induction Over the Unexplained: Integrated Learning of Concepts with Both Explainable and Conventional Aspects (RJM, DO), pp. 5–7.
ML-1989-Quinlan: Unknown Attribute Values in Induction (JRQ), pp. 164–168.
ML-1989-RaedtB: Constructive Induction by Analogy (LDR, MB), pp. 476–477.
ML-1989-Rendell: Comparing Systems and analyzing Functions to Improve Constructive Induction (LAR), pp. 461–464.
ML-1989-Spackman #detection #learning #tool support: Signal Detection Theory: Valuable Tools for Evaluating Inductive Learning (KAS), pp. 160–163.
ML-1989-SpanglerFU: Induction of Decision Trees from Inconclusive Data (WSS, UMF, RU), pp. 146–150.
CAAP-1989-Padawitz #proving: Inductive Proofs by Resolution and Paramodulation (PP), pp. 352–368.
ML-1988-BergadanoG #approach #concept: A Knowledge Intensive Approach to Concept Induction (FB, AG), pp. 305–317.
ML-1988-WisniewskiA #learning: Some Interesting Properties of a Connectionist Inductive Learning System (EJW, JAA), pp. 181–187.
ALP-1988-HofbauerK #proving #term rewriting #theorem: Proving Inductive Theorems Based on Term Rewriting Systems (DH, RDK), pp. 180–190.
ALP-1988-Kucherov #algorithm #proving #testing: A New Quasi-Reducibility Testing Algorithm and its Application to Proofs by Induction (GK), pp. 204–213.
POPL-1988-GarlandG #data type #reasoning: Inductive Methods for Reasoning about Abstract Data Types (SJG, JVG), pp. 219–228.
CADE-1988-Bundy #proving #using: The Use of Explicit Plans to Guide Inductive Proofs (AB), pp. 111–120.
CADE-1988-ZhangKK #equation #specification: A Mechanizable Induction Principle for Equational Specifications (HZ, DK, MSK), pp. 162–181.
JICSCP-1988-ElkanM88 #automation #logic programming #reasoning #source code: Automated Inductive Reasoning about Logic Programs (CE, DAM), pp. 876–892.
JICSCP-1988-Fribourg88 #prolog #source code: Equivalence-Preserving Transformations of Inductive Properties of Prolog Programs (LF), pp. 893–908.
AS-1987-Huet #calculus: Induction Principles Formalized in the Calculus of Constructions (GPH), pp. 276–286.
CFLP-1987-DrabentM #logic programming #source code: Inductive Assertion Method for Logic Programs (WD, JM), pp. 167–181.
CSL-1987-Jager: Induction in the Elementary Theory of Types and Names (GJ), pp. 118–128.
ICLP-1987-Helm87 #deduction #logic programming #source code: Inductive and Deductive Control of Logic Programs (RH), pp. 488–512.
ICALP-1986-Fribourg #strict: A Strong Restriction of the Inductive Completion Procedure (LF), pp. 105–115.
CADE-1986-BiundoHHW #proving #theorem proving: The Karlsruhe Induction Theorem Proving System (SB, BH, DH, CW), pp. 672–674.
CADE-1986-KanamoriF #prolog #source code #verification: Formulation of Induction Formulas in Verification of Prolog Programs (TK, HF), pp. 281–299.
CADE-1986-KapurNZ #proving #testing #using: Proof by Induction Using Test Sets (DK, PN, HZ), pp. 99–117.
CADE-1986-Toyama #equivalence #how #term rewriting: How to Prove Equivalence of Term Rewriting Systems without Induction (YT), pp. 118–127.
ICLP-1986-KawaiMKT86 #framework #logic programming: A Framework for ICAI Systems Based on Inductive Inference and Logic Programming (KK, RM, OK, JT), pp. 188–202.
LICS-1986-JouannaudK #automation #equation #proving: Automatic Proofs by Induction in Equational Theories Without Constructors (JPJ, EK), pp. 358–366.
LICS-1986-KapurM #reasoning #specification: Inductive Reasoning with Incomplete Specifications (DK, DRM), pp. 367–377.
CADE-1984-Kirchner84a #algorithm #data type: A General Inductive Completion Algorithm and Application to Abstract Data Types (HK), pp. 282–302.
ICALP-1982-CaseL #identification: Machine Inductive Inference and Language Identification (JC, CL), pp. 107–115.
ICALP-1982-HarelK #programming language #set: A Programming Language for the Inductive Sets, and Applications (DH, DK), pp. 313–329.
POPL-1980-Musser #data type #on the #proving: On Proving Inductive Properties of Abstract Data Types (DRM), pp. 154–162.
STOC-1980-Pratt #algebra: Dynamic Algebras and the Nature of Induction (VRP), pp. 22–28.
CADE-1980-Guguen #algebra #how: How to Prove Algebraic Inductive Hypotheses Without Induction (JAG), pp. 356–373.
ICALP-1978-Wiehagen #formal method #problem: Characterization Problems in the Theory of Inductive Inference (RW), pp. 494–508.
STOC-1978-CaseS: Anomaly Hierarchies of Mechanized Inductive Inference (JC, CS), pp. 314–319.
POPL-1976-FongU: Induction Variables in Very High Level Languages (ACF, JDU), pp. 104–112.
ICSE-1976-ReynoldsY #verification: Induction as the Basis for Program Verification (CR, RTY), p. 389.
POPL-1973-HewittBGSMS: Actor Induction and Meta-Evaluation (CH, PB, IG, BCS, TM, RS), pp. 153–168.
ICALP-1972-HitchcockP #proving #termination: Induction Rules and Termination Proofs (PH, DMRP), pp. 225–251.