Relevant bibliographies by topics / Logic system translation / Journal articles
To see the other types of publications on this topic, follow the link: Logic system translation.

Journal articles on the topic 'Logic system translation'

Author: Grafiati
Published: 25 May 2024
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 'Logic system translation.'

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

Golev, N. D. "Translative Linguistics: an Aspectualized Review of Initial Provisions. Part 1. Gnoseology of Translation." Bulletin of Kemerovo State University 24, no. 6 (2022): 717–34. http://dx.doi.org/10.21603/2078-8975-2022-24-6-717-734.

Full text
Abstract:
The article introduces translative linguistics as a special branch in the study of natural languages and describes the history of its development. Translative linguistics uses the methods of quantitative linguistics, combinatorial linguistics, associative grammar, lexicography, etc. It focuses on the same aspects of language as historical grammar, phonetics, political linguistics, etc. The ontology of translational linguistics sees the natural language and its units as its research object. Translation (reserve translation, machine translation, and reverse machine translation) acts as a researc
APA, Harvard, Vancouver, ISO, and other styles
2

Martini, Simone, and Andrea Masini. "A modal view of linear logic." Journal of Symbolic Logic 59, no. 3 (1994): 888–99. http://dx.doi.org/10.2307/2275915.

Full text
Abstract:
AbstractWe present a sequent calculus for the modal logic S4, and building on some relevant features of this system (the absence of contraction rules and the confinement of weakenings into axioms and modal rules) we show how S4 can easily be translated into full prepositional linear logic, extending the Grishin-Ono translation of classical logic into linear logic. The translation introduces linear modalities (exponentials) only in correspondence with S4 modalities. We discuss the complexity of the decision problem for several classes of linear formulas naturally arising from the proposed trans
APA, Harvard, Vancouver, ISO, and other styles
3

Cao, Qianyu, and Hanmei Hao. "A Chaotic Neural Network Model for English Machine Translation Based on Big Data Analysis." Computational Intelligence and Neuroscience 2021 (July 2, 2021): 1–12. http://dx.doi.org/10.1155/2021/3274326.

Full text
Abstract:
In this paper, the chaotic neural network model of big data analysis is used to conduct in-depth analysis and research on the English translation. Firstly, under the guidance of the translation strategy of text type theory, the translation generated by the machine translation system is edited after translation, and then professionals specializing in computer and translation are invited to confirm the translation. After that, the errors in the translations generated by the machine translation system are classified based on the Double Quantum Filter-Muttahida Quami Movement (DQF-MQM) error type
APA, Harvard, Vancouver, ISO, and other styles
4

SHRAMKO, YAROSLAV. "A MODAL TRANSLATION FOR DUAL-INTUITIONISTIC LOGIC." Review of Symbolic Logic 9, no. 2 (2016): 251–65. http://dx.doi.org/10.1017/s1755020316000022.

Full text
Abstract:
AbstractWe construct four binary consequence systems axiomatizing entailment relations between formulas of classical, intuitionistic, dual-intuitionistic and modal (S4) logics, respectively. It is shown that the intuitionistic consequence system is embeddable in the modal (S4) one by the usual modal translation prefixing □ to every subformula of the translated formula. An analogous modal translation of dual-intuitionistic formulas then consists of prefixing ◊ to every subformula of the translated formula. The philosophical importance of this result is briefly discussed.
APA, Harvard, Vancouver, ISO, and other styles
5

LANZET, RAN. "A THREE-VALUED QUANTIFIED ARGUMENT CALCULUS: DOMAIN-FREE MODEL-THEORY, COMPLETENESS, AND EMBEDDING OF FOL." Review of Symbolic Logic 10, no. 3 (2017): 549–82. http://dx.doi.org/10.1017/s1755020317000053.

Full text
Abstract:
AbstractThis paper presents an extended version of the Quantified Argument Calculus (Quarc). Quarc is a logic comparable to the first-order predicate calculus. It employs several nonstandard syntactic and semantic devices, which bring it closer to natural language in several respects. Most notably, quantifiers in this logic are attached to one-place predicates; the resulting quantified constructions are then allowed to occupy the argument places of predicates. The version presented here is capable of straightforwardly translating natural-language sentences involving defining clauses. A three-v
APA, Harvard, Vancouver, ISO, and other styles
6

Im, Hyeonseung. "On Correspondence between Selective CPS Transformation and Selective Double Negation Translation." Mathematics 9, no. 4 (2021): 385. http://dx.doi.org/10.3390/math9040385.

Full text
Abstract:
A double negation translation (DNT) embeds classical logic into intuitionistic logic. Such translations correspond to continuation passing style (CPS) transformations in programming languages via the Curry-Howard isomorphism. A selective CPS transformation uses a type and effect system to selectively translate only nontrivial expressions possibly with computational effects into CPS functions. In this paper, we review the conventional call-by-value (CBV) CPS transformation and its corresponding DNT, and provide a logical account of a CBV selective CPS transformation by defining a selective DNT
APA, Harvard, Vancouver, ISO, and other styles
7

