Relevant bibliographies by topics / Logic system translation

Contents

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

Academic literature on the topic 'Logic system translation'

Author: Grafiati
Published: 25 May 2024
Last updated: 31 July 2025

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

Select a source type:

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

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

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

Journal articles on the topic "Logic system translation"

1

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Dissertations / Theses on the topic "Logic system translation"

1

Ferey, Gaspard. "Higher-Order Confluence and Universe Embedding in the Logical Framework." Electronic Thesis or Diss., université Paris-Saclay, 2021. http://www.theses.fr/2021UPASG032.

Full text
Abstract:
La multiplicité des systèmes formels a mis en évidence la nécessité d'un socle logique commun dans lequel les formalismes logiques pourraient être exprimés.L'enjeu principal de ce manuscrit est la définition de techniques d'encodages reposant sur la réécriture de termes et capables de réprésenter les fonctionnalités avancées des systèmes de types modernes.Nos encodages s'appuieront sur le lambda-Pi calcul modulo, un système de types dépendants, communément utilisé comme cadre logique, étendu ici par de laréécriture d'ordre supérieur. On s'intéresse, dans une première partie, aux critères de co
APA, Harvard, Vancouver, ISO, and other styles
2

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

Full text
Abstract:
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, and other styles
3

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

Find full text
Abstract:
Thesis (M.S.)--State University of New York at Binghamton, Department of Computer Science, Thomas J. Watson School of Engineering and Applied Science, 2005.<br>"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, and other styles
4

Ohlström, Sebastian, and 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.

Full text
Abstract:
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 th
APA, Harvard, Vancouver, ISO, and other styles
5

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.

Full text
Abstract:
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-w
APA, Harvard, Vancouver, ISO, and other styles
6

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/.

Full text
Abstract:
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 interfacciar
APA, Harvard, Vancouver, ISO, and other styles
7

Vestin, Albin, and 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.

Full text
Abstract:
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, i
APA, Harvard, Vancouver, ISO, and other styles
8

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

Full text
Abstract:
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, i
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Logic system translation"

1

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

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

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ī. RoutledgeCurzon, 2003.

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

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

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
4

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

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
5

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

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

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

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

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

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

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

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

Davis, Brian, Tobias Kuhn, and Kaarel Kaljurand. Controlled Natural Language: 4th International Workshop, CNL 2014, Galway, Ireland, August 20-22, 2014, Proceedings. Springer, 2014.

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

Davis, Brian, Gordon J. Pace, and Adam Wyner. Controlled Natural Language: 5th International Workshop, CNL 2016, Aberdeen, UK, July 25-27, 2016, Proceedings. Springer, 2016.

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

Book chapters on the topic "Logic system translation"

1

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

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

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

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

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

Full text
Abstract:
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 deta
APA, Harvard, Vancouver, ISO, and other styles
4

Bauer, Esaïe, and Alexis Saurin. "On the cut-elimination of the modal $$\mu $$-calculus: Linear Logic to the rescue." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-90897-2_7.

Full text
Abstract:
Abstract This paper presents a proof-theoretic analysis of the modal $$\mu $$ μ -calculus. More precisely, we prove a syntactic cut-elimination for the non-wellfounded modal $$\mu $$ μ -calculus, using methods from linear logic. and its exponential modalities. To achieve this, we introduce a new system, $$\mu \textsf {LL}_{\Box }^{\infty }$$ μ LL □ ∞ , which is a linear version of the modal $$\mu $$ μ -calculus, intertwining the modalities from the modal $$\mu $$ μ -calculus with the exponential modalities from linear logic. Our strategy for proving cut-elimination involves (i) proving cut-eli
APA, Harvard, Vancouver, ISO, and other styles
5

Niederhauser, Johannes, Chad E. Brown, and Cezary Kaliszyk. "Tableaux for Automated Reasoning in Dependently-Typed Higher-Order Logic." In Automated Reasoning. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-63498-7_6.

Full text
Abstract:
AbstractDependent type theory gives an expressive type system facilitating succinct formalizations of mathematical concepts. In practice, it is mainly used for interactive theorem proving with intensional type theories, with PVS being a notable exception. In this paper, we present native rules for automated reasoning in a dependently-typed version (DHOL) of classical higher-order logic (HOL). DHOL has an extensional type theory with an undecidable type checking problem which contains theorem proving. We implemented the inference rules as well as an automatic type checking mode in Lash, a fork
APA, Harvard, Vancouver, ISO, and other styles
6

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

Full text
Abstract:
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, th
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
Abstract:
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 elementar
APA, Harvard, Vancouver, ISO, and other styles
8

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

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

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

Full text
Abstract:
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, and other styles
10

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

Full text
Abstract:
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 ‘
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Logic system translation"

1

He, Yifan, Munyque Mittelmann, Aniello Murano, Abdallah Saffidine, and Michael Thielscher. "Verification of General Games with Imperfect Information Using Strategy Logic." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/40.

Full text
Abstract:
The Game Description Language with Imperfect Information (GDL-II) is a lightweight formalism for representing the rules of arbitrary games, including those where players have private information. Its purpose is to build general game-playing systems, that is, automated players that can understand the rules of games and learn how to play them without human intervention. Epistemic Strategy Logic (SLK), on the other hand, is a rich logical framework for reasoning about multi-agent systems and the strategic behavior of agents with partial observability. To enable a general game-playing system to ta
APA, Harvard, Vancouver, ISO, and other styles
2

Okulmus, Cem, and Mantas Šimkus. "SHACL Validation under the Well-founded Semantics." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/52.

Full text
Abstract:
W3C has recently introduced SHACL as a new standard for writing integrity constraints on graph-structured data (specifically, on RDF graphs). Unfortunately, the standard defines the semantics of non-recursive constraints only, leaving the case of recursive constraints open. This has spurred recent research efforts into finding a suitable, mathematically crisp semantics for constraints with cyclic dependencies. In this paper, we argue that recursive SHACL can be naturally equipped with a semantics inspired in the well-founded semantics for recursive logic programs with default negation. This se
APA, Harvard, Vancouver, ISO, and other styles
3

Cao, Baiheng, Yaonan Wang, Yijia Zhang, and Bo Ouyang. "RTPbench: A Natural Language to Temporal Logic Translation Benchmark for Multi Robot Heterogeneous Task Planning." In 2024 IEEE International Conference on Unmanned Systems (ICUS). IEEE, 2024. https://doi.org/10.1109/icus61736.2024.10839839.

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

Zhang, Xuan, Cesar Ortega-Sanchez, and 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.

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

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

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

Yao, Yuan, Zhongyong Lu, Qingsong Shi, and 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.

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

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

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
8

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

Full text
Abstract:
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 c
APA, Harvard, Vancouver, ISO, and other styles
9

Valentini, E., E. Haselwanter, R. Ulmer, and 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.

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

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

Full text
Abstract:
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 cor
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Logic system translation"

1

Xu, Chao, Walter Forkel, Stefan Borgwardt, Franz Baader, and 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.

Full text
Abstract:
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,
APA, Harvard, Vancouver, ISO, and other styles
2

Paule, Bernard, Flourentzos Flourentzou, Tristan de KERCHOVE d’EXAERDE, Julien BOUTILLIER, and 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.

Full text
Abstract:
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 infer
APA, Harvard, Vancouver, ISO, and other styles
3

Küsters, Ralf, and 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.

Full text
Abstract:
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 precise
APA, Harvard, Vancouver, ISO, and other styles
4

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

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Logic system translation' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography