Relevant bibliographies by topics / Inductive

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Inductive'

Author: Grafiati
Published: 4 June 2021
Last updated: 16 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Inductive.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Inductive"

1

Pelman, Alik. "Revisiting Inductive Confirmation in Science: A Puzzle and a Solution." Philosophies 9, no. 6 (2024): 171. http://dx.doi.org/10.3390/philosophies9060171.

Full text
Abstract:
When an empirical prediction E of hypothesis H is observed to be true, such observation is said to confirm, i.e., support (although not prove) the truth of the hypothesis. But why? What justifies the claim that such evidence supports the hypothesis? The widely accepted answer is that it is justified by induction. More specifically, it is commonly held that the following argument, (1) If H then E; (2) E; (3) Therefore, (probably) H (here referred to as ‘hypothetico-deductive confirmation argument’), is inductively strong. Yet this argument looks nothing like an inductive generalization, i.e., it does not seem inductive in the term’s traditional, enumerative sense. If anything, it has the form of the fallacy of affirming the consequent. This paper aims to solve this puzzle. True, in recent decades, ‘induction’ has been sometimes used more broadly to encompass any non-deductive, i.e., ampliative, argument. Applying Bayesian confirmation theory has famously demonstrated that hypothetico-deductive confirmation is indeed inductive in this broader, ampliative sense. Nonetheless, it will be argued here that, despite appearance, hypothetico-deductive confirmation can also be recast as enumerative induction. Hence, by being enumeratively inductive, the scientific method of hypothetico-deductive confirmation is justified through this traditional, more restrictive type of induction rather than merely by ampliative induction.
APA, Harvard, Vancouver, ISO, and other styles
2

Prinz, Jacob, and Leonidas Lampropoulos. "Merging Inductive Relations." Proceedings of the ACM on Programming Languages 7, PLDI (2023): 1759–78. http://dx.doi.org/10.1145/3591292.

Full text
Abstract:
Inductive relations offer a powerful and expressive way of writing program specifications while facilitating compositional reasoning. Their widespread use by proof assistant users has made them a particularly attractive target for proof engineering tools such as QuickChick, a property-based testing tool for Coq which can automatically derive generators for values satisfying an inductive relation. However, while such generators are generally efficient, there is an infrequent yet seemingly inevitable situation where their performance greatly degrades: when multiple inductive relations constrain the same piece of data. In this paper, we introduce an algorithm for merging two such inductively defined properties that share an index. The algorithm finds shared structure between the two relations, and creates a single merged relation that is provably equivalent to the conjunction of the two. We demonstrate, through a series of case studies, that the merged relations can improve the performance of automatic generation by orders of magnitude, as well as simplify mechanized proofs by getting rid of the need for nested induction and tedious low-level book-keeping.
APA, Harvard, Vancouver, ISO, and other styles
3

He, Li Ping, Zong Zhang Chen, and Yiu Wing Mai. "Induction Ability of CAA and Anti-Corrosion Property of Inductively Formed Apatite/Al2O3." Advanced Materials Research 41-42 (April 2008): 75–80. http://dx.doi.org/10.4028/www.scientific.net/amr.41-42.75.

Full text
Abstract:
Ca-containing anodic alumina (CAA) has been successfully prepared by anodizing Al film in an alkali solution at a constant voltage and subsequently electro-depositing calcium salts on and into porous anodic alumina. This paper studied the induction ability of Ca-containing anodic alumina (CAA) for calcium phosphates salts by immersing CAA in a simulated body fluid (SBF). The morphologies and compositions of the inductive coating are studied in depth using SEM and XRD. The results show that the porous Ca-containing anodic alumina (CAA) exhibits good induction ability of calcium phosphates in SBF. The Ca/P atomic ratio of the inductive coating on CAA after 7 days immersion in SBF is of 1.68 and the inductive coating on CAA is apatite. Consequently apatite /Al2O3 (anodic) composite has been obtained after apatite inductively formed on Ca-containing anodic alumina. Tafel polarization test indicates that apatite /Al2O3 composite has good anti-corrosion ability in simulated body environment. Therefore, Ca-containing anodic alumina films are promising substrates for fabricating functional coatings and its inductively formed apatite/Al2O3 composite is a promising material for hard tissue repair applications.
APA, Harvard, Vancouver, ISO, and other styles
4