Garanina, Natalia Olegovna, Igor Sergeevich Anureev, Vladimir Evgenyevich Zyubin, et al. "Temporal Logic for Programmable Logic Controllers." Modeling and Analysis of Information Systems 27, no. 4 (2020): 412–27. http://dx.doi.org/10.18255/1818-1015-2020-4-412-427.

Full text
Abstract:
We address the formal verification of the control software of critical systems, i.e., ensuring the absence of design errors in a system with respect to requirements. Control systems are usually based on industrial controllers, also known as Programmable Logic Controllers (PLCs). A specific feature of a PLC is a scan cycle: 1) the inputs are read, 2) the PLC states change, and 3) the outputs are written. Therefore, in order to formally verify PLC, e.g., by model checking, it is necessary to describe the transition system taking into account this specificity and reason both in terms of state tra
APA, Harvard, Vancouver, ISO, and other styles
8

Barba Escriba, Juan. "A multidimensional modal translation for a formal system motivated by situation semantics." Notre Dame Journal of Formal Logic 32, no. 4 (1991): 598–608. http://dx.doi.org/10.1305/ndjfl/1093635931.

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

Min, hoo ki. "The translation of Tongdian(『通典』) Xuanju(選擧) chapter1". Korean Society of the History of Historiography 46 (30 грудня 2022): 427–71. http://dx.doi.org/10.29186/kjhh.2022.46.427.

Full text
Abstract:
This article is a translation of Tongdian(『通典』) Xuanju(選擧) chapter1 by Duyou(杜佑, 735-812). The purpose of translating this article was to know the changes in the bureaucratic selection system in ancient China. Through this book, he developed a rare logic in Chinese pre-modern history that the economy is the basis of human life and that the present is more developed than in the past. He also argues that the system for selecting officials through this book has continued to develop through ancient China.
APA, Harvard, Vancouver, ISO, and other styles
10

BLOK, W. J., and J. G. RAFTERY. "ASSERTIONALLY EQUIVALENT QUASIVARIETIES." International Journal of Algebra and Computation 18, no. 04 (2008): 589–681. http://dx.doi.org/10.1142/s0218196708004627.

Full text
Abstract:
A translation in an algebraic signature is a finite conjunction of equations in one variable. On a quasivariety K, a translation τ naturally induces a deductive system, called the τ-assertional logic of K. Two quasivarieties are τ-assertionally equivalent if they have the same τ-assertional logic. This paper is a study of assertional equivalence. It characterizes the quasivarieties equivalent to ones with various desirable properties, such as τ-regularity (a general form of point regularity). Special attention is paid to structural properties of quasivarieties that are assertionally equivalent
APA, Harvard, Vancouver, ISO, and other styles
11

Simons, Peter. "Term Logic." Axioms 9, no. 1 (2020): 18. http://dx.doi.org/10.3390/axioms9010018.

Full text
Abstract:
The predominant form of logic before Frege, the logic of terms has been largely neglected since. Terms may be singular, empty or plural in their denotation. This article, presupposing propositional logic, provides an axiomatization based on an identity predicate, a predicate of non-existence, a constant empty term, and term conjunction and negation. The idea of basing term logic on existence or non-existence, outlined by Brentano, is here carried through in modern guise. It is shown how categorical syllogistic reduces to just two forms of inference. Tree and diagram methods of testing validity
APA, Harvard, Vancouver, ISO, and other styles
12

Fernandez, David. "A polynomial translation of S4 into intuitionistic logic." Journal of Symbolic Logic 71, no. 3 (2006): 989–1001. http://dx.doi.org/10.2178/jsl/1154698587.

Full text
Abstract:
It is known that both S4 and the Intuitionistic prepositional calculus Int are P-SPACE complete. This guarantees that there is a polynomial translation from each system into the other.However, no sound and faithful polynomial translation from S4 into Int is commonly known. The problem of finding one was suggested by Dana Scott during a very informal gathering of logicians in February 2005 at UCLA. Grigori Mints then brought it to my attention, and in this paper I present a solution. It is based on Kripke semantics and describes model-checking for S4 using formulas of Int.A simple translation f
APA, Harvard, Vancouver, ISO, and other styles
13

Li, Zhi Bin. "Low-Cost PLC-Based Control of a 2-DoF Purely Translational Parallel Robot." Advanced Materials Research 383-390 (November 2011): 1542–48. http://dx.doi.org/10.4028/www.scientific.net/amr.383-390.1542.

Full text
Abstract:
This paper describes the design and implementation of a low-cost robot control system based on a Programmable Logic Controller (PLC). The robot is a 2-DoF (Degrees of Freedom) purely translational mechanism, which has potential application in food and electronics industry for high speed pick-and-place operation. Combined with a conveyor belt, it can make 3-DoF purely translation motion. In this paper, the inverse kinematics, forward kinematics, singularity, and workspace analysis are presented. The control system architecture and software design is also introduced. The prototype is exhibited a
APA, Harvard, Vancouver, ISO, and other styles
14

De Florio, Giulia. "MARSHAK EDITOR OF GIANNI RODARI’S CIPOLLINO’S ADVENTURES. SOME PRELIMINARY ARCHIVE-BASED OBSERVATIONS." Children's Readings: Studies in Children's Literature 21, no. 1 (2022): 250–64. http://dx.doi.org/10.31860/2304-5817-2022-1-21-250-264.

Full text
Abstract:
Samuil Marshak’s brief account “Why Did I Translate Gianni Rodari’s poems” [Marshak 1971] provides an interesting “inside look” at his translation practice in relation to the poems of the Italian children’s poet. Nevertheless, the information it contains is far from exhaustive on the subject of “Marshak translator of Gianni Rodari”. Moreover, Marshak was also the editor of other translations of the Italian writer’s works, namely The Adventures of Cipollino by Zlata Potapova. When analysing Potapova’s translation and Marshak’s suggested changes—included in a typewritten copy kept in Marshak’s a
APA, Harvard, Vancouver, ISO, and other styles
15

Wischin, Kurt. "Brief Analysis and Translation of Gottlob Frege's «On the Law of Inertia»." Disputatio. Philosophical Research Bulletin 9, no. 15 (2020): 167–98. https://doi.org/10.5281/zenodo.4625753.

Full text
Abstract:
Frege's review of Ludwig Lange's book about the Newtonian laws of motion is his only work discussing the logical principle that should govern an empirical science system. Some interesting comments about this piece from a historian's perspective in the philosophy of science are contained in the translations of notes by the authors of a translation into English. My brief analysis argues that Frege's review allows us to question many of the standard interpretations of Frege's philosophy of language and logic.
APA, Harvard, Vancouver, ISO, and other styles
16

Broda, Sabine, and Luís Damas. "Compact bracket abstraction in combinatory logic." Journal of Symbolic Logic 62, no. 3 (1997): 729–40. http://dx.doi.org/10.2307/2275570.

Full text
Abstract:
AbstractTranslations from Lambda calculi into combinatory logics can be used to avoid some implementational problems of the former systems. However, this scheme can only be efficient if the translation produces short output with a small number of combinators, in order to reduce the time and transient storage space spent during reduction of combinatory terms. In this paper we present a combinatory system and an abstraction algorithm, based on the original bracket abstraction operator of Schönfinkel [9]. The algorithm introduces at most one combinator for each abstraction in the initial Lambda t
APA, Harvard, Vancouver, ISO, and other styles
17

JULIÁN-IRANZO, PASCUAL, and FERNANDO SÁENZ-PÉREZ. "Planning for an Efficient Implementation of Hypothetical Bousi∼Prolog." Theory and Practice of Logic Programming 21, no. 5 (2021): 680–97. http://dx.doi.org/10.1017/s1471068421000405.

Full text
Abstract:
AbstractThis paper explores the integration of hypothetical reasoning into an efficient implementation of the fuzzy logic language Bousi∼Prolog. To this end, we first analyse what would be expected from a logic inference system, equipped with what is called embedded implication, to model solving goals with respect to assumptions. We start with a propositional system and incrementally build more complex systems and implementations to satisfy the requirements imposed by a system like Bousi∼Prolog. Finally, we propose an inference system, operational semantics and the translation function to gene
APA, Harvard, Vancouver, ISO, and other styles
18

Walendziak, Andrzej. "Deductive systems of pseudo-M algebras." Annales Universitatis Paedagogicae Cracoviensis. Studia Mathematica 21, no. 1 (2022): 93–116. http://dx.doi.org/10.2478/aupcsm-2022-0008.

Full text
Abstract:
Abstract The class of pseudo-M algebras contains pseudo-BCK, pseudo-BCI, pseudo-BCH, pseudo-BE, pseudo-CI algebras and many other algebras of logic. In this paper, the notion of deductive system in a pseudo-M algebra is introduced and its elementary properties are investigated. Closed deductive systems are defined and studied. The homomorphic properties of (closed) deductive systems are provided. The concepts of translation deductive systems and R-congruences in pseudo-M algebras are introduced and investigated. It is shown that there is a bijection between closed translation deductive systems
APA, Harvard, Vancouver, ISO, and other styles
19

Mohammed Abbas Al-Rikabi. "Enhancing the Effectiveness of High Schools-Level English Translation Teaching Using Transformer Models and Reinforcement Learning Algorithms." Journal of Information Systems Engineering and Management 10, no. 36s (2025): 914–37. https://doi.org/10.52783/jisem.v10i36s.6614.

Full text
Abstract:
Translation teaching is changed as artificial intelligence and deep learning constructs a wonderland. The traditional forms of teaching translation are devoid of personalized feedback, adaptive methods of learning, and dynamic error correction-all components that do not allow the student to attain high translation accuracy and fluency proficiency. This study investigates the application of a Transformer-based deep learning model and reinforcement learning algorithms in English translation education for the secondary school level. The study creates a system of AI-aided translation teaching whic
APA, Harvard, Vancouver, ISO, and other styles
20

