Thematische Bibliographien / Logic system translation

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Logic system translation“

Autor: Grafiati

Veröffentlicht am 25. Mai 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen 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.

Zeitschriftenartikel zum Thema "Logic system translation"

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 Quelle

Annotation:

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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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 Quelle

Annotation:

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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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 Quelle

Annotation:

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 und andere Zitierweisen

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 Quelle

Annotation:

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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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 Quelle

Annotation:

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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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 Quelle

Annotation:

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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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 Quelle

Annotation:

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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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 Quelle

Annotation:

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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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 Quelle

Annotation:

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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Logic system translation"

Lee, Chen-Hsiu. „A tabular propositional logic: and/or Table Translator“. CSUSB ScholarWorks, 2003. https://scholarworks.lib.csusb.edu/etd-project/2409.

Der volle Inhalt der Quelle

Annotation:

The goal of this project is to design a tool to help users translate any logic statement into Disjunctive Normal Form and present the result as an AND/OR TABLE, which makes the logic relation easier to express by using a two-dimensional grid of values or expressions. This tool is implemented through a web-based and Java-based application. Thus, the user can utilize this tool via World Wide Web.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Yourst, Matt T. „Peptidal processor enhanced with programmable translation and integrated dynamic acceleration logic /“. Diss., Online access via UMI:, 2005.

Den vollen Inhalt der Quelle finden

Annotation:

Thesis (M.S.)--State University of New York at Binghamton, Department of Computer Science, Thomas J. Watson School of Engineering and Applied Science, 2005.
"This dissertation is a compound document (contains both a paper copy and a CD as part of the dissertation)"--ProQuest abstract document view. Includes bibliographical references.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ohlström, Sebastian, und Oscar Stenberg. „RPA i offentlig sektor : Översättning av institutionella logiker och lokala idéer“. Thesis, Uppsala universitet, Företagsekonomiska institutionen, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-388391.

Der volle Inhalt der Quelle

Annotation:

Rapid technological development and change in modern society is unprecedented in history.Digitalization and automation of business processes is widely seen as a way of streamliningorganisations and changing institutional settings in them. The impact on individuals andorganisations raison d’etre increases as they face stronger institutional pressure from differentstakeholders. As with every thought that comes to mind, the process of translation tries to remedythe gap in individuals and organisations different outlooks. Grounded in theory of institutionallogics and translation, the authors of this paper set out to approach this institutional complexity byinvestigating it through a lens of these theories. We find that the market and corporate logic areinfluencing all of the organisations, but which of the logics that is most likely to be constituteddepends to a high degree on the local translation process. The translation that is produced dependson the institutional environment that is predominant in the organization. For the organization to besuccessful in rapid technological development and change, a thorough understanding of theincremental institutional complexity is paramount.
Snabb teknisk utveckling och förändring i det moderna samhället är oöverträffad i historien.Digitalisering och automatisering av affärsprocesser ses allmänt som ett sätt att effektiviseraorganisationer och ändra den institutionella sammansättningen i dem. Påverkan på individer ochorganisationers existensberättigande ökar när de står inför starkare institutionellt tryck från olikaintressenter. Översättningsprocessen försöker här avhjälpa klyftan i individers och organisationersolika perspektiv som uppstår när nya idéer får fäste. Grundade i teorin om institutionella logikeroch översättning, försöker författarna till denna uppsats att närma sig denna institutionellakomplexitet genom att använda en lins av dessa teorier. Vi finner att marknads- och företagslogikenpåverkar alla organisationer, men vilken logik som sannolikt kommer att få fäste beror i hög gradpå den lokala översättningsprocessen. Översättningen som produceras beror på den institutionellamiljön som dominerar organisationen. För att organisationen ska lyckas med en snabb tekniskutveckling och förändring, är en grundlig förståelse för den inkrementella institutionellakomplexiteten är avgörande.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Marchese, Luca. „The Khinchin theorem for interval exchange transformations and its consequences for the Teichmüller flow“. Doctoral thesis, Paris 11, 2009. http://www.theses.fr/2009PA112358.

Der volle Inhalt der Quelle

Annotation:

The thesis formulates and proves analogues of the classical Kintchin theorem on rational approximations of irrational numbers for interval exchange transformations and translation surfaces. The classical Kintchin theorem is naturally formulated as a dynamical property of irrational rotations and establishes a dichotomy between two opposite behaviours, according to the convergenge or the divergence of a given series. It can be proved by studying continued fractions expansions and a related dynamical system known as the Gauss map. An interval exchange transformation, or bieftly IET, is a piece-wise continuous isometry of the interval which generalizes the notion of circle rotation. For IETs, a natural generalization of Khinchin property can be stated in terms of the orbits of singularities. The main result of the thesis is a theorem which establishes that the Khinchin property for IETs satisfies the same dichotomy as in the classical case. The approach to the problem naturally exploits the dynamics of a generalization of the Gauss map, known as the Rauzy-Veech induction. It applies combinatorial methods and results developed by Avila-Viana and especially Avila-Gouezel-Yoccoz. Translation surfaces correspond to abelian differentials on closed Riemann surfaces of positive genus. For them a generalization of the Kintchin property is formulated in terms of saddle connections, then it is showed that such property satisfies the same dichotomy as in the classical case. Such version of Khinchin theorem for translation surfaces is a consequence of the main theorem for IETs. The above mentioned results are interesting since they give a fairly complete answer to very natural questions. They also generalize to some extent a crucial result in the theory of the Teichmuller flow, Masur's logarithmic law of geodesics, which gives a bound on how fast the « typical » Teichmuller geodesic wanders « towards infinity » in the moduli space. The thesis also contains some progress on the more delicate question of whether the Kintchin property holds almost everywhere along special curves in the parameter space (related to the action of the circle group on the moduli space of abelian differentials).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Scarlato, Michele. „Sicurezza di rete, analisi del traffico e monitoraggio“. Master's thesis, Alma Mater Studiorum - Università di Bologna, 2012. http://amslaurea.unibo.it/3223/.

Der volle Inhalt der Quelle

Annotation:

Il lavoro è stato suddiviso in tre macro-aree. Una prima riguardante un'analisi teorica di come funzionano le intrusioni, di quali software vengono utilizzati per compierle, e di come proteggersi (usando i dispositivi che in termine generico si possono riconoscere come i firewall). Una seconda macro-area che analizza un'intrusione avvenuta dall'esterno verso dei server sensibili di una rete LAN. Questa analisi viene condotta sui file catturati dalle due interfacce di rete configurate in modalità promiscua su una sonda presente nella LAN. Le interfacce sono due per potersi interfacciare a due segmenti di LAN aventi due maschere di sotto-rete differenti. L'attacco viene analizzato mediante vari software. Si può infatti definire una terza parte del lavoro, la parte dove vengono analizzati i file catturati dalle due interfacce con i software che prima si occupano di analizzare i dati di contenuto completo, come Wireshark, poi dei software che si occupano di analizzare i dati di sessione che sono stati trattati con Argus, e infine i dati di tipo statistico che sono stati trattati con Ntop. Il penultimo capitolo, quello prima delle conclusioni, invece tratta l'installazione di Nagios, e la sua configurazione per il monitoraggio attraverso plugin dello spazio di disco rimanente su una macchina agent remota, e sui servizi MySql e DNS. Ovviamente Nagios può essere configurato per monitorare ogni tipo di servizio offerto sulla rete.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Vestin, Albin, und Gustav Strandberg. „Evaluation of Target Tracking Using Multiple Sensors and Non-Causal Algorithms“. Thesis, Linköpings universitet, Reglerteknik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-160020.

Der volle Inhalt der Quelle

Annotation:

Today, the main research field for the automotive industry is to find solutions for active safety. In order to perceive the surrounding environment, tracking nearby traffic objects plays an important role. Validation of the tracking performance is often done in staged traffic scenarios, where additional sensors, mounted on the vehicles, are used to obtain their true positions and velocities. The difficulty of evaluating the tracking performance complicates its development. An alternative approach studied in this thesis, is to record sequences and use non-causal algorithms, such as smoothing, instead of filtering to estimate the true target states. With this method, validation data for online, causal, target tracking algorithms can be obtained for all traffic scenarios without the need of extra sensors. We investigate how non-causal algorithms affects the target tracking performance using multiple sensors and dynamic models of different complexity. This is done to evaluate real-time methods against estimates obtained from non-causal filtering. Two different measurement units, a monocular camera and a LIDAR sensor, and two dynamic models are evaluated and compared using both causal and non-causal methods. The system is tested in two single object scenarios where ground truth is available and in three multi object scenarios without ground truth. Results from the two single object scenarios shows that tracking using only a monocular camera performs poorly since it is unable to measure the distance to objects. Here, a complementary LIDAR sensor improves the tracking performance significantly. The dynamic models are shown to have a small impact on the tracking performance, while the non-causal application gives a distinct improvement when tracking objects at large distances. Since the sequence can be reversed, the non-causal estimates are propagated from more certain states when the target is closer to the ego vehicle. For multiple object tracking, we find that correct associations between measurements and tracks are crucial for improving the tracking performance with non-causal algorithms.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Stevenson, Lynette. „Modal satisifiability in a constraint logic environment“. Thesis, 2007. http://hdl.handle.net/10500/2030.

Der volle Inhalt der Quelle

Annotation:

The modal satisfiability problem has to date been solved using either a specifically designed algorithm, or by translating the modal logic formula into a different class of problem, such as a first-order logic, a propositional satisfiability problem or a constraint satisfaction problem. These approaches and the solvers developed to support them are surveyed and a synthesis thereof is presented. The translation of a modal K formula into a constraint satisfaction problem, as developed by Brand et al. [18], is further enhanced. The modal formula, which must be in conjunctive normal form, is translated into layered propositional formulae. Each of these layers is translated into a constraint satisfaction problem and solved using the constraint solver ECLiPSe. I extend this translation to deal with reflexive and transitive accessibility relations, thereby providing for the modal logics KT and S4. Two of the difficulties that arise when these accessibility relations are added are that the resultant formula increases considerably in complexity, and that it is no longer in conjunctive normal form (CNF). I eliminate the need for the conversion of the formula to CNF and deal instead with formulae that are in negation normal form (NNF). I apply a number of enhancements to the formula at each modal layer before it is translated into a constraint satisfaction problem. These include extensive simplification, the assignment of a single value to propositional variables that occur only positively or only negatively, and caching the status of the formula at each node of the search tree. All of these significantly prune the search space. The final results I achieve compare favorably with those obtained by other solvers.
Computing
M.Sc. (Computer Science)

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bücher zum Thema "Logic system translation"

A system of Indian logic: The Nyāya theory of inference : analysis, text, translation and interpretaion of the anumāna section of Kārikāvalī, Muktāvali and Dinakarī. London: RoutledgeCurzon, 2003.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Vadim, Kimmelman, Roelofsen Floris, Sassoon Galit W, Schulz Katrin, Westera Matthijs und SpringerLink (Online service), Hrsg. Logic, Language and Meaning: 18th Amsterdam Colloquium, Amsterdam , The Netherlands, December 19-21, 2011, Revised Selected Papers. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

E, Fuchs Norbert, und SpringerLink (Online service), Hrsg. Controlled Natural Language: Second International Workshop, CNL 2010, Marettimo Island, Italy, September 13-15, 2010. Revised Papers. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

E, Fuchs Norbert, und SpringerLink (Online service), Hrsg. Controlled Natural Language: Third International Workshop, CNL 2012, Zurich, Switzerland, August 29-31, 2012. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hegel, Georg Wilhelm Fredrich. Georg Wilhelm Friedrich Hegel: The Science of Logic. Herausgegeben von George Di Giovanni. Cambridge University Press, 2010. http://dx.doi.org/10.1017/9780511780240.

Der volle Inhalt der Quelle

Annotation:

This translation of The Science of Logic (also known as 'Greater Logic') includes the revised Book I (1832), Book II (1813) and Book III (1816). Recent research has given us a detailed picture of the process that led Hegel to his final conception of the System and of the place of the Logic within it. We now understand how and why Hegel distanced himself from Schelling, how radical this break with his early mentor was, and to what extent it entailed a return (but with a difference) to Fichte and Kant. In the introduction to the volume, George Di Giovanni presents in synoptic form the results of recent scholarship on the subject, and, while recognizing the fault lines in Hegel's System that allow opposite interpretations, argues that the Logic marks the end of classical metaphysics. The translation is accompanied by a full apparatus of historical and explanatory notes.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hegel, Georg Wilhelm Fredrich. Georg Wilhelm Friedrich Hegel: Encyclopedia of the Philosophical Sciences in Basic Outline. Herausgegeben von Klaus Brinkmann und Daniel O. Dahlstrom. Cambridge University Press, 2010. http://dx.doi.org/10.1017/9780511780226.

Der volle Inhalt der Quelle

Annotation:

Hegel's Encyclopaedia Logic constitutes the foundation of the system of philosophy presented in his Encyclopaedia of the Philosophical Sciences. Together with his Science of Logic, it contains the most explicit formulation of his enduringly influential dialectical method and of the categorical system underlying his thought. It offers a more compact presentation of his dialectical method than is found elsewhere, and also incorporates changes that he would have made to the second edition of the Science of Logic if he had lived to do so. This volume presents it in a new translation with a helpful introduction and notes. It will be a valuable reference work for scholars and students of Hegel and German idealism, as well as for those who are interested in the post-Hegelian character of contemporary philosophy.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Aloni, Maria, Vadim Kimmelman und Floris Roelofsen. Logic, Language and Meaning: 18th Amsterdam Colloquium, Amsterdam, The Netherlands, December 19-21, 2011, Revised Selected Papers. Springer, 2012.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bastiaanse, Harald, Tikitu de Jager, Katrin Schulz und Maria Aloni. Logic, Language and Meaning: 17th Amsterdam Colloquium, Amsterdam, the Netherlands, December 16-18, 2009, Revised Selected Papers. Springer, 2010.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Information Systems For Indian Languages International Conference Icisil 2011 Patiala India March 911 2011 Proceedings. Springer, 2011.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Rosner, Michael, und Norbert E. Fuchs. Controlled Natural Language: Second International Workshop, CNL 2010, Marettimo Island, Italy, September 13-15, 2010. Revised Papers. Springer, 2012.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Logic system translation"

Choi, J. M., M. S. Song, K. J. Jeong, H. C. Kwon, S. Y. Han und Y. T. Kim. „A Prolog-based Korean-English Machine Translation System and its efficient method of dictionary management“. In Logic Programming '85, 236–45. Berlin, Heidelberg: Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/3-540-16479-0_23.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Nelken, Rani, und Nissim Francez. „Automatic translation of natural language system specifications into temporal logic“. In Computer Aided Verification, 360–71. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61474-5_83.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Suwa, Takashi, und Atsushi Igarashi. „An ML-Style Module System for Cross-Stage Type Abstraction in Multi-stage Programming“. In Functional and Logic Programming, 237–72. Singapore: Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-97-2300-3_13.

Der volle Inhalt der Quelle

Annotation:

AbstractWe propose MetaFM, a novel ML-style module system that enables users to decompose multi-stage programs (i.e., programs written in a typed multi-stage programming language) into loosely coupled components in a manner natural with respect to type abstraction. The distinctive aspect of MetaFM is that it allows values at different stages to be bound in a single structure (i.e., $$ \textbf{struct} \ \cdots \ \textbf{end} $$ struct ⋯ end ). This feature is crucial, for example, for defining a function and a macro that use one abstract type in common, without revealing the implementation detail of that type. MetaFM also accommodates functors, higher-kinded types, the $$\textbf{with} \ \textbf{type} $$ with type -construct, etc. with staging features. For defining semantics and proving type safety, we employ an elaboration technique, i.e., type-directed translation to a target language, inspired by the formalization of F-ing Modules. Specifically, we give a set of elaboration rules for converting MetaFM programs into System F$$\omega ^{\langle \rangle }$$ ω ⟨ ⟩ , a multi-stage extension of System F$$\omega $$ ω , and prove that the elaboration preserves typing. Additionally, our language supports cross-stage persistence (CSP), a feature for code reuse spanning more than one stage, without breaking type safety.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Rothgang, Colin, Florian Rabe und Christoph Benzmüller. „Theorem Proving in Dependently-Typed Higher-Order Logic“. In Automated Deduction – CADE 29, 438–55. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-38499-8_25.