Zhang, Xiuren, David G. Himelrick, Floyd M. Woods, and Robert C. Ebel. "Effect of Temperature, Photoperiod, and Pretreatment Growing Condition on Floral Induction in Spring-bearing Strawberry." HortScience 35, no. 4 (2000): 556B—556a. http://dx.doi.org/10.21273/hortsci.35.4.556b.

Full text
Abstract:
`Chandler' strawberry plants (Fragaria Xananassa Duch.) were greenhouse grown under natural lighting and then placed into growth chambers at two constant temperatures of 16 and 26 °C and 2 daylengths of 9 h (SD) and 9-h photoperiod (NI) which was night interrupted with 3 hours of incandescent radiation at 30-45 μmol·s-1·m-2 PAR. Plants were given different numbers of inductive cycles in growth chambers and then moved to the greenhouse. Flowering and growth were monitored. Flowering was completely inhibited at 26 °C, regardless of pretreatment growing conditions such as pot sizes and plant ages, photoperiod, and inductive cycles. At 16 °C, SD promoted floral induction compared to NI under all inductive cycles except a 7-day induction. The minimum number of inductive cycles required at 16 °C for floral induction was dependent on photoperiod and prior greenhouse treatment. Flowering rate was also affected by greenhouse treatment, photoperiod, and inductive cycles. Runner production was affected by photoperiod and temperature × inductive cycle.
APA, Harvard, Vancouver, ISO, and other styles
5

Misra, Kanishka. "On Semantic Cognition, Inductive Generalization, and Language Models." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 11 (2022): 12894–95. http://dx.doi.org/10.1609/aaai.v36i11.21584.

Full text
Abstract:
My doctoral research focuses on understanding semantic knowledge in neural network models trained solely to predict natural language (referred to as language models, or LMs), by drawing on insights from the study of concepts and categories grounded in cognitive science. I propose a framework inspired by 'inductive reasoning,' a phenomenon that sheds light on how humans utilize background knowledge to make inductive leaps and generalize from new pieces of information about concepts and their properties. Drawing from experiments that study inductive reasoning, I propose to analyze semantic inductive generalization in LMs using phenomena observed in human-induction literature, investigate inductive behavior on tasks such as implicit reasoning and emergent feature recognition, and analyze and relate induction dynamics to the learned conceptual representation space.
APA, Harvard, Vancouver, ISO, and other styles
6

Sterkenburg, Tom F. "THE META-INDUCTIVE JUSTIFICATION OF INDUCTION." Episteme 17, no. 4 (2019): 519–41. http://dx.doi.org/10.1017/epi.2018.52.

Full text
Abstract:
ABSTRACTI evaluate Schurz's proposed meta-inductive justification of induction, a refinement of Reichenbach's pragmatic justification that rests on results from the machine learning branch of prediction with expert advice.My conclusion is that the argument, suitably explicated, comes remarkably close to its grand aim: an actual justification of induction. This finding, however, is subject to two main qualifications, and still disregards one important challenge.The first qualification concerns the empirical success of induction. Even though, I argue, Schurz's argument does not need to spell out what inductive method actually consists in, it does need to postulate that there is something like the inductive or scientific prediction strategy that has so far been significantly more successful than alternative approaches. The second qualification concerns the difference between having a justification for inductive method and for sticking with induction for now. Schurz's argument can only provide the latter. Finally, the remaining challenge concerns the pool of alternative strategies, and the relevant notion of a meta-inductivist's optimality that features in the analytic step of Schurz's argument. Building on the work done here, I will argue in a follow-up paper that the argument needs a stronger dynamic notion of a meta-inductivist's optimality.
APA, Harvard, Vancouver, ISO, and other styles
7

Buntine, Wray. "Inductive knowledge acquisition and induction methodologies." Knowledge-Based Systems 2, no. 1 (1989): 52–61. http://dx.doi.org/10.1016/0950-7051(89)90008-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yagola, G. K., D. R. Vasil'ev, and Yu I. Kazantsev. "Hyperconducting inductive measure of magnetic induction." Measurement Techniques 28, no. 5 (1985): 401–4. http://dx.doi.org/10.1007/bf00864929.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Tsukada, Takeshi, and Hiroshi Unno. "Inductive Approach to Spacer." Proceedings of the ACM on Programming Languages 8, PLDI (2024): 1979–2002. http://dx.doi.org/10.1145/3656457.

Full text
Abstract:
The constrained Horn clause satisfiability problem is at the core of many automated verification methods, and Spacer is one of the most efficient solvers of this problem. The standard description of Spacer is based on an abstract transition system, dividing the whole procedure into small rules. This division makes individual rules easier to understand but, conversely, makes it difficult to discuss the procedure as a whole. As evidence of the difficulty in understanding the whole procedure, we point out that the claimed refutational completeness actually fails for several reasons, some of which were not present in the original version and subsequently added. It is also difficult to grasp the differences between Spacer and another procedure, such as GPDR. This paper aims to provide a better understanding of Spacer by developing a Spacer-like procedure defined by structural induction. We first formulate the problem to be solved inductively, then give its naïve solver and transform it to obtain a Spacer-like procedure. Interestingly, our inductive approach almost unifies Spacer and GPDR, which differ in only one respect in our understanding. To demonstrate the usefulness of our inductive approach in understanding Spacer, we examine Spacer variants in the literature in terms of inductive procedures and discuss why they are not refutationally complete and how to fix them. We also implemented the proposed procedure and evaluated it experimentally.
APA, Harvard, Vancouver, ISO, and other styles
10

Dybjer, Peter. "A general formulation of simultaneous inductive-recursive definitions in type theory." Journal of Symbolic Logic 65, no. 2 (2000): 525–49. http://dx.doi.org/10.2307/2586554.

Full text
Abstract:
AbstractThe first example of a simultaneous inductive-recursive definition in intuitionistic type theory is Martin-Löfs universe à la Tarski. A set U0of codes for small sets is generated inductively at the same time as a function T0, which maps a code to the corresponding small set, is defined by recursion on the way the elements of U0are generated.In this paper we argue that there is an underlyinggeneralnotion of simultaneous inductive-recursive definition which is implicit in Martin-Löf's intuitionistic type theory. We extend previously given schematic formulations of inductive definitions in type theory to encompass a general notion of simultaneous induction-recursion. This enables us to give a unified treatment of several interesting constructions including various universe constructions by Palmgren, Griffor, Rathjen, and Setzer and a constructive version of Aczel's Frege structures. Consistency of a restricted version of the extension is shown by constructing a realisability model in the style of Allen.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Inductive"

1

Forsberg, Fredrik Nordvall. "Inductive-inductive definitions." Thesis, Swansea University, 2013. https://cronfa.swan.ac.uk/Record/cronfa43083.

Full text
Abstract:
The principle of inductive-inductive definitions is a principle for defining data types in Martin-Lof Type Theory. It allows the definition of a set A, simultaneously defined w ith a family B : A → Set indexed over A. Such forms of definitions have been used by several authors in order to for example define the syntax of Type Theory in Type Theory itself. This thesis gives a theoretical justification for their use. We start by giving a finite axiomatisation of a type theory with inductive-inductive definitions in the style of Dybjer and Setzer's axiomatisation of inductive-recursive definitions. We then give a categorical characterisation of inductive-inductive definitions as initial objects in a certain category. This is presented using a general framework for elimination rules based on the concept of a Category with Families. To show consistency of inductive-inductive definitions, a set-theoretical model is constructed. Furthermore, we give a translation of our theory with a simplified form of the elimination rule into the already existing theory of indexed inductive definitions. This translation does not seem possible for the general elimination rule. Extensions to the theory are investigated, such as a combined theory of inductive-inductive-recursive definitions, more general forms of indexing and arbitrarily high (finite) towers of inductive-inductive definitions. Even so, not all uses of inductive-inductive definitions in the literature (in particular the syntax of Type Theory) are covered by the theories presented. Finally, two larger, novel case studies of the use of inductive-inductive definitions are presented: Conway's Surreal numbers and a formalisation of positive inductive-recursive definitions.
APA, Harvard, Vancouver, ISO, and other styles
2

Dijkstra, Gabe. "Quotient inductive-inductive definitions." Thesis, University of Nottingham, 2017. http://eprints.nottingham.ac.uk/42317/.

Full text
Abstract:
In this thesis we present a theory of quotient inductive-inductive definitions, which are inductive-inductive definitions extended with constructors for equations. The resulting theory is an improvement over previous treatments of inductive-inductive and indexed inductive definitions in that it unifies and generalises these into a single framework. The framework can also be seen as a first approximation towards a theory of higher inductive types, but done in a set truncated setting. We give the type of specifications of quotient inductive-inductive definitions mutually with its interpretation as categories of algebras. A categorical characterisation of the induction principle is given and is shown to coincide with the property of being an initial object in the categories of algebras. From the categorical characterisation of induction, we derive a more type theoretic induction principle for our quotient inductive-inductive definitions that looks like the usual induction principles. The existence of initial objects in the categories of algebras associated to quotient inductive-inductive definitions is established for a class of definitions. This is done by a colimit construction that can be carried out in type theory itself in the presence of natural numbers, sum types and quotients or equivalently, coequalisers.
APA, Harvard, Vancouver, ISO, and other styles
3

KUSAKARI, Keiichirou, Masahiko SAKAI, and Toshiki SAKABE. "Primitive Inductive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting." IEICE, 2005. http://hdl.handle.net/2237/9580.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hill, Alexandra. "Reasoning by analogy in inductive logic." Thesis, University of Manchester, 2013. https://www.research.manchester.ac.uk/portal/en/theses/reasoning-by-analogy-in-inductive-logic(039622d8-ab3f-418f-b46c-4d4e7a9eb6c1).html.

Full text
Abstract:
This thesis investigates ways of incorporating reasoning by analogy into Pure (Unary) Inductive Logic. We start with an analysis of similarity as distance, noting that this is the conception that has received most attention in the literature so far. Chapter 4 looks in some detail at the consequences of adopting Hamming Distance as our measure of similarity, which proves to be a strong requirement. Chapter 5 then examines various adaptations of Hamming Distance and proposes a subtle modification, further-away-ness, that generates a much larger class of solutions.
APA, Harvard, Vancouver, ISO, and other styles
5

Lindblom, Adam. "Inductive Pulse Generation." Doctoral thesis, Uppsala : Acta Universitatis Upsaliensis : Univ.-bibl. [distributör], 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-6699.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zebulske, Terry E. "Inductive Bible study methodology." Theological Research Exchange Network (TREN), 1988. http://www.tren.com.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kehris, Evangelos. "Incremental inductive interactive simulation." Thesis, Lancaster University, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.302936.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ray, Oliver. "Hybrid abductive inductive learning." Thesis, Imperial College London, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.428111.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Davies, Winton H. E. "Communication of inductive inference." Thesis, University of Aberdeen, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.400670.

Full text
Abstract:
This thesis addresses the question: "How can knowledge learnt through inductive inference be communicated in a multi-agent system?". Existing agent communication languages, such as KQML, assume logically sound inference methods. Unfortunately, induction is logically unsound. In general, machine learning techniques infer knowledge (or hypotheses) consistent with the locally available facts. However, in a multi-agent system, hypotheses learnt by one agent can directly contradict knowledge held by another. If an agent communicates induced knowledge as though it were logically sound, then the knowledge held by other agents in the community may become inconsistent. The answer we present in this thesis is that agents must, in general, communicate the bounds to such induced knowledge. The Version Space framework characterises inductive inference as a process which identifies the set of hypotheses that are consistent with both the observable facts and the constraints of the hypothesis description language. A Version Space can be expressed by two boundary sets, which represent the most general and most specific hypotheses. We thus propose that when communicating an induced hypothesis, that the hypothesis be bounded by descriptions of the most general and most specific hypotheses. In order to allow agents to integrate induced hypotheses with their own facts or their own induced hypotheses, the technique of Version Space Intersection can be used. We have investigated how boundary set descriptions can be generated for the common case of machine learning algorithms which learn hypotheses from unrestricted Version Spaces. This is a hard computational problem, as it is the equivalent of finding the minimal DNF description of a set of logical sentences. We consider four alternate approaches: exact minimization using the Quine-McCluskey algorithm; a naive, information-theoretic hill-climbing search; Espresso II, a sophisticated, heuristic logic minimization algorithm; and unsound approximation techniques. We demonstrate that none of these techniques are scalable to realistic machine learning problems.
APA, Harvard, Vancouver, ISO, and other styles
10

Pascoe, James. "The evoluation of 'Boxes' to quantized inductive learning : a study in inductive learning /." Thesis, This resource online, 1996. http://scholar.lib.vt.edu/theses/available/etd-12172008-063016/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Inductive"

1

Van Schuylenbergh, Koenraad, and Robert Puers, eds. Inductive Powering. Springer Netherlands, 2009. http://dx.doi.org/10.1007/978-90-481-2412-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gabbay, Dov M. Inductive Logic. North Holland [Imprint], 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Katzouris, Nikos, and Alexander Artikis, eds. Inductive Logic Programming. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-97454-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Riguzzi, Fabrizio, and Filip Železný, eds. Inductive Logic Programming. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38812-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Riguzzi, Fabrizio, Elena Bellodi, and Riccardo Zese, eds. Inductive Logic Programming. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-99960-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Cussens, James, and Alan Frisch, eds. Inductive Logic Programming. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44960-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Davis, Jesse, and Jan Ramon, eds. Inductive Logic Programming. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23708-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Cussens, James, and Alessandra Russo, eds. Inductive Logic Programming. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-63342-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kazakov, Dimitar, and Can Erten, eds. Inductive Logic Programming. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-49210-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Rouveirol, Céline, and Michéle Sebag, eds. Inductive Logic Programming. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44797-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Inductive"

1

Nordvall Forsberg, Fredrik, and Anton Setzer. "Inductive-Inductive Definitions." In Computer Science Logic. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15205-4_35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Day, John Patrick. "Inductive Reasoning and Inductive Logic." In Inductive Probability. Routledge, 2021. http://dx.doi.org/10.4324/9781003244356-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Altenkirch, Thorsten, Paolo Capriotti, Gabe Dijkstra, Nicolai Kraus, and Fredrik Nordvall Forsberg. "Quotient Inductive-Inductive Types." In Lecture Notes in Computer Science. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89366-2_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Anthony, Simon, and Alan M. Frisch. "Cautious induction in inductive logic programming." In Inductive Logic Programming. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3540635149_34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Schickore, Jutta. "Analysis and Induction as Methods of Empirical Inquiry." In Archimedes. Springer Nature Switzerland, 2024. https://doi.org/10.1007/978-3-031-76398-4_12.

Full text
Abstract:
AbstractThis chapter traces the history of the notions of analysis and induction in German-language accounts of scientific inquiry between the mid-eighteenth and mid-nineteenth centuries. Many eighteenth-century scholars perceived analysis and induction as intertwined and tied to methods of empirical inquiry and discovery, as they had been perceived in the early modern period. Until well into the nineteenth century, the terms “(scientific) induction” or “inductive science” referred to any experience-based science (as opposed to a science based on first principles). Inductive science, thus understood, encompassed the making, evaluation, and testing of hypotheses—even of hypotheses about unobservable things—and “reduction” rather than “deduction” was its opposite. While the Kantian understanding of analysis influenced the notions of induction and scientific method, it did not wholly alter their interpretation. After Kant, formal logic and philosophy gradually became independent, but a more applied philosophy of empirical inquiry also persisted, linked to scientific practice while rooted in older ideas about analytic and inductive methods. Several authors recommended evaluating and testing hypotheses by deriving testable consequences but did not consider hypothesis testing to be a strictly deductive process opposed to, or more powerful than, induction. Inductive inquiry and the hypothetico-deductive (H-D) method are both integral to the inductive sciences, according to these pragmatic theories of empirical inquiry.
APA, Harvard, Vancouver, ISO, and other styles
6

Falke, Stephan, and Deepak Kapur. "Inductive Decidability Using Implicit Induction." In Logic for Programming, Artificial Intelligence, and Reasoning. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11916277_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Day, John Patrick. "Inductive Probabilification by Elimination." In Inductive Probability. Routledge, 2021. http://dx.doi.org/10.4324/9781003244356-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Day, John Patrick. "Functional Inductive Probabilification-Judgement-Formulas." In Inductive Probability. Routledge, 2021. http://dx.doi.org/10.4324/9781003244356-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Day, John Patrick. "Other Alleged Determinants of Inductive Probability." In Inductive Probability. Routledge, 2021. http://dx.doi.org/10.4324/9781003244356-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Day, John Patrick. "Subject-Predicate Inductive Probabilification-Judgement-Formulas." In Inductive Probability. Routledge, 2021. http://dx.doi.org/10.4324/9781003244356-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Inductive"

1

Almadani, Fawzi, Muhammad Zaid, Patrick Gaydecki, and Graham Miller. "Signal Profiles and Images of Corroded Steel Bars in Concrete Generated by Inductive Scanning Technique Using Heterodyning Sensor." In CORROSION 2010. NACE International, 2010. https://doi.org/10.5006/c2010-10167.

Full text
Abstract:
Abstract The inductive scanning system is a non-destructive testing technique that utilizes the phenomenon of eddy current induction and detection for imaging steel reinforcing bars embedded within concrete. In this paper the inductive scanning system using a heterodyning sensor in combination with real time digital signal processing (DSP) has been used to detect and generate images of corroded reinforced steel bars embedded within the concrete. The sensor generates a vector of voltage values of the reinforced bars scanned at a spatial interval. These voltage values are processed by the DSP to produce voltage signals and generate images. The feasibility of exploiting the inductive scanning system to detect and distinguish different amounts of corrosion on steel bars embedded in concrete was investigated by using one-dimensional scanning techniques, such as parallel line scans and orthogonal line scans for single and multiple corroded steel bars. In these techniques, signal profiles of various amounts of corrosion on steel bars were compared and analysed. The system shows evidence of very good performance which encourages its development and use in corrosion detection and monitoring.
APA, Harvard, Vancouver, ISO, and other styles
2

Schulze, Max, Yorck Zisgen, Moritz Kirschte, Esfandiar Mohammadi, and Agnes Koschmider. "Differentially Private Inductive Miner." In 2024 6th International Conference on Process Mining (ICPM). IEEE, 2024. http://dx.doi.org/10.1109/icpm63005.2024.10680684.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tehori, A., C. Leibowitz, J. Shiloh, and S. Eckhouse. "EMP Inductive Injection System." In 8th International Zurich Symposium and Technical Exhibition on Electromagnetic Compatibility. IEEE, 1989. https://doi.org/10.23919/emc.1989.10779193.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Dollhofer, Benjamin, Christian Krämer, Niki Nouri1, Stefan Dietrich, and Volker Schulze1. "Characterization of Martensitic-Bainitic Mixed Microstructures Created by Inductive Short Time Austempering of AISI 4140." In IFHTSE 2024. ASM International, 2024. http://dx.doi.org/10.31399/asm.cp.ifhtse2024p0041.

Full text
Abstract:
Abstract Induction surface hardening is a process often used in industrial applications to efficiently increase the lifetime of components. Recently, this process has been enhanced with the inductive short time austempering process, creating a martensitic-bainitic microstructure. It is well-known that in homogeneous mixed microstructures, an optimally adjusted volume fraction of bainite can significantly increase the lifetime of the components even further. Regarding inductive short time austempering, there is a lack of knowledge in characterizing and differentiating graded microstructures, which occur due to the temperature gradients within the process. Therefore, three methods were investigated: the analysis of the grayscale profile of metallographic sections, the hardness profile and the full width at half maximum (FWHM) profile from the intensity curve (rocking curve) of the X-ray diffraction pattern. These methods were initially applied to homogeneous structures and evaluated. The findings were then transferred to graded microstructures. Finally, the graded microstructures could be differentiated both via the hardness profile and the FWHM value, while the grayscale analysis only allowed qualitative statements to be made. It became evident that both the volume fractions and their structure are crucial for subsequent mechanical characterization. Since the martensitic microstructure is easier to identify, it serves as a reliable reference for evaluating the mixed microstructure. In summary, these findings offer the foundation for further characterization of graded martensitic-bainitic mixed microstructures.
APA, Harvard, Vancouver, ISO, and other styles
5

Sato, Haruhiko, and Masahito Kurihara. "Discovering inductive theorems using rewriting induction." In 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC). IEEE, 2016. http://dx.doi.org/10.1109/smc.2016.7844370.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Nagashima, Yutaka. "Faster Smarter Proof by Induction in Isabelle/HOL." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/273.

Full text
Abstract:
We present sem_ind, a recommendation tool for proof by induction in Isabelle/HOL. Given an inductive problem, sem_ind produces candidate arguments for proof by induction, and selects promising ones using heuristics. Our evaluation based on 1,095 inductive problems from 22 source files shows that sem_ind improves the accuracy of recommendation from 20.1% to 38.2% for the most promising candidates within 5.0 seconds of timeout compared to its predecessor while decreasing the median value of execution time from 2.79 seconds to 1.06 seconds.
APA, Harvard, Vancouver, ISO, and other styles
7

Kovács, András, and Ambrus Kaposi. "Large and Infinitary Quotient Inductive-Inductive Types." In LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science. ACM, 2020. http://dx.doi.org/10.1145/3373718.3394770.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Miyamoto, S. "Inductive and non-inductive methods of clustering." In 2012 IEEE International Conference on Granular Computing (GrC-2012). IEEE, 2012. http://dx.doi.org/10.1109/grc.2012.6468710.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Aoto, Takahito, and Sorin Stratulat. "Decision Procedures for Proving Inductive Theorems without Induction." In the 16th International Symposium. ACM Press, 2014. http://dx.doi.org/10.1145/2643135.2643156.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Olsen, Dan R., and Xinyu Deng. "Inductive groups." In the 9th annual ACM symposium. ACM Press, 1996. http://dx.doi.org/10.1145/237091.237120.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Inductive"

1

Greiner, John. Programming with Inductive and Co-Inductive Types. Defense Technical Information Center, 1992. http://dx.doi.org/10.21236/ada249562.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Miller, R. B., B. B. Davis, and J. Bayless. Inductive Adder development. Office of Scientific and Technical Information (OSTI), 1989. http://dx.doi.org/10.2172/10191277.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Griffiths, Thomas. Fast, Flexible, Rational Inductive Inference. Defense Technical Information Center, 2013. http://dx.doi.org/10.21236/ada590143.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kaplan, Steven L. Summary of Inductive SiC BJT Switching. Defense Technical Information Center, 2005. http://dx.doi.org/10.21236/ada440925.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Cobb, Helen G. Inductive Biases in a Reinforcement Learner,. Defense Technical Information Center, 1992. http://dx.doi.org/10.21236/ada294127.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Nair, Lakshmi S., David Rowe, Peter Maye, and Douglas Adams. Inductive Microenvironment for Improved Osseous Integration. Defense Technical Information Center, 2012. http://dx.doi.org/10.21236/ada578636.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hall, Thomas, and Janardan Upadhyay. Improving Longitudinal Impedance of Inductive Inserts. Office of Scientific and Technical Information (OSTI), 2023. http://dx.doi.org/10.2172/2007321.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Barry, W. Inductive megahertz beam position monitors for CEBAF. Office of Scientific and Technical Information (OSTI), 1989. http://dx.doi.org/10.2172/6360210.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kinsey, J., and D. A. Ehst. Inductive currents in an rf driven plasma. Office of Scientific and Technical Information (OSTI), 1991. http://dx.doi.org/10.2172/5218308.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Gupta, Aarti, and Allan L. Fisher. Representation and Manipulation of Inductive Boolean Functions. Defense Technical Information Center, 1992. http://dx.doi.org/10.21236/ada256078.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Inductive' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography