Log in

Relevant bibliographies by topics / Elimination rule / Journal articles

To see the other types of publications on this topic, follow the link: Elimination rule.

Journal articles on the topic 'Elimination rule'

Author: Grafiati

Published: 2 June 2025

Last updated: 31 July 2025

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Elimination rule.'

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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

OLKHOVIKOV, GRIGORY K., and PETER SCHROEDER-HEISTER. "ON FLATTENING ELIMINATION RULES." Review of Symbolic Logic 7, no. 1 (2014): 60–72. http://dx.doi.org/10.1017/s1755020313000385.

Full text

Abstract:

AbstractIn proof-theoretic semantics of intuitionistic logic it is well known that elimination rules can be generated from introduction rules in a uniform way. If introduction rules discharge assumptions, the corresponding elimination rule is a rule of higher level, which allows one to discharge rules occurring as assumptions. In some cases, these uniformly generated elimination rules can be equivalently replaced with elimination rules that only discharge formulas or do not discharge any assumption at all—they can be flattened in a terminology proposed by Read. We show by an example from propo

APA, Harvard, Vancouver, ISO, and other styles

2

Davies, Jessica, Nina Narodytska, and Toby Walsh. "Eliminating the Weakest Link: Making Manipulation Intractable?" Proceedings of the AAAI Conference on Artificial Intelligence 26, no. 1 (2021): 1333–39. http://dx.doi.org/10.1609/aaai.v26i1.8254.

Full text

Abstract:

Successive elimination of candidates is often a route to making manipulation intractable to compute. We prove that eliminating candidates does not necessarily increase the computational complexity of manipulation. However, for many voting rules used in practice, the computational complexity increases. For example, it is already known that it is NP-hard to compute how a single voter can manipulate the result of single transferable voting (the elimination version of plurality voting). We show here that it is NP-hard to compute how a single voter can manipulate the result of the elimination versi

APA, Harvard, Vancouver, ISO, and other styles

3

Kim, Sangwon, Byoung-Chul Ko, and Jaeyeal Nam. "Model Simplification of Deep Random Forest for Real-Time Applications of Various Sensor Data." Sensors 21, no. 9 (2021): 3004. http://dx.doi.org/10.3390/s21093004.

Full text

Abstract:

The deep random forest (DRF) has recently gained new attention in deep learning because it has a high performance similar to that of a deep neural network (DNN) and does not rely on a backpropagation. However, it connects a large number of decision trees to multiple layers, thereby making analysis difficult. This paper proposes a new method for simplifying a black-box model of a DRF using a proposed rule elimination. For this, we consider quantifying the feature contributions and frequency of the fully trained DRF in the form of a decision rule set. The feature contributions provide a basis fo

APA, Harvard, Vancouver, ISO, and other styles

4

Laporte, Éric, and Anne Monceaux. "Elimination of lexical ambiguities by grammars." Lingvisticæ Investigationes. International Journal of Linguistics and Language Resources 22, no. 1-2 (1999): 341–67. http://dx.doi.org/10.1075/li.22.1-2.21lap.

Full text

Abstract:

We present a new, intex-compatible formalism for the description of distributional constraints, ‘elag’ (Elimination of Lexical Ambiguities by Grammars). The constraints may be checked against text, and the lexical ambiguity of the text may thus be partly resolved. We describe and exemplify the main properties of elag with the aid of simple rules, formalizing exploitable constraints. We specify in detail the effect of applying an elag rule or grammar to a text. We examine the practical properties of the formalism from the point of view of a rule writer. We describe our separate, intex-compatibl

APA, Harvard, Vancouver, ISO, and other styles

5

Okada, Mitsuhiro. "Wittgenstein's Uniqueness Rule as an Elimination Rule of Inductive Types:." Kagaku tetsugaku 53, no. 2 (2021): 95–114. http://dx.doi.org/10.4216/jpssj.53.2_95.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

FERRUCCI, FILOMENA, MARIA I. SESSA, and GIULIANO PACINI. "On redundancy elimination tolerant scheduling rules." Theory and Practice of Logic Programming 1, no. 5 (2001): 539–90. http://dx.doi.org/10.1017/s1471068401001235.

Full text

Abstract:

In Ferrucci, Pacini and Sessa (1995) an extended form of resolution, called Reduced SLD resolution (RSLD), is introduced. In essence, an RSLD derivation is an SLD derivation such that redundancy elimination from resolvents is performed after each rewriting step. It is intuitive that redundancy elimination may have positive effects on derivation process. However, undesiderable effects are also possible. In particular, as shown in this paper, program termination as well as completeness of loop checking mechanisms via a given selection rule may be lost. The study of such effects has led us to an

APA, Harvard, Vancouver, ISO, and other styles

7

Tunyan, Knarik. "On pivot rules for simplex method of interior points, and their investigation on Klee-Minty cube." Facta universitatis - series: Electronics and Energetics 15, no. 2 (2002): 281–94. http://dx.doi.org/10.2298/fuee0202281t.

Full text

Abstract:

In [25] it was proposed a parametric linear transformation, which is a "convex" combination of the Gauss transformation of elimination method and the Gram-Schmidt transformation of modified orthogonalization process. Using this transformation, in particular, elimination methods were generalized, Dantzig's optimality criterion and simplex method were developed [26]. The essence of the simplex method development is the following. At each sth step the pivot (positive) vector of length Ks is selected, that allows us to move to improved feasible solution after the step of the generalized Gauss-Jord

APA, Harvard, Vancouver, ISO, and other styles

8

Shoichiro Ozaki. "Law to inhibit the recycle of nitrogen and Phosphorous is inhibiting CO2 assimilation and promoting global warming: This kind of law should be abolished." International Journal of Scholarly Research in Science and Technology 2, no. 2 (2023): 008–15. http://dx.doi.org/10.56781/ijsrst.2023.2.2.0023.

Full text

Abstract:

Global warming is caused by the lack of N and P and decrease of CO2 assimilation and decrease of CO2 fix and decrease of heat absorption. Lack of N and P is caused by the elimination of NOx and NP in waste water. Global warming will stop if developed countries stop the elimination of NOx and NP. CO2 assimilation will be activated and Global warming will stop. But developed countries hated NOx and are eliminating NOx by the reaction with ammonia and set up a rule that if NOx is detected in exit gas, we will order the stop of factory The author presented petition to stop the rules which ask the

APA, Harvard, Vancouver, ISO, and other styles

9

Pfeifer, Karl. "A Note on the V-Elimination Rule." Cogito 4, no. 1 (1990): 69–70. http://dx.doi.org/10.5840/cogito1990416.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Ostermann, Klaus, David Binder, Ingo Skupin, Tim Süberkrüb, and Paul Downen. "Introduction and elimination, left and right." Proceedings of the ACM on Programming Languages 6, ICFP (2022): 438–65. http://dx.doi.org/10.1145/3547637.

Full text

Abstract:

Functional programming language design has been shaped by the framework of natural deduction, in which language constructs are divided into introduction and elimination rules for producers of values. In sequent calculus-based languages, left introduction rules replace (right) elimination rules and provide a dedicated sublanguage for consumers of values. In this paper, we present and analyze a wider design space of programming languages which encompasses four kinds of rules: Introduction and elimination, both left and right. We analyze the influence of rule choice on program structure and argue

APA, Harvard, Vancouver, ISO, and other styles

11

BORISAVLJEVIĆ, MIRJANA, KOSTA DOšEN, and ZORAN PETRIĆ. "On permuting cut with contraction." Mathematical Structures in Computer Science 10, no. 2 (2000): 99–136. http://dx.doi.org/10.1017/s0960129599003011.

Full text

Abstract:

This paper presents a cut-elimination procedure for intuitionistic propositional logic in which cut is eliminated directly, without introducing the multiple-cut rule mix, and in which pushing cut above contraction is one of the reduction steps. The presentation of this procedure is preceded by an analysis of Gentzen's mix-elimination procedure, made in the perspective of permuting cut with contraction. We also show that in the absence of implication, pushing cut above contraction does not pose problems for directly eliminating cut.

APA, Harvard, Vancouver, ISO, and other styles

12

Bunder, M. W. "Some consistency proofs and a characterization of inconsistency proofs in illative combinatory logic." Journal of Symbolic Logic 52, no. 1 (1987): 89–110. http://dx.doi.org/10.2307/2273864.

Full text

Abstract:

It is well known that combinatory logic with unrestricted introduction and elimination rules for implication is inconsistent in the strong sense that an arbitrary term Y is provable. The simplest proof of this, now usually called Curry's paradox, involves for an arbitrary term Y, a term X defined by X = Y(CPy).The fact that X = PXY = X ⊃ Y is an essential part of the proof.The paradox can be avoided by placing restrictions on the implication introduction rule or on the axioms from which it can be proved.In this paper we determine the forms that must be taken by inconsistency proofs of systems

APA, Harvard, Vancouver, ISO, and other styles

13

GORÉ, RAJEEV, and REVANTHA RAMANAYAKE. "VALENTINI’S CUT-ELIMINATION FOR PROVABILITY LOGIC RESOLVED." Review of Symbolic Logic 5, no. 2 (2012): 212–38. http://dx.doi.org/10.1017/s1755020311000323.

Full text

Abstract:

Valentini (1983) has presented a proof of cut-elimination for provability logic GL for a sequent calculus using sequents built from sets as opposed to multisets, thus avoiding an explicit contraction rule. From a formal point of view, it is more syntactic and satisfying to explicitly identify the applications of the contraction rule that are ‘hidden’ in proofs of cut-elimination for such sequent calculi. There is often an underlying assumption that the move to a proof of cut-elimination for sequents built from multisets is straightforward. Recently, however, it has been claimed that Valentini’

APA, Harvard, Vancouver, ISO, and other styles

14

Wang, San-Min, and Ming-Yan Wang. "Disjunctive elimination rule and its application in MTL." Fuzzy Sets and Systems 157, no. 24 (2006): 3169–76. http://dx.doi.org/10.1016/j.fss.2006.05.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Ishibuchi, Hisao, Tadahiko Murata, and Tomoharu Nakashima. "Linguistic Rule Extraction from Numerical Data for High-dimensional Classification Problems." Journal of Advanced Computational Intelligence and Intelligent Informatics 3, no. 5 (1999): 386–93. http://dx.doi.org/10.20965/jaciii.1999.p0386.

Full text

Abstract:

We discuss the linguistic rule extraction from numerical data for high-dimensional classification problems. Difficulties in the handling of high-dimensional problems stem from the curse of dimensionality: the number of combinations of antecedent linguistic values exponentially increases as the number of attributes increases. Our goal is to extract a small number of simple linguistic rules with high classification ability. In this paper, the rule extraction is to find a set of linguistic rules using three criteria: its classification ability, its compactness, and the simplicity of each rule. Ou

APA, Harvard, Vancouver, ISO, and other styles

16

Narodytska, Nina, Toby Walsh, and Lirong Xia. "Manipulation of Nanson's and Baldwin's Rules." Proceedings of the AAAI Conference on Artificial Intelligence 25, no. 1 (2011): 713–18. http://dx.doi.org/10.1609/aaai.v25i1.7872.

Full text

Abstract:

Nanson's and Baldwin's voting rules selecta winner by successively eliminatingcandidates with low Borda scores. We showthat these rules have a number of desirablecomputational properties. In particular,with unweighted votes, it isNP-hard to manipulate either rule with one manipulator, whilstwith weighted votes, it isNP-hard to manipulate either rule with a small number ofcandidates and a coalition of manipulators.As only a couple of other voting rulesare known to be NP-hard to manipulatewith a single manipulator, Nanson'sand Baldwin's rules appearto be particularly resistant to manipulation fr

APA, Harvard, Vancouver, ISO, and other styles

17

Bailin, Sidney C. "A normalization theorem for set theory." Journal of Symbolic Logic 53, no. 3 (1988): 673–95. http://dx.doi.org/10.2307/2274565.

Full text

Abstract:

In this paper we present a normalization theorem for a natural deduction formulation of Zermelo set theory. Our result gets around M. Crabbe's counterexample to normalizability (Hallnäs [3]) by adding an inference rule of the formand requiring that this rule be used wherever it is applicable. Alternatively, we can regard the result as pertaining to a modified notion of normalization, in which an inferenceis never considered reducible if A is T Є T, even if R is an elimination rule and the major premise of R is the conclusion of an introduction rule. A third alternative is to regard (1) as a de

APA, Harvard, Vancouver, ISO, and other styles

18

Castagna, Giuseppe, Mickaël Laurent, Kim Nguyễn, and Matthew Lutze. "On type-cases, union elimination, and occurrence typing." Proceedings of the ACM on Programming Languages 6, POPL (2022): 1–31. http://dx.doi.org/10.1145/3498674.

Full text

Abstract:

We extend classic union and intersection type systems with a type-case construction and show that the combination of the union elimination rule of the former and the typing rules for type-cases of our extension encompasses occurrence typing . To apply this system in practice, we define a canonical form for the expressions of our extension, called MSC-form. We show that an expression of the extension is typable if and only if its MSC-form is, and reduce the problem of typing the latter to the one of reconstructing annotations for that term. We provide a sound algorithm that performs this recons

APA, Harvard, Vancouver, ISO, and other styles

19

Sheng Liu, R. Y. Patel, P. R. Daga, et al. "Combined Rule Extraction and Feature Elimination in Supervised Classification." IEEE Transactions on NanoBioscience 11, no. 3 (2012): 228–36. http://dx.doi.org/10.1109/tnb.2012.2213264.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Gordeev, L. "On cut elimination in the presence of perice rule." Archiv für Mathematische Logik und Grundlagenforschung 26, no. 1 (1987): 147–64. http://dx.doi.org/10.1007/bf02017499.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Porębski, Sebastian, and Ewa Straszecka. "Membership Functions for Fuzzy Focal Elements." Archives of Control Sciences 26, no. 3 (2016): 395–427. http://dx.doi.org/10.1515/acsc-2016-0022.

Full text

Abstract:

Abstract The paper presents a study on data-driven diagnostic rules, which are easy to interpret by human experts. To this end, the Dempster-Shafer theory extended for fuzzy focal elements is used. Premises of the rules (fuzzy focal elements) are provided by membership functions which shapes are changing according to input symptoms. The main aim of the present study is to evaluate common membership function shapes and to introduce a rule elimination algorithm. Proposed methods are first illustrated with the popular Iris data set. Next experiments with five medical benchmark databases are perfo

APA, Harvard, Vancouver, ISO, and other styles

22

Barbieri, Maria Silvia. "Important Variables in Reasoning about Social Rules." International Journal of Behavioral Development 16, no. 4 (1993): 589–607. http://dx.doi.org/10.1177/016502549301600404.

Full text

Abstract:

In everyday life people produce and accept behaviours that deviate to some extent from a rule, but are nevertheless recognised as examples of the rule. This study analyses the effects of three variables, i.e. type of substitution, centrality of the element involved in the transgression, and linguistic formulation of rules, on judgements of acceptability and seriousness of such deviations. Three groups of 60 subjects each (4-year-olds, 9-year-olds, and adults) were randomly assigned to receive one of three linguistic formulations of a prudential rule. In the first, the rule was stated without j

APA, Harvard, Vancouver, ISO, and other styles

23

Sayli, Ayla, and Ayse Oncu Sarihan. "Statistical query-based rule derivation system by backward elimination algorithm." Discrete & Continuous Dynamical Systems - S 8, no. 6 (2015): 1341–56. http://dx.doi.org/10.3934/dcdss.2015.8.1341.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

APPEL, ANDREW W., and TREVOR JIM. "Shrinking lambda expressions in linear time." Journal of Functional Programming 7, no. 5 (1997): 515–40. http://dx.doi.org/10.1017/s0956796897002839.

Full text

Abstract:

Functional-language compilers often perform optimizations based on beta and delta reduction. To avoid speculative optimizations that can blow up the code size, we might wish to use only shrinking reduction rules guaranteed to make the program smaller: these include dead-variable elimination, constant folding, and a restricted beta rule that inlines only functions that are called just once. The restricted beta rule leads to a shrinking rewrite system that has not previously been studied. We show some efficient normalization algorithms that are immediately useful in optimizing compilers; and we

APA, Harvard, Vancouver, ISO, and other styles

25

Djola, Fakhrun, Nur Laila, Hatta Raharja, and Salma Fitri Juwita. "Phenomenon of al-Hazf in the Qur'an: An Analysis of the Rasm Rule in Surah Ali-Imran." ELOQUENCE : Journal of Foreign Language 1, no. 1 (2022): 21–30. http://dx.doi.org/10.58194/eloquence.v1i1.172.

Full text

Abstract:

Al-Hadzf is one of the very interesting Rasm rules studied, because it deals with the elimination of letters or lafaz that will not damage the meaning of a sentence, but has linguistic reasons that make it more unique, interesting, and has an i'jaz. This study aims to find out the phenomenon of al-Hadzf letters and words in the Quran, in surah Ali-Imran. The method used in this study is descriptive qualitative through a phenomenological approach to language by looking at the phenomenon of letter elimination, classifying, and analyzing based on its rules. This study aims to find out the phenome

APA, Harvard, Vancouver, ISO, and other styles

26

KANOVICH, MAX, STEPAN KUZNETSOV, VIVEK NIGAM, and ANDRE SCEDROV. "Subexponentials in non-commutative linear logic." Mathematical Structures in Computer Science 29, no. 8 (2018): 1217–49. http://dx.doi.org/10.1017/s0960129518000117.

Full text

Abstract:

Linear logical frameworks with subexponentials have been used for the specification of, among other systems, proof systems, concurrent programming languages and linear authorisation logics. In these frameworks, subexponentials can be configured to allow or not for the application of the contraction and weakening rules while the exchange rule can always be applied. This means that formulae in such frameworks can only be organised as sets and multisets of formulae not being possible to organise formulae as lists of formulae. This paper investigates the proof theory of linear logic proof systems

APA, Harvard, Vancouver, ISO, and other styles

27

Mailhot, Frédéric, and Charles Reiss. "Computing Long-Distance Dependencies in Vowel Harmony." Biolinguistics 1 (December 2, 2007): 028–48. http://dx.doi.org/10.5964/bioling.8587.

Full text

Abstract:

This article develops an explicit procedural model of vowel harmony, and takes steps toward finding a lower bound on the computational power of phonological rules. The focus on formalization and procedural computation allows for simplification in models of representation and the discovery of interesting interactions involving the conditions in rules. It is shown that locality principles are derivable, which motivates the elimination of iterative rule application advocated here. Along the way, a novel analysis of neutral vowels in harmony processes is also provided.

APA, Harvard, Vancouver, ISO, and other styles

28

Gahér, František, Marek Števček, and Martin Braxatoris. "Instruments and rules of production and interpretation of a concise text (with special regard to normativity)." Journal of Linguistics/Jazykovedný casopis 70, no. 1 (2019): 73–94. http://dx.doi.org/10.2478/jazcas-2019-0041.

Full text

Abstract:

Abstract In the production of concise texts, several instruments are used, of which two can be considered as basic: intratextual referencing (anaphora/cataphora) and the simple or complex ellipsis (ellipsis/syllepsis). However, the use of these instruments affects the unambiguity and intelligibility of the text. Certain rules for and limits to the simplification and shortening of the primary text are needed to secure the possibility of an unambiguous reconstruction of the text by the language user. However, we show that the elimination of homonymy from these texts seems to require considerable

APA, Harvard, Vancouver, ISO, and other styles

29

Nguyen Thu Hien, Nguyen Phuong Nhung, and Nguyen Tuan Linh. "Adaptive neuro-fuzzy inference system classifier with interpretability for cancer diagnostic." Journal of Military Science and Technology, CSCE6 (December 30, 2022): 56–64. http://dx.doi.org/10.54939/1859-1043.j.mst.csce6.2022.56-64.

Full text

Abstract:

Clinical outcome analysis using patient medical data facilitates clinical decision-making and increases prognostic accuracy. Recently, deep learning (DL) with learning big data features has shown expert-level accuracy in predicting clinical outcomes. Many of these sophisticated machine learning models, however, lack interpretability, creating significant trust-related healthcare issues. This necessarily requires the need for interpretable AI systems capable of explaining their decisions. In this respect, the paper proposes an interpretable classifier of the adaptive neuro-fuzzy inference metho

APA, Harvard, Vancouver, ISO, and other styles

30

VESTERGAARD, RENÉ, and JOE WELLS. "Cut rules and explicit substitutions." Mathematical Structures in Computer Science 11, no. 1 (2001): 131–68. http://dx.doi.org/10.1017/s0960129500003273.

Full text

Abstract:

We introduce a method to associate calculi of proof terms and rewrite rules with cut elimination procedures for logical deduction systems (i.e., Gentzen-style sequent calculi) in the case of intuitionistic logic. We illustrate this method using two different versions of the cut rule for a variant of the intuitionistic fragment of Kleene's logical deduction system G3.Our systems are in fact calculi of explicit substitution, where the cut rule introduces an explicit substitution and the left-→ rule introduces a binding of the result of a function application. Cut propagation steps of cut elimina

APA, Harvard, Vancouver, ISO, and other styles

31

Martini, Simone, Andrea Masini, and Margherita Zorzi. "From 2-Sequents and Linear Nested Sequents to Natural Deduction for Normal Modal Logics." ACM Transactions on Computational Logic 22, no. 3 (2021): 1–29. http://dx.doi.org/10.1145/3461661.

Full text

Abstract:

We extend to natural deduction the approach of Linear Nested Sequents and of 2-Sequents. Formulas are decorated with a spatial coordinate, which allows a formulation of formal systems in the original spirit of natural deduction: only one introduction and one elimination rule per connective, no additional (structural) rule, no explicit reference to the accessibility relation of the intended Kripke models. We give systems for the normal modal logics from K to S4. For the intuitionistic versions of the systems, we define proof reduction, and prove proof normalization, thus obtaining a syntactical

APA, Harvard, Vancouver, ISO, and other styles

32

Beshenkova, E. V., and O. E. Ivanova. "About the Academic Description of Russian Spelling. (To Spelling Rule Theory)." Russian language at school 81, no. 5 (2020): 61–66. http://dx.doi.org/10.30515/0131-6141-2020-81-5-61-66.

Full text

Abstract:

The article is devoted to the concept of a rule as a tool of scientific and orthological description. A rule is a conventional kind of scientific interpretation in any writing system, such as the description of morphological types in morphology or syntactic models in syntax. In this regard, rules must comply with the requirements for tools of scientific and orthological description. A rule as a tool for scientific description should be internally consistent and not contradict other rules, clearly define the described range of phenomena, cover all cases, clearly distinguish between the scope of

APA, Harvard, Vancouver, ISO, and other styles

33

Zagoskin, Maxim V., and Jianbin Wang. "Programmed DNA elimination: silencing genes and repetitive sequences in somatic cells." Biochemical Society Transactions 49, no. 5 (2021): 1891–903. http://dx.doi.org/10.1042/bst20190951.

Full text

Abstract:

In a multicellular organism, the genomes of all cells are in general the same. Programmed DNA elimination is a notable exception to this genome constancy rule. DNA elimination removes genes and repetitive elements in the germline genome to form a reduced somatic genome in various organisms. The process of DNA elimination within an organism is highly accurate and reproducible; it typically occurs during early embryogenesis, coincident with germline-soma differentiation. DNA elimination provides a mechanism to silence selected genes and repeats in somatic cells. Recent studies in nematodes sugge

APA, Harvard, Vancouver, ISO, and other styles

34

Woleński, Jan. "Tonk, Syntax, Semantics, Pragmatics." Studies in Logic, Grammar and Rhetoric 69, no. 1 (2024): 259–66. https://doi.org/10.2478/slgr-2024-0018.

Full text

Abstract:

Abstract In 1960, A. N. Prior proposed a binary sentential functor defined by inferential rule (introduction) A ⊢ A tonk B, and (elimination) A tonk B ⊢ A. Later, this idea was discussed by several authors, including in the context of the question of whether the ab ove rule defines this functor in a sufficient manner. This paper shows that if we assume the standard matrix (truth-tables) characterization of classical sentential functors, no valuation agrees with rules generating the sense of tonk. Moreover, these inferential prescriptions are at odds with the principle that if premises are true

APA, Harvard, Vancouver, ISO, and other styles

35

PLATO, JAN VON, and ANNIKA SIDERS. "NORMAL DERIVABILITY IN CLASSICAL NATURAL DEDUCTION." Review of Symbolic Logic 5, no. 2 (2012): 205–11. http://dx.doi.org/10.1017/s1755020311000311.

Full text

Abstract:

A normalization procedure is given for classical natural deduction with the standard rule of indirect proof applied to arbitrary formulas. For normal derivability and the subformula property, it is sufficient to permute down instances of indirect proof whenever they have been used for concluding a major premiss of an elimination rule. The result applies even to natural deduction for classical modal logic.

APA, Harvard, Vancouver, ISO, and other styles

36

Tar, József K., Imre J. Rudas, and Miklós Rontó. "Geometric Identification and Control of Nonlinear Dynamic Systems Based on Floating Basis Vector Representation." Journal of Advanced Computational Intelligence and Intelligent Informatics 10, no. 4 (2006): 542–48. http://dx.doi.org/10.20965/jaciii.2006.p0542.

Full text

Abstract:

In this paper a simple adaptive controller is outlined that creates only temporal and situation-dependent system model. It may be a plausible alternative of the more sophisticated soft computing approaches that aim the identification of permanent and complete models. The temporal model can be built up and maintained step-by-step on the basis of slow elimination of fading information by the use of simple updating rules consisting of finite algebraic steps of lucid geometric interpretation. It may be used for filling in the “lookup tables” or rule bases of the more sophisticated representations

APA, Harvard, Vancouver, ISO, and other styles

37

Gakii, Consolata, Paul O. Mireji, and Richard Rimiru. "Graph Based Feature Selection for Reduction of Dimensionality in Next-Generation RNA Sequencing Datasets." Algorithms 15, no. 1 (2022): 21. http://dx.doi.org/10.3390/a15010021.

Full text

Abstract:

Analysis of high-dimensional data, with more features (p) than observations (N) (p>N), places significant demand in cost and memory computational usage attributes. Feature selection can be used to reduce the dimensionality of the data. We used a graph-based approach, principal component analysis (PCA) and recursive feature elimination to select features for classification from RNAseq datasets from two lung cancer datasets. The selected features were discretized for association rule mining where support and lift were used to generate informative rules. Our results show that the graph-based f

APA, Harvard, Vancouver, ISO, and other styles

38

DA, RE BRUNO, Damián Enrique Szmuc, and María Inés Corbalán. "Non-Reflexive Nonsense: Proof Theory of Paracomplete Weak Kleene Logic." Studia Logica 112, no. 6 (2024): 1243–59. https://doi.org/10.1007/s11225-023-10086-x.