Der volle Inhalt der Quelle

Annotation:

AbstractHigher-order logic HOL offers a very simple syntax and semantics for representing and reasoning about typed data structures. But its type system lacks advanced features where types may depend on terms. Dependent type theory offers such a rich type system, but has rather substantial conceptual differences to HOL, as well as comparatively poor proof automation support.We introduce a dependently-typed extension DHOL of HOL that retains the style and conceptual framework of HOL. Moreover, we build a translation from DHOL to HOL and implement it as a preprocessor to a HOL theorem prover, thereby obtaining a theorem prover for DHOL.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Fukihara, Yōji, und Shin-ya Katsumata. „Generalized Bounded Linear Logic and its Categorical Semantics“. In Lecture Notes in Computer Science, 226–46. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-71995-1_12.

Der volle Inhalt der Quelle

Annotation:

AbstractWe introduce a generalization of Girard et al.’s called (and its affine variant ). It is designed to capture the core mechanism of dependency in , while it is also able to separate complexity aspects of . The main feature of is to adopt a multi-object pseudo-semiring as a grading system of the !-modality. We analyze the complexity of cut-elimination in , and give a translation from with constraints to with positivity axiom. We then introduce indexed linear exponential comonads (ILEC for short) as a categorical structure for interpreting the $${!}$$ ! -modality of . We give an elementary example of ILEC using folding product, and a technique to modify ILECs with symmetric monoidal comonads. We then consider a semantics of using the folding product on the category of assemblies of a BCI-algebra, and relate the semantics with the realizability category studied by Hofmann, Scott and Dal Lago.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Slaby, Wolfgang A. „Segment translation systems“. In Computation Theory and Logic, 382–90. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/3-540-18170-9_180.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Vukmirović, Petar, Jasmin Blanchette und Stephan Schulz. „Extending a High-Performance Prover to Higher-Order Logic“. In Tools and Algorithms for the Construction and Analysis of Systems, 111–29. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30820-8_10.

Der volle Inhalt der Quelle

Annotation:

AbstractMost users of proof assistants want more proof automation. Some proof assistants discharge goals by translating them to first-order logic and invoking an efficient prover on them, but much is lost in translation. Instead, we propose to extend first-order provers with native support for higher-order features. Building on our extension of E to $$\lambda $$ λ -free higher-order logic, we extend E to full higher-order logic. The result is the strongest prover on benchmarks exported from a proof assistant.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Das, Anupam, und Marianna Girlando. „Cyclic Proofs, Hypersequents, and Transitive Closure Logic“. In Automated Reasoning, 509–28. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-10769-6_30.

Der volle Inhalt der Quelle

Annotation:

AbstractWe propose a cut-free cyclic system for Transitive Closure Logic (TCL) based on a form of hypersequents, suitable for automated reasoning via proof search. We show that previously proposed sequent systems are cut-free incomplete for basic validities from Kleene Algebra (KA) and Propositional Dynamic Logic ($$\mathrm {PDL}$$ PDL ), over standard translations. On the other hand, our system faithfully simulates known cyclic systems for KA and $$\mathrm {PDL}$$ PDL , thereby inheriting their completeness results. A peculiarity of our system is its richer correctness criterion, exhibiting ‘alternating traces’ and necessitating a more intricate soundness argument than for traditional cyclic proofs.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Forrest, Jeffrey Yi-Lin. „Systems Science and the Logic of Systemic Reasoning“. In Translational Systems Sciences, 39–68. Singapore: Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-7273-9_2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Murali, Adithya, Lucas Peña, Christof Löding und P. Madhusudan. „A First-Order Logic with Frames“. In Programming Languages and Systems, 515–43. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44914-8_19.

Der volle Inhalt der Quelle

Annotation:

AbstractWe propose a novel logic, called Frame Logic (FL), that extends first-order logic (with recursive definitions) using a construct $$\textit{Sp}(\cdot )$$ Sp ( · ) that captures the implicit supports of formulas— the precise subset of the universe upon which their meaning depends. Using such supports, we formulate proof rules that facilitate frame reasoning elegantly when the underlying model undergoes change. We show that the logic is expressive by capturing several data-structures and also exhibit a translation from a precise fragment of separation logic to frame logic. Finally, we design a program logic based on frame logic for reasoning with programs that dynamically update heaps that facilitates local specifications and frame reasoning. This program logic consists of both localized proof rules as well as rules that derive the weakest tightest preconditions in FL.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Logic system translation"

Zhang, Xuan, Cesar Ortega-Sanchez und Iain Murray. „A System for Fast Text-to-Braille Translation Based on FPGAs“. In 2007 3rd Southern Conference on Programmable Logic. IEEE, 2007. http://dx.doi.org/10.1109/spl.2007.371735.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Fernandez-Amoros, David, Ruben Heradio, Christoph Mayr-Dorn und Alexander Egyed. „A Kconfig Translation to Logic with One-Way Validation System“. In SPLC 2019: 23rd International Systems and Software Product Line Conference. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3336294.3336313.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Yao, Yuan, Zhongyong Lu, Qingsong Shi und Wenzhi Chen. „FPGA based hardware-software co-designed dynamic binary translation system“. In 2013 23rd International Conference on Field Programmable Logic and Applications (FPL). IEEE, 2013. http://dx.doi.org/10.1109/fpl.2013.6645554.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bichler, Manuel, Michael Morak und Stefan Woltran. „Single-Shot Epistemic Logic Program Solving“. In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/237.

Der volle Inhalt der Quelle

Annotation:

Epistemic 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 a prototype ELP solving system. This solver exhibits competitive performance on a set of ELP benchmark instances.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Akintunde, Michael E., Elena Botoeva, Panagiotis Kouvaros und Alessio Lomuscio. „Verifying Strategic Abilities of Neural-symbolic Multi-agent Systems“. In 17th International Conference on Principles of Knowledge Representation and Reasoning {KR-2020}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/kr.2020/3.

Der volle Inhalt der Quelle

Annotation:

We investigate the problem of verifying the strategic properties of multi-agent systems equipped with machine learning-based perception units. We introduce a novel model of agents comprising both a perception system implemented via feed-forward neural networks and an action selection mechanism implemented via traditional control logic. We define the verification problem for these systems against a bounded fragment of alternating-time temporal logic. We translate the verification problem on bounded traces into the feasibility problem of mixed integer linear programs and show the soundness and completeness of the translation. We show that the lower bound of the verification problem is PSPACE and the upper bound is coNEXPTIME. We present a tool implementing the compilation and evaluate the experimental results obtained on a complex scenario of multiple aircraft operating a recently proposed prototype for air-traffic collision avoidance.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Valentini, E., E. Haselwanter, R. Ulmer und T. Popp. „Configurable logic style translation based on an openaccess engine“. In 2005 12th IEEE International Conference on Electronics, Circuits and Systems - (ICECS 2005). IEEE, 2005. http://dx.doi.org/10.1109/icecs.2005.4633506.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Li, Lening, Hazhar Rahmani und Jie Fu. „Probabilistic Planning with Prioritized Preferences over Temporal Logic Objectives“. In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/22.

Der volle Inhalt der Quelle

Annotation:

This paper studies temporal planning in probabilistic environments, modeled as labeled Markov decision processes (MDPs), with user preferences over multiple temporal goals. Existing works reflect such preferences as a prioritized list of goals. This paper introduces a new specification language, termed prioritized qualitative choice linear temporal logic on finite traces, which augments linear temporal logic on finite traces with prioritized conjunction and ordered disjunction from prioritized qualitative choice logic. This language allows for succinctly specifying temporal objectives with corresponding preferences accomplishing each temporal task. The finite traces that describe the system's behaviors are ranked based on their dissatisfaction scores with respect to the formula. We propose a systematic translation from the new language to a weighted deterministic finite automaton. Utilizing this computational model, we formulate and solve a problem of computing an optimal policy that minimizes the expected score of dissatisfaction given user preferences. We demonstrate the efficacy and applicability of the logic and the algorithm on several case studies with detailed analyses for each.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Baldi, Paolo, Petr Cintula und Carles Noguera. „Translating Classical Probability Logics into Modal Fuzzy Logics“. In Proceedings of the 2019 Conference of the International Fuzzy Systems Association and the European Society for Fuzzy Logic and Technology (EUSFLAT 2019). Paris, France: Atlantis Press, 2019. http://dx.doi.org/10.2991/eusflat-19.2019.49.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gogacz, Tomasz, Sanja Lukumbuzya, Magdalena Ortiz und Mantas Šimkus. „Datalog Rewritability and Data Complexity of ALCHOIF with Closed Predicates“. In 17th International Conference on Principles of Knowledge Representation and Reasoning {KR-2020}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/kr.2020/44.

Der volle Inhalt der Quelle

Annotation:

We study the relative expressiveness of ontology-mediated queries (OMQs) formulated in the expressive Description Logic ALCHOIF extended with closed predicates. In particular, we present a polynomial-time translation from OMQs into Datalog with negation under the stable model semantics, the formalism that underlies Answer Set Programming. This is a novel and non-trivial result: the considered OMQs are not only non-monotonic but also feature a tricky combination of nominals, inverse roles, and role functionality. We start with atomic queries and then lift our approach to a large class of first-order queries where quantification is “guarded” by closed predicates. Our translation is based on a characterization of the query answering problem via integer programming, and a specially crafted program in Datalog with negation that finds solutions to dynamically generated systems of integer inequalities. As an important by-product of our translation, we get that the query answering problem is co-NP-complete in data complexity for the considered class of OMQs. Thus, answering these OMQs in the presence of closed predicates is not harder than answering them in the standard setting. This is not obvious as closed predicates are known to increase data complexity for some existing ontology languages.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Umili, Elena, Roberto Capobianco und Giuseppe De Giacomo. „Grounding LTLf Specifications in Image Sequences“. In 20th International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/kr.2023/65.

Der volle Inhalt der Quelle

Annotation:

A critical challenge in neuro-symbolic (NeSy) approaches is to handle the symbol grounding problem without direct supervision. That is mapping high-dimensional raw data into an interpretation over a finite set of abstract concepts with a known meaning, without using labels. In this work, we ground symbols into sequences of images by exploiting symbolic logical knowledge in the form of Linear Temporal Logic over finite traces (LTLf) formulas, and sequence-level labels expressing if a sequence of images is compliant or not with the given formula. Our approach is based on translating the LTLf formula into an equivalent deterministic finite automaton (DFA) and interpreting the latter in fuzzy logic. Experiments show that our system outperforms recurrent neural networks in sequence classification and can reach high image classification accuracy without being trained with any single-image label.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Logic system translation"

Xu, Chao, Walter Forkel, Stefan Borgwardt, Franz Baader und Beihai Zhou. Automatic Translation of Clinical Trial Eligibility Criteria into Formal Queries. Technische Universität Dresden, 2019. http://dx.doi.org/10.25368/2023.224.

Der volle Inhalt der Quelle

Annotation:

Selecting patients for clinical trials is very labor-intensive. Our goal is to develop an automated system that can support doctors in this task. This paper describes a major step towards such a system: the automatic translation of clinical trial eligibility criteria from natural language into formal, logic-based queries. First, we develop a semantic annotation process that can capture many types of clinical trial criteria. Then, we map the annotated criteria to the formal query language. We have built a prototype system based on state-of-the-art NLP tools such as Word2Vec, Stanford NLP tools, and the MetaMap Tagger, and have evaluated the quality of the produced queries on a number of criteria from clinicaltrials.gov. Finally, we discuss some criteria that were hard to translate, and give suggestions for how to formulate eligibility criteria to make them easier to translate automatically.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Paule, Bernard, Flourentzos Flourentzou, Tristan de KERCHOVE d’EXAERDE, Julien BOUTILLIER und Nicolo Ferrari. PRELUDE Roadmap for Building Renovation: set of rules for renovation actions to optimize building energy performance. Department of the Built Environment, 2023. http://dx.doi.org/10.54337/aau541614638.

Der volle Inhalt der Quelle

Annotation:

In the context of climate change and the environmental and energy constraints we face, it is essential to develop methods to encourage the implementation of efficient solutions for building renovation. One of the objectives of the European PRELUDE project [1] is to develop a "Building Renovation Roadmap"(BRR) aimed at facilitating decision-making to foster the most efficient refurbishment actions, the implementation of innovative solutions and the promotion of renewable energy sources in the renovation process of existing buildings. In this context, Estia is working on the development of inference rules that will make it possible. On the basis of a diagnosis such as the Energy Performance Certificate, it will help establishing a list of priority actions. The dynamics that drive this project permit to decrease the subjectivity of a human decisions making scheme. While simulation generates digital technical data, interpretation requires the translation of this data into natural language. The purpose is to automate the translation of the results to provide advice and facilitate decision-making. In medicine, the diagnostic phase is a process by which a disease is identified by its symptoms. Similarly, the idea of the process is to target the faulty elements potentially responsible for poor performance and to propose remedial solutions. The system is based on the development of fuzzy logic rules [2],[3]. This choice was made to be able to manipulate notions of membership with truth levels between 0 and 1, and to deliver messages in a linguistic form, understandable by non-specialist users. For example, if performance is low and parameter x is unfavourable, the algorithm can gives an incentive to improve the parameter such as: "you COULD, SHOULD or MUST change parameter x". Regarding energy performance analysis, the following domains are addressed: heating, domestic hot water, cooling, lighting. Regarding the parameters, the analysis covers the following topics: Characteristics of the building envelope. and of the technical installations (heat production-distribution, ventilation system, electric lighting, etc.). This paper describes the methodology used, lists the fields studied and outlines the expected outcomes of the project.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Küsters, Ralf, und Ralf Molitor. Computing Most Specific Concepts in Description Logics with Existential Restrictions. Aachen University of Technology, 2000. http://dx.doi.org/10.25368/2022.108.

Der volle Inhalt der Quelle

Annotation:

Computing the most specific concept (msc) is an inference task that can be used to support the 'bottom-up' construction of knowledge bases for KR systems based on description logics. For description logics that allow for number restrictions or existential restrictions, the msc need not exist, though. Previous work on this problem has concentrated on description logics that allow for universal value restrictions and number restrictions, but not for existential restrictions. The main new contribution of this paper is the treatment of description logics with existential restrictions. More precisely, we show that, for the description logic ALE (which allows for conjunction, universal value restrictions, existential restrictions, negation of atomic concepts) the msc of an ABox-individual only exists in case of acyclic ABoxes. For cyclic ABoxes, we show how to compute an approximation of the msc. Our approach for computing the (approximation of the) msc is based on representing concept descriptions by certain trees and ABoxes by certain graphs, and then characterizing instance relationships by homomorphisms from trees into graphs. The msc/approximation operation then mainly corresponds to unraveling the graphs into trees and translating them back into concept descriptions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Tarasenko, Rostyslav O., Svitlana M. Amelina und Albert A. Azaryan. Integrated testing system of information competence components of future translators. [б. в.], Juli 2020. http://dx.doi.org/10.31812/123456789/3879.

Der volle Inhalt der Quelle

Annotation:

The article deals with the diagnosis of the formation of the information competence components of translators through testing. The use of testing to determine the level of formation of the information-thematic component of the information competence of translators is demonstrated. It has been established that one of the ways to form the information-thematic component of information competence in the aspect of studying terminology can be the use of thematic networks. The development of a thematic network is shown on the example of the thematic network “Electrical equipment”. The stages of test control, which are consistent with the logic of the organization of the educational process and the process of forming the information competence of the future translator according to the scheme of the developed thematic network, have been determined. These stages are the current, thematic, modular, final testing. The main types of test tasks are defined, the combination of which allows diagnosing the level of formation of the information-thematic component of students’ information competence. Criteria and principles for the selection of test tasks for each of the testing stages are proposed. The ratio of test tasks of different types and complexity at the determined testing stages has been developed. The results of an experimental study on the diagnosis of the formation of the information-thematic component of the information competence of future translators by applying the developed integrative testing system using the Moodle platform are presented.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!