Saidova, Hurriyat Zafar kizi. "ORAL TRANSLATION AS A SPECIAL TYPE OF SPEECH-INTELLIGENT ACTIVITY." Zamonaviy dunyoda pedagogika va psixologiya 2, no. 08 (2023): 53–55. https://doi.org/10.5281/zenodo.7905630.

Full text
Abstract:
The article is devoted to develop a methodology for the formation of the basic competence of an interpreter in the logic of a situational-contextual approach while integrating the principles of personal-activity, contextual-competence, communicativecognitive, intercultural, scenario-situational approaches, creating a system of pre-translation and translation exercises as a tool for teaching oral translation activity, conducting experiential learning, analyzing the results of experiential learning, as well as in the practical application of the results of this study.  
APA, Harvard, Vancouver, ISO, and other styles
21

Hartono, Hartono, and Tiarma Simanihuruk. "Optimization Model of Fuzzy Rule Based Expert System Using Max-Min Composition and Schema Mapping Translation." INSIST 2, no. 1 (2017): 30. http://dx.doi.org/10.23960/ins.v2i1.30.

Full text
Abstract:
Abstract— Fuzzy Decision Making involves a process of selecting one or more alternatives or solutions from a finite set of alternatives which suits a set of constraints. In the rule-based expert system, the terms following in the decision making is using knowledge based and the IF Statements of the rule are called the premises, while the THEN part of the rule is called conclusion. Membership function and knowledge based determines the performance of fuzzy rule based expert system. Membership function determines the performance of fuzzy logic as it relates to represent fuzzy set in a computer.
APA, Harvard, Vancouver, ISO, and other styles
22

Bolshakova, Mariya G. "Strategies and Techniques of the Translation of International Law Documents." Current Issues in Philology and Pedagogical Linguistics, no. 3 (September 25, 2023): 42–53. http://dx.doi.org/10.29025/2079-6021-2023-3-42-53.

Full text
Abstract:
The article deals with the issue of international legal documents translation from English into Russian. Translation strategies are identified which allow achieving accuracy in the translation of legal texts. The paper uses such research methods as contextual analysis, descriptive analysis, comparative analysis, definition analysis, distributive analysis. The factors that complicate the translation of legal texts are identified, including replenishment of the legal terminology system with neologisms and abundance of specialized legal terminology and terminology of related fields of knowledge.
APA, Harvard, Vancouver, ISO, and other styles
23

Dung, P. M., and P. M. Thang. "Closure and Consistency In Logic-Associated Argumentation." Journal of Artificial Intelligence Research 49 (January 29, 2014): 79–109. http://dx.doi.org/10.1613/jair.4107.

Full text
Abstract:
Properties like logical closure and consistency are important properties in any logical reasoning system. Caminada and Amgoud showed that not every logic-based argument system satisfies these relevant properties. But under conditions like closure under contraposition or transposition of the monotonic part of the underlying logic, ASPIC-like systems satisfy these properties. In contrast, the logical closure and consistency properties are not well-understood for other well-known and widely applied systems like logic programming or assumption based argumentation. Though conditions like closure un
APA, Harvard, Vancouver, ISO, and other styles
24

Bellantoni, Stephen, and Martin Hofmann. "A new “feasible” arithmetic." Journal of Symbolic Logic 67, no. 1 (2002): 104–16. http://dx.doi.org/10.2178/jsl/1190150032.

Full text
Abstract:
AbstractA classical quantified modal logic is used to define a “feasible” arithmetic whose provably total functions are exactly the polynomial-time computable functions. Informally, one understands ⃞∝ as “∝ is feasibly demonstrable”. differs from a system that is as powerful as Peano Arithmetic only by the restriction of induction to ontic (i.e., ⃞-free) formulas. Thus, is defined without any reference to bounding terms, and admitting induction over formulas having arbitrarily many alternations of unbounded quantifiers. The system also uses only a very small set of initial functions.To obtain
APA, Harvard, Vancouver, ISO, and other styles
25

Ramati, Ido, and Amit Pinchevski. "Uniform multilingualism: A media genealogy of Google Translate." New Media & Society 20, no. 7 (2017): 2550–65. http://dx.doi.org/10.1177/1461444817726951.

Full text
Abstract:
This article applies a media geneaology perspective to examine the operative logic of Google Translate. Tracing machine translation from post–World War II (WWII) rule-based methods to contemporary algorithmic statistical methods, we analyze the underlying power structure of algorithmic and human collaboration that Translate encompasses. Focusing on the relationship between technology, language, and speakers, we argue that the operative logic of Translate represents a new model of translation, which we call uniform multilingualism. In this model, the manifest lingual plurality on the user side
APA, Harvard, Vancouver, ISO, and other styles
26

Ghilardi, Silvio, and Lorenzo Sacchetti. "Filtering unification and most general unifiers in modal logic." Journal of Symbolic Logic 69, no. 3 (2004): 879–906. http://dx.doi.org/10.2178/jsl/1096901773.

Full text
Abstract:
Abstract.We characterize (both from a syntactic and an algebraic point of view) the normal K4-logics for which unification is filtering. We also give a sufficient semantic criterion for existence of most general unifiers, covering natural extensions of K4.2+ (i.e., of the modal system obtained from K4 by adding to it, as a further axiom schemata, the modal translation of the weak excluded middle principle).
APA, Harvard, Vancouver, ISO, and other styles
27

Chun, Seung Su. "The Pattern Based Visual Property Specification Language and Supporting System for Software Verifications." Applied Mechanics and Materials 752-753 (April 2015): 1090–96. http://dx.doi.org/10.4028/www.scientific.net/amm.752-753.1090.

Full text
Abstract:
This paper deals with issue of properties specification for software verifications and translation between formal languages. Through this paper, the unique framework of property specifications including most kinds of formal specifications logics, automatic methods are shown by a property specifications guided system and PVSL(The Pattern based Visual property Specification Language).Additionally, a properties to specify and structures, Interconnection of them are also described by property charts. In this study, the pattern based visual property specification language (PVSL) is defined and prop
APA, Harvard, Vancouver, ISO, and other styles
28

MacCaull, Wendy. "Relational semantics and a relational proof system for full Lambek calculus." Journal of Symbolic Logic 63, no. 2 (1998): 623–37. http://dx.doi.org/10.2307/2586855.

Full text
Abstract:
AbstractIn this paper we give relational semantics and an accompanying relational proof theory for full Lambek calculus (a sequent calculus which we denote by FL). We start with the Kripke semantics for FL as discussed in [11] and develop a second Kripke-style semantics, RelKripke semantics, as a bridge to relational semantics. The RelKripke semantics consists of a set with two distinguished elements, two ternary relations and a list of conditions on the relations. It is accompanied by a Kripke-style valuation system analogous to that in [11]. Soundness and completeness theorems with respect t
APA, Harvard, Vancouver, ISO, and other styles
29

Kuehnle, Matthias, Andre Wagner, Alisson V. Brito, and Juergen Becker. "Modeling and Implementation of a Power Estimation Methodology for SystemC." International Journal of Reconfigurable Computing 2012 (2012): 1–12. http://dx.doi.org/10.1155/2012/439727.

Full text
Abstract:
This work describes a methodology to model power consumption of logic modules. A detailed mathematical model is presented and incorporated in a tool for translation of models written in VHDL to SystemC. The functionality for implicit power monitoring and estimation is inserted at module translation. The translation further implements an approach to wrap RTL to TLM interfaces so that the translated module can be connected to a system-level simulator. The power analysis is based on a statistical model of the underlying HW structure and an analysis of input data. The flexibility of the C++ syntax
APA, Harvard, Vancouver, ISO, and other styles
30

PAYKIN, JENNIFER, and STEVE ZDANCEWIC. "A linear/producer/consumer model of classical linear logic." Mathematical Structures in Computer Science 28, no. 5 (2016): 710–35. http://dx.doi.org/10.1017/s0960129516000347.

Full text
Abstract:
This paper defines a new proof- and category-theoretic framework forclassical linear logicthat separates reasoning into one linear regime and two persistent regimes corresponding to ! and ?. The resulting linear/producer/consumer (LPC) logic puts the three classes of propositions on the same semantic footing, following Benton's linear/non-linear formulation of intuitionistic linear logic. Semantically, LPC corresponds to a system of three categories connected by adjunctions reflecting the LPC structure. The paper's meta-theoretic results include admissibility theorems for the cut and duality r
APA, Harvard, Vancouver, ISO, and other styles
31

SÁENZ-PÉREZ, FERNANDO. "Applying Constraint Logic Programming to SQL Semantic Analysis." Theory and Practice of Logic Programming 19, no. 5-6 (2019): 808–25. http://dx.doi.org/10.1017/s1471068419000206.

Full text
Abstract:
AbstractThis paper proposes the use of Constraint Logic Programming (CLP) to model SQL queries in a data-independent abstract layer by focusing on some semantic properties for signalling possible errors in such queries. First, we define a translation from SQL to Datalog, and from Datalog to CLP, so that solving this CLP program will give information about inconsistency, tautology, and possible simplifications. We use different constraint domains which are mapped to SQL types, and propose them to cooperate for improving accuracy. Our approach leverages a deductive system that includes SQL and D
APA, Harvard, Vancouver, ISO, and other styles
32

Guba, A. A., A. V. Kolchin, and S. V. Potiyenko. "A method for business logic extraction from legacy COBOL code of industrial systems." PROBLEMS IN PROGRAMMING, no. 2-3 (June 2016): 017–25. http://dx.doi.org/10.15407/pp2016.02-03.017.

Full text
Abstract:
The purpose of this work is to develop a software tool for analysis automation and simplifying of understanding of software systems behavior. Methods for translation, abstraction, debugging and test generation for COBOL are proposed. We developed a software system, which implements the methods.
APA, Harvard, Vancouver, ISO, and other styles
33

Bacon, John. "The completeness of a predicate-functor logic." Journal of Symbolic Logic 50, no. 4 (1985): 903–26. http://dx.doi.org/10.2307/2273980.

Full text
Abstract:
Predicate-functor logic, as founded by W. V. Quine ([1960], [1971], [1976], [1981]), is first-order predicate logic without individual variables. Instead, adverbs or predicate functors make explicit the permutations and replications of argument-places familiarly indicated by shifting variables about. For the history of this approach, see Quine [1971, 309ff.]. With the evaporation of variables, individual constants naturally assimilate to singleton predicates or adverbs, leaving no logical subjects whatever of type 0. The orphaned “predicates” may then be taken simply as terms in the sense of t
APA, Harvard, Vancouver, ISO, and other styles
34

Li, Xiaojing, and Shuting Ding. "Interpersonal Interface System of Multimedia Intelligent English Translation Based on Deep Learning." Scientific Programming 2022 (April 14, 2022): 1–9. http://dx.doi.org/10.1155/2022/8027003.

Full text
Abstract:
Artificial intelligence is a very challenging science, and people who are engaged in this work must understand computer knowledge, psychology, and philosophy. Artificial intelligence includes a wide range of sciences; it is composed of different fields, such as machine learning and computer vision. In recent years, with the rise and joint drive of technologies such as the Internet, big data, the Internet of Things, and voice recognition, the rapid development of artificial intelligence technology has presented new features such as deep learning, cross-border integration, and human-machine coll
APA, Harvard, Vancouver, ISO, and other styles
35

Garcez, Artur S. d'Avila, and Luís C. Lamb. "A Connectionist Computational Model for Epistemic and Temporal Reasoning." Neural Computation 18, no. 7 (2006): 1711–38. http://dx.doi.org/10.1162/neco.2006.18.7.1711.

Full text
Abstract:
The importance of the efforts to bridge the gap between the connectionist and symbolic paradigms of artificial intelligence has been widely recognized. The merging of theory (background knowledge) and data learning (learning from examples) into neural-symbolic systems has indicated that such a learning system is more effective than purely symbolic or purely connectionist systems. Until recently, however, neural-symbolic systems were not able to fully represent, reason, and learn expressive languages other than classical propositional and fragments of first-order logic. In this article, we show
APA, Harvard, Vancouver, ISO, and other styles
36

Avron, A. "Multiplicative conjunction and an algebraic meaning of contraction and weakening." Journal of Symbolic Logic 63, no. 3 (1998): 831–59. http://dx.doi.org/10.2307/2586715.

Full text
Abstract:
AbstractWe show that the elimination rule for the multiplicative (or intensional) conjunction Λ is admissible in many important multiplicative substructural logics. These include LLm (the multiplicative fragment of Linear Logic) and RMIm (the system obtained from LLm by adding the contraction axiom and its converse, the mingle axiom.) An exception is Rm (the intensional fragment of the relevance logic R, which is LLm together with the contraction axiom). Let SLLm and SRm be, respectively, the systems which are obtained from LLm and Rm by adding this rule as a new rule of inference. The set of
APA, Harvard, Vancouver, ISO, and other styles
37

Meyer, Robert. "Arithmetic Formulated Relevantly." Australasian Journal of Logic 18, no. 5 (2021): 154–288. http://dx.doi.org/10.26686/ajl.v18i5.6905.

Full text
Abstract:

 
 
 The purpose of this paper is to formulate first-order Peano arithmetic within the resources of relevant logic, and to demonstrate certain properties of the system thus formulated. Striking among these properties are the facts that (1) it is trivial that relevant arithmetic is absolutely consistent, but (2) classical first-order Peano arithmetic is straightforwardly contained in relevant arithmetic. Under (1), I shall show in particular that 0 = 1 is a non-theorem of relevant arithmetic; this, of course, is exactly the formula whose unprovability was sought in the Hilbert p
APA, Harvard, Vancouver, ISO, and other styles
38

Kumbhar, Vinod B., and Mahesh S. Chavan. "Petri Nets to Ladder Diagrams Translation for Textile Chemical Mixing Application." Journal of the Textile Association 85, no. 6 (2025): 1–11. https://doi.org/10.63665/jta.v85i6.04.

Full text
Abstract:
This paper presents a novel method for translating Petri Nets, a formal language for modeling concurrent systems, into Ladder Diagrams, the graphical programming language used in Programmable Logic Controllers, specifically for textile chemical mixing applications. This addresses the challenge of efficiently implementing complex control logic, particularly in industrial automation scenarios. The proposed two-phase method first converts the PN model into a State Transition Diagram, simplifying the subsequent translation to LD. The second phase maps the STD onto an LD using rules that maintain s
APA, Harvard, Vancouver, ISO, and other styles
39

Bhadwal, Neha, Prateek Agrawal, and Vishu Madaan. "A Machine Translation System from Hindi to Sanskrit Language using Rule based Approach." Scalable Computing: Practice and Experience 21, no. 3 (2020): 543–54. http://dx.doi.org/10.12694/scpe.v21i3.1783.

Full text
Abstract:
Machine Translation is an area of Natural Language Processing which can replace the laborious task of manual translation. Sanskrit language is among the ancient Indo-Aryan languages. There are numerous works of art and literature in Sanskrit. It has also been a medium for creating treatise of philosophical work as well as works on logic, astronomy and mathematics. On the other hand, Hindi is the most prominent language of India. Moreover,it is among the most widely spoken languages across the world. This paper is an effort to bridge the language barrier between Hindi and Sanskrit language such
APA, Harvard, Vancouver, ISO, and other styles
40

Hauck, Nicholas. "Louis Wolfson et la traduction plurilinguistique, ou comment se mettre à l’abri dans l’espace rhizomique." L’espace à travers l’imaginaire littéraire, no. 122 (July 13, 2023): 51–57. http://dx.doi.org/10.7202/1101621ar.

Full text
Abstract:
This article examines Louis Wolfson’s theory of plurilingual translation in Le Schizo et les langues (1970) and his experience of practicing his theory as described in Ma mère, musicienne… (1984). Diagnosed as schizophrenic, Wolfson developed a deep hatred for his mother tongue, English, and a strong mistrust toward others and the world in general. In order to protect himself, he learned French, Russian, German, and Hebrew, languages which he then uses to translate his anglophone environment. Taking a cue from Caroline Rabourdin’s writings that show how the logic of Euclidian space forms and i
APA, Harvard, Vancouver, ISO, and other styles
41

Huang, Yang. "Developing a fuzzy comprehensive assessment model for English translation for college studentso." Journal of Computational Methods in Sciences and Engineering 24, no. 3 (2024): 1709–25. http://dx.doi.org/10.3233/jcm-247281.

Full text
Abstract:
College students are learning a foreign language must know how to translate the spoken or written content from the respective language into English. These approaches do not help the college students to develop the capacity for rational thinking and adequate the motivation for the English translation. The educational principles are not in line with the qualities of the students in the typical English translation classroom teaching, and the teaching methods are out-dated. In the older process of the teaching English translation, many unreliable, vague aspects need to be considered, such as recog
APA, Harvard, Vancouver, ISO, and other styles
42

BICHLER, MANUEL, MICHAEL MORAK, and STEFAN WOLTRAN. "selp: A Single-Shot Epistemic Logic Program Solver." Theory and Practice of Logic Programming 20, no. 4 (2020): 435–55. http://dx.doi.org/10.1017/s1471068420000022.

Full text
Abstract:
AbstractEpistemic logic programs (ELPs) are an extension of answer set programming (ASP) with epistemic operators that allow for a form of meta-reasoning, that is, reasoning over multiple possible worlds. Existing ELP solving approaches generally rely on making multiple calls to an ASP solver in order to evaluate the ELP. However, in this paper, we show that there also exists a direct translation from ELPs into non-ground ASP with bounded arity. The resulting ASP program can thus be solved in a single shot. We then implement this encoding method, using recently proposed techniques to handle la
APA, Harvard, Vancouver, ISO, and other styles
43

VAN DESSEL, KYLIAN, JO DEVRIENDT, and JOOST VENNEKENS. "FOLASP: FO(·) as Input Language for Answer Set Solvers." Theory and Practice of Logic Programming 21, no. 6 (2021): 785–801. http://dx.doi.org/10.1017/s1471068421000351.

Full text
Abstract:
AbstractTechnological progress in Answer Set Programming (ASP) has been stimulated by the use of common standards, such as the ASP-Core-2 language. While ASP has its roots in nonmonotonic reasoning, efforts have also been made to reconcile ASP with classical first-order (FO) logic. This has resulted in the development of FO(·), an expressive extension of FO, which allows ASP-like problem solving in a purely classical setting. This language may be more accessible to domain experts already familiar with FO and may be easier to combine with other formalisms that are based on classical logic. It i
APA, Harvard, Vancouver, ISO, and other styles
44

Westphal, Kenneth R. "Force, Understanding and Ontology." Hegel Bulletin 29, no. 1-2 (2008): 1–29. http://dx.doi.org/10.1017/s0263523200000756.

Full text
Abstract:
InNight ThoughtsHenry Harris made plain that Hegel imbibed naturalism deeply in Jena. Harris states:The balance of social influence has shifted so drastically between Hegel's time and ours … from the religious to the scientific establishment, that Hegel's own contribution to this shift has itself become an obstacle to the right understanding of what he said.Hewanted to swing religious consciousness into full support of a scientific interpretation of human life …. His own choice of language was conditioned by the Christian teaching, but also by the knowledge that the Christian doctrine of spiri
APA, Harvard, Vancouver, ISO, and other styles
45

Iampan, Aiyared, N. Rajesh, J. Princivishvamalar, and C. Arivazhagi. "Translation of a Bipolar Fuzzy Set in Hilbert Algebras." European Journal of Pure and Applied Mathematics 17, no. 4 (2024): 4059–70. http://dx.doi.org/10.29020/nybg.ejpam.v17i4.5536.