Full text

Abstract:

Our aim is to provide a sequent calculus whose external consequence relation coincides with the three-valued paracomplete logic ‘of nonsense’ introduced by Dmitry Bochvar and, independently, presented as the weak Kleene logic K3w by Stephen C. Kleene. The main features of this calculus are (i) that it is <em>non-reflexive</em>, i.e., Identity is not included as an explicit rule (although a restricted form of it with premises is derivable); (ii) that it includes rules where <em>no variable-inclusion conditions</em> are attached; and (iii) that it is <em

APA, Harvard, Vancouver, ISO, and other styles

39

Kondratyev, Dmitry, Ilya Maryasov, and Valery Nepomniaschy. "The Automation of C Program Verification by Symbolic Method of Loop Invariants Elimination." Modeling and Analysis of Information Systems 25, no. 5 (2018): 491–505. http://dx.doi.org/10.18255/1818-1015-2018-5-491-505.

Full text

Abstract:

During deductive verification of programs written in imperative languages, the generation and proof of verification conditions corresponding to loops can cause difficulties, because each one must be provided with an invariant whose construction is often a challenge. As a rule, the methods of invariant synthesis are heuristic ones. This impedes its application. An alternative is the symbolic method of loop invariant elimination suggested by V.A. Nepomniaschy in 2005. Its idea is to represent a loop body in a form of special replacement operation under certain constraints. This operation express

APA, Harvard, Vancouver, ISO, and other styles

40

Liu, Enbin, Liuting Yang, Yong Jiang, Ping Tang, Jian Liu, and Yuhang Yang. "Simulation on the Temperature Drop Rule of Hot Oil Pipeline." Open Fuels & Energy Science Journal 6, no. 1 (2013): 55–60. http://dx.doi.org/10.2174/1876973x01306010055.

Full text

Abstract:

The heat transfer equation of oil, pipe wall and soil, combining with the boundary condition, connection condition and initial conditions to be the differential equations which can simulate the temperature drop rule of hot oil pipeline. Then the numerical solution method is used to solve, constructed difference equations. By the gauss elimination method, the temperature changing rule of hot oil pipeline after shutdown can be obtained, so we can determine the safety shutdown time and the restart pressure.

APA, Harvard, Vancouver, ISO, and other styles

41

Gevorkyan, Alexander A., Alvard S. Arakelyan, and Anthony F. Cockerill. "The electromeric effect in polar 1,2-elimination is a myth. A revised version and a Unified Rule for Elimination." Tetrahedron 53, no. 23 (1997): 7947–56. http://dx.doi.org/10.1016/s0040-4020(97)00468-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Choi Cheol-young. "Elimination of Colonial Rule and Transitional Justice: A Case of East Timor." Democratic Legal Studies ll, no. 45 (2011): 47–79. http://dx.doi.org/10.15756/dls.2011..45.47.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Morawska, Barbara. "General E-unification with Eager Variable Elimination and a Nice Cycle Rule." Journal of Automated Reasoning 39, no. 1 (2007): 77–106. http://dx.doi.org/10.1007/s10817-007-9068-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Thimm, Georg, Perry Moerland, and Emile Fiesler. "The Interchangeability of Learning Rate and Gain in Backpropagation Neural Networks." Neural Computation 8, no. 2 (1996): 451–60. http://dx.doi.org/10.1162/neco.1996.8.2.451.

Full text

Abstract:

The backpropagation algorithm is widely used for training multilayer neural networks. In this publication the gain of its activation function(s) is investigated. In specific, it is proven that changing the gain of the activation function is equivalent to changing the learning rate and the weights. This simplifies the backpropagation learning rule by eliminating one of its parameters. The theorem can be extended to hold for some well-known variations on the backpropagation algorithm, such as using a momentum term, flat spot elimination, or adaptive gain. Furthermore, it is successfully applied

APA, Harvard, Vancouver, ISO, and other styles

45

Nakata, Masaya, and Tomoki Hamagami. "An Analysis of Rule Deletion Scheme in XCS on Reinforcement Learning Problem." Journal of Advanced Computational Intelligence and Intelligent Informatics 21, no. 5 (2017): 876–84. http://dx.doi.org/10.20965/jaciii.2017.p0876.

Full text

Abstract:

The XCS classifier system is an evolutionary rule-based learning technique powered by a Q-learning like learning mechanism. It employs a global deletion scheme to delete rules from all rules covering all state-action pairs. However, the optimality of this scheme remains unclear owing to the lack of intensive analysis. We here introduce two deletion schemes: 1) local deletion, which can be applied to a subset of rules covering each state (a match set), and 2) stronger local deletion, which can be applied to a more specific subset covering each state-action pair (an action set). The aim of this

APA, Harvard, Vancouver, ISO, and other styles

46

Gabbay, Dov M., and Ruy J. G. B. de Queiroz. "Extending the Curry-Howard interpretation to linear, relevant and other resource logics." Journal of Symbolic Logic 57, no. 4 (1992): 1319–65. http://dx.doi.org/10.2307/2275370.

Full text

Abstract:

The so-called Curry-Howard interpretation (Curry [1934], Curry and Feys [1958], Howard [1969], Tait [1965]) is known to provide a rather neat term-functional account of intuitionistic implication. Could one refine the interpretation to obtain an almost as good account of other neighbouring implications, including the so-called ‘resource’ implications (e.g. linear, relevant, etc.)?We answer this question positively by demonstrating that just by working with side conditions on the rule of assertability conditions for the connective representing implication (‘→’) one can characterise those ‘resou

APA, Harvard, Vancouver, ISO, and other styles

47

Kilinkarova, Elena V. "On Entitlement to Treaty Benefits under Russian Double Tax Conventions." Zakon 20, no. 11 (2023): 83–89. http://dx.doi.org/10.37239/0869-4400-2023-20-11-83-89.

Full text

Abstract:

The article focuses on rules regulating who is entitled to treaty benefits under Russian tax treaties. Tax treaty benefits cover all mechanisms of elimination of double taxation, guaranties and mechanisms of protection of taxpayer’s rights available under a double tax treaty. Entitlement to tax treaty benefits may be studied widely – as covering all rules of double tax treaties and national legislation on applicability of a certain benefit, and in a more narrow way – as covering just applicable anti-avoidance rules. The focus is on analysing the rules specifically aimed at discouraging abuse o

APA, Harvard, Vancouver, ISO, and other styles

48

Holliday, Wesley H. "A Fundamental Non-Classical Logic." Logics 1, no. 1 (2023): 36–79. http://dx.doi.org/10.3390/logics1010004.

Full text

Abstract:

We give a proof-theoretic as well as a semantic characterization of a logic in the signature with conjunction, disjunction, negation, and the universal and existential quantifiers that we suggest has a certain fundamental status. We present a Fitch-style natural deduction system for the logic that contains only the introduction and elimination rules for the logical constants. From this starting point, if one adds the rule that Fitch called Reiteration, one obtains a proof system for intuitionistic logic in the given signature; if instead of adding Reiteration, one adds the rule of Reductio ad

APA, Harvard, Vancouver, ISO, and other styles

49

Knorr, Rudolf, David S. Stephenson, Ernst Lattke, Petra Böhrer, and Jakob Ruhdorfer. "Unusual traits of cis and trans-2,3-dibromo-1,1-dimethylindane on the way from 1,1-dimethylindene to 2-bromo-, 3-bromo-, and 2,3-dibromo-1,1-dimethylindene." Beilstein Journal of Organic Chemistry 12 (June 10, 2016): 1178–84. http://dx.doi.org/10.3762/bjoc.12.113.

Full text

Abstract:

Do not rely on the widely accepted rule that vicinal, sp3-positioned protons in cyclopentene moieties should always have more positive 3 J NMR coupling constants for the cis than for the trans arrangement: Unrecognized exceptions might misguide one to wrong stereochemical assignments and thence to erroneous mechanistic conclusions. We show here that two structurally innocent-looking 2,3-dibromo-1,1-dimethylindanes violate the rule by means of their values of 3 J(cis) = 6.1 Hz and 3 J(trans) = 8.4 Hz. The stereoselective formation of the trans diastereomer from 1,1-dimethylindene was improved w

APA, Harvard, Vancouver, ISO, and other styles

50

Odders-White, Elizabeth R. "Third Market Reforms: The Overlooked Goal of the SEC's Order Handling Rules." Journal of Financial and Quantitative Analysis 39, no. 2 (2004): 277–304. http://dx.doi.org/10.1017/s0022109000003070.

Full text

Abstract:

AbstractIn 1997, the Securities and Exchange Commission enacted significant reforms in U.S. markets. Several studies document that the new order handling rules increased competition for Nasdaq stocks, but the reforms were designed with an additional goal in mind—to increase quote competition for the trading of NYSE-listed securities on Nasdaq (i.e., third market trading). An evaluation of the reforms in the third market indicates that they did not achieve this objective. Instead, both quote quality and quoting frequency were diminished, due primarily to elimination of the excess spread rule. T

APA, Harvard, Vancouver, ISO, and other styles

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!