Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Logic system translation.
Zeitschriftenartikel zum Thema „Logic system translation“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "Logic system translation" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.
1
Golev, N. D. „Translative Linguistics: an Aspectualized Review of Initial Provisions. Part 1. Gnoseology of Translation“. Bulletin of Kemerovo State University 24, Nr. 6 (29.12.2022): 717–34. http://dx.doi.org/10.21603/2078-8975-2022-24-6-717-734.
Der volle Inhalt der QuelleAnnotation:
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 research method that translational linguistics uses to describe the patterns of the translated language. The author reviews various scientific publications to describe the concepts and terms of translational linguistics. The author uses the method of linguistic logic, which is understood as incorporating a new concept in the traditional system of theoretical linguistic concepts.
2
Martini, Simone, und Andrea Masini. „A modal view of linear logic“. Journal of Symbolic Logic 59, Nr. 3 (September 1994): 888–99. http://dx.doi.org/10.2307/2275915.
Der volle Inhalt der QuelleAnnotation:
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 translations.
3
SHRAMKO, YAROSLAV. „A MODAL TRANSLATION FOR DUAL-INTUITIONISTIC LOGIC“. Review of Symbolic Logic 9, Nr. 2 (12.02.2016): 251–65. http://dx.doi.org/10.1017/s1755020316000022.
Der volle Inhalt der QuelleAnnotation:
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.
4
Garanina, Natalia Olegovna, Igor Sergeevich Anureev, Vladimir Evgenyevich Zyubin, Sergey Mikhailovich Staroletov, Tatiana Victorovna Liakh, Andrey Sergeevich Rozov und Sergei Petrovich Gorlatch. „Temporal Logic for Programmable Logic Controllers“. Modeling and Analysis of Information Systems 27, Nr. 4 (20.12.2020): 412–27. http://dx.doi.org/10.18255/1818-1015-2020-4-412-427.
Der volle Inhalt der QuelleAnnotation:
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 transitions within a cycle and in terms of larger state transitions according to the scan-cyclic semantics. We propose a formal PLC model as a hyperprocess transition system and temporal cycle-LTL logic based on LTL logic for formulating PLC property. A feature of the cycle-LTL logic is the possibility of viewing the scan cycle in two ways: as the effect of the environment (in particular, the control object) on the control system and as the effect of the control system on the environment. For both cases we introduce modified LTL temporal operators. We also define special modified LTL temporal operators to specify inside properties of scan cycles. We describe the translation of formulas of cycle-LTL into formulas of LTL, and prove its correctness. This implies the possibility ofmodel checking requirements expressed in logic cycle-LTL, by using well-known model checking tools with LTL as specification logic, e.g., Spin. We give the illustrative examples of requirements expressed in the cycle-LTL logic.
5
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, Nr. 1 (2022): 250–64. http://dx.doi.org/10.31860/2304-5817-2022-1-21-250-264.
Der volle Inhalt der QuelleAnnotation:
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 archive — one can easily observe a number of translation strategies that underline not only Samuel Yakovlevich’s close attention to the transfer of the verbal text and whole cultural system from Italian into Russian, but also his freedom to shift the emotional and logic accent of the text according to his own belief about what makes children’s literature great. Such preliminary observations aim at providing a starting point to identify his approach to editing and translation of children’s literature.
6
Cao, Qianyu, und Hanmei Hao. „A Chaotic Neural Network Model for English Machine Translation Based on Big Data Analysis“. Computational Intelligence and Neuroscience 2021 (02.07.2021): 1–12. http://dx.doi.org/10.1155/2021/3274326.
Der volle Inhalt der QuelleAnnotation:
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 classification framework. Due to the characteristics of the source text as an informative academic text, long and difficult sentences, passive voice, and terminology translation are the main causes of machine translation errors. In view of the rigorous logic of the source text and the fixed language steps, this research proposes corresponding post-translation editing strategies for each type of error. It is suggested that translators should maintain the logic of the source text by converting implicit connections into explicit connections, maintain the academic accuracy of the source text by adding subjects and adjusting the word order to deal with the passive voice, and deal with semitechnical terms by appropriately selecting word meanings in postediting. The errors of machine translation in computer science and technology text abstracts are systematically categorized, and the corresponding post-translation editing strategies are proposed to provide reference suggestions for translators in this field, to improve the quality of machine translation in this field.
7
Bolshakova, Mariya G. „Strategies and Techniques of the Translation of International Law Documents“. Current Issues in Philology and Pedagogical Linguistics, Nr. 3 (25.09.2023): 42–53. http://dx.doi.org/10.29025/2079-6021-2023-3-42-53.
Der volle Inhalt der QuelleAnnotation:
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. It is pointed out that the translator must possess specialized knowledge, as well as a high level of translation and linguacultural competence, which will help to avoid distortion of meaning and violation of the logic when translating from English into Russian. The author identifies the translation techniques used in the translation of legal texts, the choice of which is determined by the analyzed principles and strategies. The research material is the English-language texts of the declarations of BRICS summits and their official translated Russian-language versions. As a result of the research, it was found that the principles of translation of international legal documents correspond to the classical principles of translation, since they require the translator to have a good understanding of the text content, a high level of proficiency in both the source and target languages, preservation of the author’s communicative intention in translation. The scientific novelty of the research lies in the identification of another principle of translation, which a translator should focus on when choosing strategies and techniques for translating international legal texts, in particular, the principle of interdisciplinarity. The author also identifies the main translation techniques, the use of which allows to achieve equivalence and adequacy in translation of legal texts. The research contributes to the development of the theory and practice of translation in general and specialized translation, in particular. In the future, it is planned to conduct comparative studies aimed at identifying the principles, strategies and techniques of translating civil and criminal law documents.
8
Barba Escriba, Juan. „A multidimensional modal translation for a formal system motivated by situation semantics.“ Notre Dame Journal of Formal Logic 32, Nr. 4 (September 1991): 598–608. http://dx.doi.org/10.1305/ndjfl/1093635931.
Der volle Inhalt der Quelle
9
Im, Hyeonseung. „On Correspondence between Selective CPS Transformation and Selective Double Negation Translation“. Mathematics 9, Nr. 4 (15.02.2021): 385. http://dx.doi.org/10.3390/math9040385.
Der volle Inhalt der QuelleAnnotation:
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 via the Curry-Howard isomorphism. By using an annotated proof system derived from the corresponding type and effect system, our selective DNT translates classical proofs into equivalent intuitionistic proofs, which are smaller than those obtained by the usual DNTs. We believe that our work can serve as a reference point for further study on the Curry-Howard isomorphism between CPS transformations and DNTs.
10
LANZET, RAN. „A THREE-VALUED QUANTIFIED ARGUMENT CALCULUS: DOMAIN-FREE MODEL-THEORY, COMPLETENESS, AND EMBEDDING OF FOL“. Review of Symbolic Logic 10, Nr. 3 (08.05.2017): 549–82. http://dx.doi.org/10.1017/s1755020317000053.
Der volle Inhalt der QuelleAnnotation:
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-valued, model-theoretic semantics for Quarc is presented. Interpretations in this semantics are not equipped with domains of quantification: they are just interpretation functions. This reflects the analysis of natural-language quantification on which Quarc is based. A proof system is presented, and a completeness result is obtained. The logic presented here is capable of straightforward translation of the classical first-order predicate calculus, the translation preserving truth values as well as entailment. The first-order predicate calculus and its devices of quantification can be seen as resulting from Quarc on certain semantic and syntactic restrictions, akin to simplifying assumptions. An analogous, straightforward translation of Quarc into the first-order predicate calculus is impossible.
11
Broda, Sabine, und Luís Damas. „Compact bracket abstraction in combinatory logic“. Journal of Symbolic Logic 62, Nr. 3 (September 1997): 729–40. http://dx.doi.org/10.2307/2275570.
Der volle Inhalt der QuelleAnnotation:
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 term. This avoids explosive term growth during successive abstractions and makes the system suitable for practical applications. We prove the correctness of the algorithm and establish some relations between the combinatory system and the Lambda calculus.
12
Dung, P. M., und P. M. Thang. „Closure and Consistency In Logic-Associated Argumentation“. Journal of Artificial Intelligence Research 49 (29.01.2014): 79–109. http://dx.doi.org/10.1613/jair.4107.
Der volle Inhalt der QuelleAnnotation:
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 under contraposition or transposition seem intuitive in ASPIC-like systems, they rule out many sensible ASPIC-like systems that satisfy both properties of closure and consistency. We present a new condition referred to as the self-contradiction axiom that guarantees the consistency property in both ASPIC-like and assumption-based systems and is implied by both properties of closure under contraposition or transposition. We develop a logic-associated abstract argumentation framework, by associating abstract argumentation with abstract logics to represent the conclusions of arguments. We show that logic-associated abstract argumentation frameworks capture ASPIC-like systems (without preferences) and assumption-based argumentation. We present two simple and natural properties of compactness and cohesion in logic-associated abstract argumentation frameworks and show that they capture the logical closure and consistency properties. We demonstrate that in both assumption-based argumentation and ASPIC-like systems, cohesion follows naturally from the self-contradiction axiom. We further give a translation from ASPIC-like systems (without preferences) into equivalent assumption-based systems that keeps the self-contradiction axiom invariant.
13
JULIÁN-IRANZO, PASCUAL, und FERNANDO SÁENZ-PÉREZ. „Planning for an Efficient Implementation of Hypothetical Bousi∼Prolog“. Theory and Practice of Logic Programming 21, Nr. 5 (September 2021): 680–97. http://dx.doi.org/10.1017/s1471068421000405.
Der volle Inhalt der QuelleAnnotation:
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 generate efficient Prolog programmes from Bousi∼Prolog programmes.
14
Min, hoo ki. „The translation of Tongdian(『通典』) Xuanju(選擧) chapter1“. Korean Society of the History of Historiography 46 (30.12.2022): 427–71. http://dx.doi.org/10.29186/kjhh.2022.46.427.
Der volle Inhalt der QuelleAnnotation:
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.
15
Walendziak, Andrzej. „Deductive systems of pseudo-M algebras“. Annales Universitatis Paedagogicae Cracoviensis. Studia Mathematica 21, Nr. 1 (01.01.2022): 93–116. http://dx.doi.org/10.2478/aupcsm-2022-0008.
Der volle Inhalt der QuelleAnnotation:
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 and R-congruences. Finally, the construction of quotient algebra 𝒜/D of a pseudo-M algebra 𝒜 via a translation deductive system D of 𝒜 is given.
16
BLOK, W. J., und J. G. RAFTERY. „ASSERTIONALLY EQUIVALENT QUASIVARIETIES“. International Journal of Algebra and Computation 18, Nr. 04 (Juni 2008): 589–681. http://dx.doi.org/10.1142/s0218196708004627.
Der volle Inhalt der QuelleAnnotation:
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 to their varietal closures under an indicated translation.
17
Simons, Peter. „Term Logic“. Axioms 9, Nr. 1 (10.02.2020): 18. http://dx.doi.org/10.3390/axioms9010018.
Der volle Inhalt der QuelleAnnotation:
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 are described. An obvious translation into monadic predicate logic shows the system is decidable, and additional expressive power brought by adding quantifiers enables numerical predicates to be defined. The system’s advantages for pedagogy are indicated.
18
Fernandez, David. „A polynomial translation of S4 into intuitionistic logic“. Journal of Symbolic Logic 71, Nr. 3 (September 2006): 989–1001. http://dx.doi.org/10.2178/jsl/1154698587.
Der volle Inhalt der QuelleAnnotation:
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 from Int into S4, the Gödel-Tarski translation, is wellknown; given a formula φ of Int, one obtains by prefixing □ to every subformula. For example,.That the translation is sound and faithful can be seen by considering topological semantics, which assign open sets both to □-formulas of S4 and arbitrary formulas of Int; the interpretation of φ and turn out to be identical. See Tarski's paper [6] for details. Gödel's original paper can be found in [3].In [2], Friedman and Flagg present a kind of inverse to Gödel-Tarski. Given a formula φ of S4 and a finite set of formulas Γ of Int, for each ε ∈ Γ one gets an intuitionistic formula given recursively by
19
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.
Der volle Inhalt der QuelleAnnotation:
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 at last.
20
Garcez, Artur S. d'Avila, und Luís C. Lamb. „A Connectionist Computational Model for Epistemic and Temporal Reasoning“. Neural Computation 18, Nr. 7 (Juli 2006): 1711–38. http://dx.doi.org/10.1162/neco.2006.18.7.1711.
Der volle Inhalt der QuelleAnnotation:
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 that nonclassical logics, in particular propositional temporal logic and combinations of temporal and epistemic (modal) reasoning, can be effectively computed by artificial neural networks. We present the language of a connectionist temporal logic of knowledge (CTLK). We then present a temporal algorithm that translates CTLK theories into ensembles of neural networks and prove that the translation is correct. Finally, we apply CTLK to the muddy children puzzle, which has been widely used as a testbed for distributed knowledge representation. We provide a complete solution to the puzzle with the use of simple neural networks, capable of reasoning about knowledge evolution in time and of knowledge acquisition through learning.
21
Guba, A. A., A. V. Kolchin und S. V. Potiyenko. „A method for business logic extraction from legacy COBOL code of industrial systems“. PROBLEMS IN PROGRAMMING, Nr. 2-3 (Juni 2016): 017–25. http://dx.doi.org/10.15407/pp2016.02-03.017.
Der volle Inhalt der QuelleAnnotation:
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.
22
Avron, A. „Multiplicative conjunction and an algebraic meaning of contraction and weakening“. Journal of Symbolic Logic 63, Nr. 3 (September 1998): 831–59. http://dx.doi.org/10.2307/2586715.
Der volle Inhalt der QuelleAnnotation:
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 theorems of SRm is a proper extension of that of Rm, but a proper subset of the set of theorems of RMIm. Hence it still has the variable-sharing property. SRm has also the interesting property that classical logic has a strong translation into it. We next introduce general algebraic structures, called strong multiplicative structures, and prove strong soundness and completeness of SLLm relative to them. We show that in the framework of these structures, the addition of the weakening axiom to SLLm corresponds to the condition that there will be exactly one designated element, while the addition of the contraction axiom corresponds to the condition that there will be exactly one nondesignated element (in the first case we get the system BCKm, in the second - the system SRm). Various other systems in which multiplicative conjunction functions as a true conjunction are studied, together with their algebraic counterparts.
23
Hartono, Hartono, und Tiarma Simanihuruk. „Optimization Model of Fuzzy Rule Based Expert System Using Max-Min Composition and Schema Mapping Translation“. INSIST 2, Nr. 1 (01.04.2017): 30. http://dx.doi.org/10.23960/ins.v2i1.30.
Der volle Inhalt der QuelleAnnotation:
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. Knowledge Based in the other side relates to capturing human cognitive and judgemental processes, such as thinking and reasoning. In this paper, we have proposed a method by using Max-Min Composition combined with Genetic Algorithm for determining membership function of Fuzzy Logic and Schema Mapping Translation for the rules assignment.Keywords— Fuzzy Decision Making, Rule-Based Expert System, Membership Function, Knowledge Based, Max-Min Composition, Schema Mapping Translation
24
Bellantoni, Stephen, und Martin Hofmann. „A new “feasible” arithmetic“. Journal of Symbolic Logic 67, Nr. 1 (März 2002): 104–16. http://dx.doi.org/10.2178/jsl/1190150032.
Der volle Inhalt der QuelleAnnotation:
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 the characterization, one extends the Curry-Howard isomorphism to include modal operations. This leads to a realizability translation based on recent results in higher-type ramified recursion. The fact that induction formulas are not restricted in their logical complexity, allows one to use the Friedman A translation directly.The development also leads us to propose a new Frege rule, the “Modal Extension” rule: if ⊢ ∝ a then ⊢ A ↔ ∝ for new symbol A.
25
Meyer, Robert. „Arithmetic Formulated Relevantly“. Australasian Journal of Logic 18, Nr. 5 (21.07.2021): 154–288. http://dx.doi.org/10.26686/ajl.v18i5.6905.
Der volle Inhalt der QuelleAnnotation:
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 program for proving arithmetic consistent. Under (2), I shall exhibit the requisite translation, drawing some Goedelian conclusions therefrom. Left open, however, is the critical problem whether Ackermann’s rule γ is admissible for theories of relevant arithmetic.
The particular system of relevant Peano arithmetic featured in this paper shall be called R♯. Its logical base shall be the system R of relevant implication, taken in its first-order form RQ. Among other Peano arithmetics we shall consider here in particular the systems C♯, J♯, and RM3♯; these are based respectively on the classical logic C, the intuitionistic logic J, and the Sobocinski-Dunn semi-relevant logic RM3. And another feature of the paper will be the presentation of a system of natural deduction for R♯, along lines valid for first-order relevant theories in general. This formulation of R♯ makes it possible to construct relevantly valid arithmetical deductions in an easy and natural way; it is based on, but is in some respects more convenient than, the natural deduction formulations for relevant logics developed by Anderson and Belnap in Entailment.
26
MacCaull, Wendy. „Relational semantics and a relational proof system for full Lambek calculus“. Journal of Symbolic Logic 63, Nr. 2 (Juni 1998): 623–37. http://dx.doi.org/10.2307/2586855.
Der volle Inhalt der QuelleAnnotation:
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 to FL hold for RelKripke models. Then, in the spirit of the work of Orlowska [14], [15], and Buszkowski and Orlowska [3], we develop relational logic RFL. The adjective relational is used to emphasize the fact that RFL has a semantics wherein formulas are interpreted as relations. We prove that a sequent Γ → α in FL is provable if and only if a translation, t(γ1 ● … ● γn ⊃ α)ευu, has a cut-complete fundamental proof tree. This result is constructive: that is, if a cut-complete proof tree for t(γ1 ● … ● γn ⊃ α)ευu is not fundamental, we can use the failed proof search to build a relational countermodel for t(γ1 ● … ● γn ⊃ α)ευu and from this, build a RelKripke countermodel for γ1 ● … ● γn ⊃ α. These results allow us to add FL, the basic substructural logic, to the list of those logics of importance in computer science with a relational proof theory.
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.
Der volle Inhalt der QuelleAnnotation:
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 property specifications method is also designed by convenience specifications of required property.Required properties can be described by its charts and analyzes its meaning and structures as using patterns diagrams and property and-or tree. On the other hands, it also guarantees stability and limitation of utilizations of patterns using much stronger specifying Dwyer`s meaning based property classification. The PVSL and property charts use hierarchical state machine notation to take advantage of knowledge a person who is one of practitioners has as much as possible, and for Nu-SMV, CW-CNC. They can be adapted to describe property charts and analyze into examples of CTL(Computation Tree Logic) and Modal Mu-Calculus logic that have been already used.Keywords: Patterns, Property specifications, model checking, Software verification
28
Ghilardi, Silvio, und Lorenzo Sacchetti. „Filtering unification and most general unifiers in modal logic“. Journal of Symbolic Logic 69, Nr. 3 (September 2004): 879–906. http://dx.doi.org/10.2178/jsl/1096901773.
Der volle Inhalt der QuelleAnnotation:
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).
29
Ramati, Ido, und Amit Pinchevski. „Uniform multilingualism: A media genealogy of Google Translate“. New Media & Society 20, Nr. 7 (22.08.2017): 2550–65. http://dx.doi.org/10.1177/1461444817726951.
Der volle Inhalt der QuelleAnnotation:
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 is mediated by lingual uniformity on the system side in the form of an English language algorithm, which has recently given way to an artificial neural network interlingual algorithm. We conclude by considering the significance of this recent shift in Translate’s algorithm.
30
Kuehnle, Matthias, Andre Wagner, Alisson V. Brito und 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.
Der volle Inhalt der QuelleAnnotation:
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 is exploited, to integrate the power evaluation technique. The accuracy and speed-up of the approach are illustrated and compared to a conventional power analysis flow using PPR simulation, based on Xilinx technology.
31
SÁENZ-PÉREZ, FERNANDO. „Applying Constraint Logic Programming to SQL Semantic Analysis“. Theory and Practice of Logic Programming 19, Nr. 5-6 (September 2019): 808–25. http://dx.doi.org/10.1017/s1471068419000206.
Der volle Inhalt der QuelleAnnotation:
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 Datalog, and we present an implementation in this system which is currently being tested in classroom, showing its advantages and differences with respect to other approaches, as well as some performance data.
32
PAYKIN, JENNIFER, und STEVE ZDANCEWIC. „A linear/producer/consumer model of classical linear logic“. Mathematical Structures in Computer Science 28, Nr. 5 (27.10.2016): 710–35. http://dx.doi.org/10.1017/s0960129516000347.
Der volle Inhalt der QuelleAnnotation:
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 rules, and a translation of the LPC logic into category theory. The work also presents several concrete instances of the LPC model.
33
Li, Xiaojing, und Shuting Ding. „Interpersonal Interface System of Multimedia Intelligent English Translation Based on Deep Learning“. Scientific Programming 2022 (14.04.2022): 1–9. http://dx.doi.org/10.1155/2022/8027003.
Der volle Inhalt der QuelleAnnotation:
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 collaboration. Intelligent English translation is an innovation and experiment of the English language industry in the field of science and technology. Machine translation is the use of computer programmes to translate natural language into a specific natural language. This interdisciplinary subject includes three subjects: artificial intelligence, computational linguistics, and mathematical logic. Machine translation is becoming more and more popular with the public, and its advantages are mainly that machine translation is much cheaper than manual translation. From this study, it can be seen that the accuracy rate of the traditional ICTCLAS method is 76.40%, while the accuracy rate of the research method in this article is 94.58%, indicating that the research method used in this article is better. Machine translation greatly reduces the cost of translation because there are very few processes that require human participation, and the translation is basically done by computers. It is also an important research content in the field of English major research. Due to the wide range of language cultures and the influence of local culture, thought, and semantic environment, traditional human translation methods have many shortcomings. Nowadays, the demand for translation is unsatisfactory. Based on this, this paper analyzes the application status of intelligent translation, the prospect of intelligent translation, and realizes the optimization design of the human interface system for the intelligent translation of English. Through experiments, it is found that the multimedia intelligent English translation system based on deep learning not only improves the accuracy of English translation but also greatly improves the efficiency of people learning English.
34
Bacon, John. „The completeness of a predicate-functor logic“. Journal of Symbolic Logic 50, Nr. 4 (Dezember 1985): 903–26. http://dx.doi.org/10.2307/2273980.
Der volle Inhalt der QuelleAnnotation:
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 traditional logic: class and relational terms on model-theoretic semantics, schematic terms on Quine's denotational or truth-of semantics. Predicate-functor logic thus stands forth as the pre-eminent first-order term logic, as distinct from propositional-quantificational logic. By the same token, it might with some justification qualify as “first-order combinatory logic”, with allowance for some categorization of the sort eschewed in general combinatory logic, the ultimate term logic.Over the years, Quine has put forward various choices of primitive predicate functors for first-order logic with or without the full theory of identity. Moreover, he has provided translations of quantificational into predicate-functor notation and vice versa ([1971, 312f.], [1981, 651]). Such a translation does not of itself establish semantic completeness, however, in the absence of a proof that it preserves deducibility.An axiomatization of predicate-functor logic was first published by Kuhn [1980], using primitives rather like Quine's. As Kuhn noted, “The axioms and rules have been chosen to facilitate the completeness proof” [1980, 153]. While this expedient simplifies the proof, however, it limits the depth of analysis afforded by the axioms and rules. Mindful of this problem, Kuhn ([1981] and [1983]) boils his axiom system down considerably, correcting certain minor slips in the original paper.
35
В. Г. НІКОНОВА und Р. І. ЛУЦЕНКО. „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, Nr. 2 (26.12.2019): 193–201. http://dx.doi.org/10.32589/2311-0821.2.2019.191992.
Der volle Inhalt der QuelleAnnotation:
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 Ukrainian.Purpose. The purpose of the article is to highlight the peculiarities of similes as a means of representing the author’s worldview and to determine the specificity of their rendering in Ukrainian translations of modern English poetry.Methods. The methodology of the research includes the use of methods of analysis and synthesis for determining the theoretical background of the study; contextual analysis for the selection of illustrative material; lexical, stylistic, and pragmatic analysis as a means of determining the imagery of simile and its transferred meaning in the poem; as well as the methodsof translation analysis in determining the specifics of rendering similes in translation.Results. Simile is a linguistic and stylistic means at the same time; it is a complex system of multifaceted means of expression: morphological, syntactic, lexical, and word-forming, representing the author’s vision of reality through the correlation of objects and phenomena. Figurative comparison (simile), unlike logic one, captures one of the most distinctive features of an object or phenomenon, sometimes unexpected, and makes it the main one ignoring all others. In the works of modern English poets, similes are unexpected, “fresh”, i.e. the authors striveto create new ways to embody their worldview. Rendering such similes is extremely important for understanding the author’s worldview, so the most significant transformations occur in the sphere of lexical units’ meanings and are represented by differentiation and modulation, as well as addition,omission, and total rearrangement.Conclusions. The research reveals that, most often, similes in contemporary English poetry are rendered in Ukrainian translations by using transformations that modify their semantic content. This conclusion confirms that the semantics is the basis for rendering similes in translation.
36
VAN DESSEL, KYLIAN, JO DEVRIENDT und JOOST VENNEKENS. „FOLASP: FO(·) as Input Language for Answer Set Solvers“. Theory and Practice of Logic Programming 21, Nr. 6 (November 2021): 785–801. http://dx.doi.org/10.1017/s1471068421000351.
Der volle Inhalt der QuelleAnnotation:
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 is supported by the IDP inference system, which has successfully competed in a number of ASP competitions. Here, however, technological progress has been hampered by the limited number of systems that are available for FO(·). In this paper, we aim to address this gap by means of a translation tool that transforms an FO(·) specification into ASP-Core-2, thereby allowing ASP-Core-2 solvers to be used as solvers for FO(·) as well. We present experimental results to show that the resulting combination of our translation with an off-the-shelf ASP solver is competitive with the IDP system as a way of solving problems formulated in FO(·).
37
Bhadwal, Neha, Prateek Agrawal und Vishu Madaan. „A Machine Translation System from Hindi to Sanskrit Language using Rule based Approach“. Scalable Computing: Practice and Experience 21, Nr. 3 (01.08.2020): 543–54. http://dx.doi.org/10.12694/scpe.v21i3.1783.
Der volle Inhalt der QuelleAnnotation:
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 that any text in Hindi can be translated to Sanskrit. The technique used for achieving the aforesaid objective is rule-based machine translation. The salient linguistic features of the two languages are used to perform the translation. The results are produced in the form of two confusion matrices wherein a total of 50 random sentences and 100 tokens (Hindi words or phrases) were taken for system evaluation. The semantic evaluation of 100 tokens produce an accuracy of 94% while the pragmatic analysis of 50 sentences produce an accuracy of around 86%. Hence, the proposed system can be used to understand the whole translation process and can further be employed as a tool for learning as well as teaching. Further, this application can be embedded in local communication based assisting Internet of Things (IoT) devices like Alexa or Google Assistant.
38
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, Nr. 122 (13.07.2023): 51–57. http://dx.doi.org/10.7202/1101621ar.
Der volle Inhalt der QuelleAnnotation:
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 informs our linguistic identity – what she calls incarnated bilingualism – we understand how Wolfson’s space is organized by a different logic, non-binary and structured according to his plurilingual translations. For Deleuze and Guattari, Wolfson’s system follows lines of flight and functions based on a reformulation of space similar to the rhizome: non- hierarchical and non-signifying. With Wolfson, the nomad replaces the flaneur, and word play and polysemy replace signification, creating a constantly translated space, one that is finally, but temporarily, livable.
39
BICHLER, MANUEL, MICHAEL MORAK und STEFAN WOLTRAN. „selp: A Single-Shot Epistemic Logic Program Solver“. Theory and Practice of Logic Programming 20, Nr. 4 (26.02.2020): 435–55. http://dx.doi.org/10.1017/s1471068420000022.
Der volle Inhalt der QuelleAnnotation:
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 large, non-ground ASP rules, into the prototype ELP solving system “selp,” which we present in this paper. This solver exhibits competitive performance on a set of ELP benchmark instances.
40
Жақан, М. Қ., Ф. Б. Худойдодзода und Р. Иманжүсіп. „Logical teachings of Ibn Sina and features of syllogisms“. Bulletin of the Karaganda university History.Philosophy series 3, Nr. 103 (30.09.2021): 137–45. http://dx.doi.org/10.31489/2021hph3/137-145.
Der volle Inhalt der QuelleAnnotation:
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 worked in various fields of science, logic has become one of the means of rational thinking: it was used by linguists, philosophers, theologians and even Islamic jurists. Some of them used it secretly and anonymously, because they feared criticism of the opponents of Greek logic from the Islamic apologists. The history of the development of Arab-Muslim logic can be subdivided in several stages. The first of them is the stage of translations of the ancient heritage. The second stage is associated with serious logical research. It starts with al-Farabi and ends with Ibn Sina. The logical research carried out during this period influenced the development of a number of other sciences, including linguistics, kalam and the foundations of legal theology (fiqh). At this stage, very large works combining various logical theories gleaned from antique era or from other sources were written. In an effort to bring logic closer to realities of Muslim life, Muslims have significantly updated logical science. Undoubtedly, with his works Ibn Sina gave a new impetus to the study of logic. This article considers the logical system, syllogistic of the scientist. That is, comparing some aspects of the logical systems of Ibn Sina and Aristotle, the differences of Sheikh ur Rice are emphasized. Ibn Sina also focused on the types of conditionally separating syllogisms in syllogistics. According to academic Dinorshoev, no one had studied this kind of syllogism so thoroughly before Ibn Sina
41
Kozachenko, Nadiia P. „Modelling of AGM-style doxastic operations in three-valued setting“. CTE Workshop Proceedings 10 (21.03.2023): 326–45. http://dx.doi.org/10.55056/cte.553.
Der volle Inhalt der QuelleAnnotation:
The goal of our work is to show how a theoretical approach to modeling of reasoning can be analyzed to identify controversial issues that reveal prospects for further research. We will consider one of the basic approaches to modeling of reasoning based on the concept of belief revision AGM, which is viewed as classical because it formulates the basic concepts of belief, introduces the main ways of representing beliefs, cognitive actions, systems of postulates for cognitive actions and the basic principles for constructing epistemic systems. However, this conceptual foundation raises many controversial issues that require further research, such as the problem of purity of the doxastic operations, the problem of primacy of the doxastic operations and the problem of connection between the doxastic operations. To find a possible solution to these controversial points, we will attempt to model the main ideas of AGM within the framework of standard consistent, and complete logic \L{}3. The basic principle of our translation is the scheme for constructing an epistemic theory proposed by G\"ardenfors, which is considered the basis of AGM. We use a strict three-valued logic formalism to constrain the functioning of doxastic operators and to test how they will function when trying to express the corresponding AGM postulates in a given system. It will allow us to approach the solution of the classical AGM problems or at least to present them from a different perspective. We consider the fundamental possibility of obtaining other doxastic operators in this way and also show how we can implement the minimality criterion for the contraction operator by combining several theorems of three-valued logic. The presented method of translating an informal conceptual scheme into formal logic is convenient for teaching students the basics of modeling and makes it possible to demonstrate the relationships and limitations of the modeled objects and processes.
42
DOU, DEJING, HAN QIN und PAEA LEPENDU. „ONTOGRATE: TOWARDS AUTOMATIC INTEGRATION FOR RELATIONAL DATABASES AND THE SEMANTIC WEB THROUGH AN ONTOLOGY-BASED FRAMEWORK“. International Journal of Semantic Computing 04, Nr. 01 (März 2010): 123–51. http://dx.doi.org/10.1142/s1793351x10000961.
Der volle Inhalt der QuelleAnnotation:
Integrating existing relational databases with ontology-based systems is among the important research problems for the Semantic Web. We have designed a comprehensive framework called OntoGrate which combines a highly automatic mapping system, a logic inference engine, and several syntax wrappers that inter-operate with consistent semantics to answer ontology-based queries using the data from heterogeneous databases. There are several major contributions of our OntoGrate research: (i) we designed an ontology-based framework that provides a unified semantics for mapping discovery and query translation by transforming database schemas to Semantic Web ontologies; (ii) we developed a highly automatic ontology mapping system which leverages object reconciliation and multi-relational data mining techniques; (iii) we developed an inference-based query translation algorithm and several syntax wrappers which can translate queries and answers between relational databases and the Semantic Web. The testing results of our implemented OntoGrate system in different domains show that the large amount of data in relational databases can be directly utilized for answering Semantic Web queries rather than first converting all relational data into RDF or OWL.
43
Garanina, Natalia O., Sergey M. Staroletov, Vladimir E. Zyubin und Igor S. Anureev. „Model checking programs in process-oriented IEC 61131-3 Structured Text“. Modeling and Analysis of Information Systems 31, Nr. 1 (28.03.2024): 32–53. http://dx.doi.org/10.18255/1818-1015-2024-1-32-53.
Der volle Inhalt der QuelleAnnotation:
The process-oriented programming is a paradigm based on the process concept where each process is a concurrent finite state machine inside. The paradigm is intended for PLC (programmable logic controllers) developers to write Industry 4.0-enabled software. The poST language is a promising process-oriented extension of the IEC 61131-3 Structured Text (ST) language designed to provide a conceptual consistency of the PLC source code with technological description of the process under control. This language combines the advantages of FSM-based programming with the standard syntax of the ST language. We propose transformational semantics of poST providing rules for translation of poST language statements to Promela — the input language of the SPIN model checker. Following these semantic rules, our Xtext-based translator outputs a Promela model for the poST program. Our contribution is the poST transformational semantics and the method for automatic generation of the Promela code from poST control programs. The resulting Promela program is ready to be verified with SPIN model checker against linear temporal logic requirements to the source poST program. In the paper we provide an overview of related work, as well as a brief description of the poST and Promela languages. Further, the Promela poST translation rules cover control flow statements, process creation and state management constructs, and timeout management. Then we define service processes for modeling the external environment and managing high-level LTL specifications. Then we present the main ideas of implementing the translator poST to Promela. We also illustrate our approach using the example of a system for managing electricity consumption and production, including renewable sources.
44
Ismail, Aimi Sara, Kherun Nita Ali, Noorminshah A. Iahad, Mukhtar A. Kassem und Najib Taher Al-Ashwal. „BIM-Based Automated Code Compliance Checking System in Malaysian Fire Safety Regulations: A User-Friendly Approach“. Buildings 13, Nr. 6 (29.05.2023): 1404. http://dx.doi.org/10.3390/buildings13061404.
Der volle Inhalt der QuelleAnnotation:
Developing automated code compliance checking systems is becoming increasingly complex—to the extent of challenging the implementation of these systems. This paper addresses the need to develop an automated system that prioritises user accessibility. Accordingly, the study aims to develop a system through a semi-automated rule translation process and the utilisation of BIM models in native file format. A total of 256 fire safety clauses in Malaysian regulations were translated through logic-based approaches (classification technique, decomposition through semantic mark-up method, and interview method), which further assisted in identifying the necessary BIM properties. A visual programming language was then utilised to demonstrate the proof-of-concept prototype. The classification technique and semantic mark-up method were established and structured in this study by developing a framework and flowchart to provide specific guidelines for formalizing the clauses. The semi-automated translation process encouraged the participation of relevant regulatory experts and provided more user accessibility compared to existing studies. This study also offered more practicality for designers to employ the system by utilizing native BIM model data representation. High mean scores ranging from 4.09 to 4.96 were obtained for the validation process, which affirmed the feasibility of the BIM-based Automated System for Malaysian Code Compliance Checking (BIMSMACC) to assist designers.
45
Westphal, Kenneth R. „Force, Understanding and Ontology“. Hegel Bulletin 29, Nr. 1-2 (2008): 1–29. http://dx.doi.org/10.1017/s0263523200000756.
Der volle Inhalt der QuelleAnnotation:
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 spirit was derived from Stoic sources. (Harris 1983, 302)The Stoics were uncompromising materialists and naturalists. Harris (1998, 492) admitted, however, thatNight Thoughtsis less successful thanTowards the Sunlightbecause he didn't have detailed knowledge of contemporaneous natural science and so could not explicate Hegel's philosophy of nature effectively. Similarly, Hegel's 1804–05 philosophy of nature is omitted from the collective translation of Hegel's Jena system edited by Burbidge and di Giovanni becauseits translation would require specialized knowledge that none of the […. translating collective] has and also because it is removed from the interests of all of them. (Hegel 1986,vii–viii.)This lack of interest leaves two members of Hegel's philosophical system – his logic and metaphysics – precariously imbalanced because they lack their third supporting member, the philosophy of nature. This can only result in serious distortion of our understanding of Hegel's system.
46
Holubenko, Nataliia. „Discourse approach to conveying modality in translation“. MESSENGER of Kyiv National Linguistic University. Series Philology 24, Nr. 1 (06.07.2021): 49–56. http://dx.doi.org/10.32589/2311-0821.1.2021.236058.
Der volle Inhalt der QuelleAnnotation:
This paper highlights a brief theoretical and methodological investigation of the most widespread specific features of Translation Studies touching the development of the discourse approach in adequate conveying of modality in translation. The category of modality is examined from the point of view of an interdisciplinary approach that combines results obtained in logic, and traditional linguistics. Modality, originating in the logical philosophical tradition, is one of the most important characteristics of the utterance. It reflects cognitive activity of a person, thus expressing the connections of the objective world. As a functional-semantic category, it contains a number of evaluative means characterizing the attitude of a statement to reality, its objective significance, and the means that characterize the attitude of a speaker to the statement, which reflects its subjective side. Further studies can help to fully attain substantial progress in the analysis of the multimodal systemic functional approach to investigating the variability of expressing the means of modality in translation which may be another step towards a fuller understanding of the nature of this still poorly investigated sphere of translation. This rather interdisciplinary analysis is anchored in Hallidayan systemic functional grammar where "a text is the product of ongoing selection in a very large network of systems – a system network". Thus, a text is analyzed from the point of view of creativity and expression of various modal meanings.
47
Ma, Duo, Yuexin Li, Kaiyue Wu, Zhaoqing Yan, Anli A. Tang, Soma Chaudhary, Zachary M. Ticktin et al. „Multi-arm RNA junctions encoding molecular logic unconstrained by input sequence for versatile cell-free diagnostics“. Nature Biomedical Engineering 6, Nr. 3 (März 2022): 298–309. http://dx.doi.org/10.1038/s41551-022-00857-7.
Der volle Inhalt der QuelleAnnotation:
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 that reduce interference with the output gene. We used the integrated RNA system and sequence-independent input RNAs to execute two-input and three-input OR and AND logic in Escherichia coli, and designed paper-based cell-free colourimetric assays that accurately identified two human immunodeficiency virus (HIV) subtypes (by executing OR logic) in amplified synthetic HIV RNA as well as severe acute respiratory syndrome coronavirus-2 (via two-input AND logic) in amplified RNA from saliva samples. The sequence-independent molecular logic enabled by the integration of multi-arm junction RNAs with motifs for loop-initiated RNA activators may be broadly applicable in biotechnology.
48
DEROSSET, LOUIS. „ON WEAK GROUND“. Review of Symbolic Logic 7, Nr. 4 (02.10.2014): 713–44. http://dx.doi.org/10.1017/s1755020314000306.
Der volle Inhalt der QuelleAnnotation:
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 offers clarity and precision. In this paper, I show how to overcome this problem. I describe a system, the logic of strict ground (LSG) and demonstrate its adequacy; I specify a translation scheme for interpreting Fine’s weak grounding claims; I show that the interpretation verifies all of the principles of Fine’s system; and I show that derivability in Fine’s system can be exactly characterized in terms of derivability in LSG. I conclude that Fine’s system is reducible to LSG.
49
Stefanì, Paolo. „Hidden cultures in law: Metaphor and translation in legal discourse“. Semiotica 2016, Nr. 209 (01.03.2016): 357–70. http://dx.doi.org/10.1515/sem-2016-0020.
Der volle Inhalt der QuelleAnnotation:
AbstractThe paper analyzes the problem of the contemporary societies, characterized by the permanent presence of people belonging to different faiths and the culture. The relationship between law and culture, law and religion, in particular the Christian religion, in the history of western culture, are the focus of the paper. In this way, the paper analyzes the importance of the interdisciplinary approach to this problem, emphasizing the importance of a dialogue between juridical science and semiotics, and the importance of the use of metaphor as a strategy for building an intercultural legal system. This approach at juridical studies allows one to stem the crisis of the “modern” legal system. It is necessary to recovering the authentic sense of generalizations and abstractions of modern law, to create a society based on dialogue between law, culture, and religion, and to go beyond the logic of multiculturalism. To do this, is necessary to realize that words such as freedom, equality, dignity, and autonomy are communication code-words with extraordinary symbolic and political value. To do this, we will need to combine the work of interpretation of the law with that of intercultural translation.
50
von Plato, Jan. „Gentzen's Proof Systems: Byproducts in a Work of Genius“. Bulletin of Symbolic Logic 18, Nr. 3 (September 2012): 313–67. http://dx.doi.org/10.2178/bsl/1344861886.
Der volle Inhalt der QuelleAnnotation:
AbstractGentzen's systems of natural deduction and sequent calculus were byproducts in his program of proving the consistency of arithmetic and analysis. It is suggested that the central component in his results on logical calculi was the use of a tree form for derivations. It allows the composition of derivations and the permutation of the order of application of rules, with a full control over the structure of derivations as a result. Recently found documents shed new light on the discovery of these calculi. In particular, Gentzen set up five different forms of natural calculi and gave a detailed proof of normalization for intuitionistic natural deduction. An early handwritten manuscript of his thesis shows that a direct translation from natural deduction to the axiomatic logic of Hilbert and Ackermann was, in addition to the influence of Paul Hertz, the second component in the discovery of sequent calculus. A system intermediate between the sequent calculus LI and axiomatic logic, denoted LIG in unpublished sources, is implicit in Gentzen's published thesis of 1934–35. The calculus has half rules, half “groundsequents,” and does not allow full cut elimination. Nevertheless, a translation from LI to LIG in the published thesis gives a subformula property for a complete class of derivations in LIG. After the thesis, Gentzen continued to work on variants of sequent calculi for ten more years, in the hope to find a consistency proof for arithmetic within an intuitionistic calculus.