Full text
Abstract:
This study explores the application of bipolar fuzzy set theory within Hilbert algebras, introducing and examining the concept of bipolar fuzzy (β, α)-translations of a bipolar fuzzy set φ =(φ+, φ−) in two distinct forms: Type I and Type II. Fundamental properties of these bipolar fuzzy translations are investigated in depth, alongside the introduction of bipolar fuzzy extensions andintensities, broadening the utility and flexibility of bipolar fuzzy sets in capturing nuanced bipolar information. Moreover, this work addresses the intricate relationships between the complement of a bipolar fuzz
APA, Harvard, Vancouver, ISO, and other styles
46

Ma, Duo, Yuexin Li, Kaiyue Wu, et al. "Multi-arm RNA junctions encoding molecular logic unconstrained by input sequence for versatile cell-free diagnostics." Nature Biomedical Engineering 6, no. 3 (2022): 298–309. http://dx.doi.org/10.1038/s41551-022-00857-7.

Full text
Abstract:
AbstractApplications of RNA-based molecular logic have been hampered by sequence constraints imposed on the input and output of the circuits. Here we show that the sequence constraints can be substantially reduced by appropriately encoded multi-arm junctions of single-stranded RNA structures. To conditionally activate RNA translation, we integrated multi-arm junctions, self-assembled upstream of a regulated gene and designed to unfold sequentially in response to different RNA inputs, with motifs of loop-initiated RNA activators that function independently of the sequence of the input RNAs and
APA, Harvard, Vancouver, ISO, and other styles
47

DEROSSET, LOUIS. "ON WEAK GROUND." Review of Symbolic Logic 7, no. 4 (2014): 713–44. http://dx.doi.org/10.1017/s1755020314000306.

Full text
Abstract:
AbstractThough the study of grounding is still in the early stages, Kit Fine, in ”The Pure Logic of Ground”, has made a seminal attempt at formalization. Formalization of this sort is supposed to bring clarity and precision to our theorizing, as it has to the study of other metaphysically important phenomena, like modality and vagueness. Unfortunately, as I will argue, Fine ties the formal treatment of grounding to the obscure notion of a weak ground. The obscurity of weak ground, together with its centrality in Fine’s system, threatens to undermine the extent to which this formalization offer
APA, Harvard, Vancouver, ISO, and other styles
48

Petrova, Anastasiya Dmitrievna. "New poetics of French prose and its perception in Russian translation." Litera, no. 8 (August 2025): 1–9. https://doi.org/10.25136/2409-8698.2025.8.74989.

Full text
Abstract:
The object of the study is the new poetics of French prose of the late 19th — first half of the 20th century and its functioning in the system of Russian translation. The focus is on texts in which the artistic effect is created not so much by the plot composition, but through the syntactic structure, rhythmic organization and intonational heterogeneity. The study is based on the works of such authors as Marcel Proust and André Gide, whose texts are dominated by extended periods, grammatical deviations from the norm, associative logic of the statement and elements of "inner speech". T
APA, Harvard, Vancouver, ISO, and other styles
49

Жақан, М. Қ., Ф. Б. Худойдодзода, and Р. Иманжүсіп. "Logical teachings of Ibn Sina and features of syllogisms." Bulletin of the Karaganda university History.Philosophy series 3, no. 103 (2021): 137–45. http://dx.doi.org/10.31489/2021hph3/137-145.

Full text
Abstract:
It is well known that Greek philosophy was at the center of attention of medieval thinkers, including Muslims. The latter were particularly interested in the teachings of Plato and Aristotle. Science in the Caliphate from the very beginning of its emergence and development was associated with the translation of the scientific heritage of other peoples into Arabic. One of these sciences was logic. It satisfied the urgent need for a rationalistic methodology that organizes scientific thought, and was applied in a wide variety of areas of Arab culture. For the majority of Muslim scholars who have
APA, Harvard, Vancouver, ISO, and other styles
50

В. Г. НІКОНОВА and Р. І. ЛУЦЕНКО. "SIMILES AS MEANS OF REPRESENTING THE AUTHOR’S WORLDVIEW AND THEIR RENDERING IN LITERARY TRANSLATION (in Ukrainian translations of contemporary English poetry)." MESSENGER of Kyiv National Linguistic University. Series Philology 22, no. 2 (2019): 193–201. http://dx.doi.org/10.32589/2311-0821.2.2019.191992.

Full text
Abstract:
Introduction. Today, simile as a stylistic device attracts the attention of scholars in translation studies, since similes convey the figurative information of the source text and, consequently, their adequate rendering contributes to the creation of an adequate translation of the whole poetic work taking into account its imagery as a key to understanding the author’s worldview. The translator should strive to preserve the image of the source text in translation by using the means of expressiveness which is one of the most complex problems in the theory of translation from English into Ukraini
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!

To the bibliography