Дисертації з теми "Logical encodings"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-15 дисертацій для дослідження на тему "Logical encodings".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Dubois, De Prisque Louise. "Prétraitement compositionnel en Coq." Electronic Thesis or Diss., université Paris-Saclay, 2024. http://www.theses.fr/2024UPASG040.
Повний текст джерелаThis thesis presents a preprocessing methodology aimed at transforming certain statements from the Coq proof assistant's logic into first-order logic statements, in order to send them to automatic provers, in particular SMT solvers. This methodology involves composing small, independent, and certifying transformations, taking the form of Coq tactics. An implementation of this methodology is provided in a plugin called Sniper, which offers a "push-button" automation tactic. Furthermore, a logical transformation scheduler (called Orchestrator) allows adding one's own logical transformations and determines which transformations apply depending on the proof to be carried out
Sheridan, Daniel. "Temporal logic encodings for SAT-based bounded model checking." Thesis, University of Edinburgh, 2006. http://hdl.handle.net/1842/1467.
Повний текст джерелаMalik, Usama Computer Science & Engineering Faculty of Engineering UNSW. "Configuration encoding techniques for fast FPGA reconfiguration." Awarded by:University of New South Wales. School of Computer Science and Engineering, 2006. http://handle.unsw.edu.au/1959.4/26212.
Повний текст джерелаHamdaoui, Yann. "Concurrency, references and linear logic." Thesis, Sorbonne Paris Cité, 2018. http://www.theses.fr/2018USPCC190/document.
Повний текст джерелаThe topic of this thesis is the study of the encoding of references andconcurrency in Linear Logic. Our perspective is to demonstrate the capabilityof Linear Logic to encode side-effects to make it a viable, formalized and wellstudied compilation target for functional languages in the future. The keynotion we develop is that of routing areas: a family of proof nets whichcorrespond to a fragment of differential linear logic and which implementscommunication primitives. We develop routing areas as a parametrizable deviceand study their theory. We then illustrate their expressivity by translating aconcurrent λ-calculus featuring concurrency, references and replication to afragment of differential nets. To this purpose, we introduce a language akin toAmadio’s concurrent λ-calculus, but with explicit substitutions for bothvariables and references. We endow this language with a type and effect systemand we prove termination of well-typed terms by a mix of reducibility and anew interactive technique. This intermediate language allows us to prove asimulation and an adequacy theorem for the translation
Karmarkar, Kedar Madhav. "SCALABLE BUS ENCODING FOR ERROR-RESILIENT HIGH-SPEED ON-CHIP COMMUNICATION." OpenSIUC, 2013. https://opensiuc.lib.siu.edu/dissertations/720.
Повний текст джерелаJohnson, Justin Scott Escobar Martha Cecilia. "Initially held hypothesis does not affect encoding of event frequencies in contingency based causal judgment." Auburn, Ala., 2009. http://hdl.handle.net/10415/1948.
Повний текст джерелаYuan, Zeying. "Sequential Equivalence Checking of Circuits with Different State Encodings by Pruning Simulation-based Multi-Node Invariants." Thesis, Virginia Tech, 2015. http://hdl.handle.net/10919/56693.
Повний текст джерелаMaster of Science
Mailly, Jean-Guy. "Dynamics of argumentation frameworks." Thesis, Artois, 2015. http://www.theses.fr/2015ARTO0402/document.
Повний текст джерелаThis thesis tackles the problem of integrating a new piece of information in an abstract argumentation framework. Such a framework is a directed graph such that its nodes represent the arguments, and the directed edges represent the attacks between arguments. There are different ways to decide which arguments are accepted by the agent who uses such a framework to represent her beliefs.An agent may be confronted with a piece of information such that "this argument should be accepted", which is in contradiction with her current beliefs, represented by her argumentation framework.In this thesis, we have studied several approaches to incorporate a piece of information in an argumentation framework.Our first contribution is an adaptation of the AGM framework for belief revision, which has been developed for characterizing the incorporation of a new piece of information when the agent's beliefs are represented in a logical setting. We have adapted the rationality postulates from the AGM framework to characterize the revision operators suited to argumentation frameworks, and we have identified several ways to generate the argumentation frameworks resulting from the revision.We have also shown how to use AGM revision as a tool for revising argumentation frameworks. Our approach uses a logical encoding of the argumentation framework to take advantage of the classical revision operators, for deriving the expected result.At last, we have studied the problem of enforcing a set of arguments (how to change an argumentation framework so that a given set of arguments becomes an extension). We have developed a new family of operators which guarantee the success of the enforcement process, contrary to the existing approaches, and we have shown that a translation of our approaches into satisfaction and optimization problems makes possible to develop efficient tools for computing the result of the enforcement
Abrahamsson, Olle. "A Gröbner basis algorithm for fast encoding of Reed-Müller codes." Thesis, Linköpings universitet, Matematik och tillämpad matematik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-132429.
Повний текст джерелаSastrawan, Dewa Ayu Dwi Damaiyanti. "The Instagram News Logic : The Encoding and Decoding of News Credibility on Instagram in the COVID-19 Infodemic in Indonesia." Thesis, Uppsala universitet, Medier och kommunikation, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-446746.
Повний текст джерелаTownsend, Joseph Paul. "Artificial development of neural-symbolic networks." Thesis, University of Exeter, 2014. http://hdl.handle.net/10871/15162.
Повний текст джерелаBobot, François. "Logique de séparation et vérification déductive." Phd thesis, Université Paris Sud - Paris XI, 2011. http://tel.archives-ouvertes.fr/tel-00652508.
Повний текст джерелаRuan, Shanq-Jang, and 阮聖彰. "Synthesis of Low Power Pipelined Logic Circuits Using Bipartition and Encoding Techniques." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/47969583754170565902.
Повний текст джерела國立臺灣大學
電機工程學研究所
91
In the last decade, power dissipation has become a critical design metric for an increasingly large number of VLSI circuits. This is largely due to in the use of portable electronic appliances which calls for complex integrated systems that can be powered by lightweight batteries with long periods between recharges. Additionally, the reliability of high performance computation in modern processor is always defeated by increasing heat, which is due to the power consumption. Of particular interest in such systems is pipelining design fashion. In this dissertation, we are concerned with optimizing logic level pipelined circuits for low power. We study the power distribution of a pipeline stage and propose several architectures to achieve the lower power consumption. We employ bipartition and encoding techniques for reducing power in a pipeline stage. We first propose two bipartition architectures: bipartition based on output extraction and bipartition based on Shannon expansion. The former bipartitions the circuit in terms of output clustering characteristic, the latter bipartitions the circuit by Shannon expansion with minimum entropy consideration. In order to further reduce power, we apply encoding techniques to both architectures and propose two novel architectures: bipartition single-encoding architecture and biparition dual-encoding architecture. These two architectures reduce the switch activity of not only combinational logic block but pipelined register. To validate the results, we employ an accurate transistor-level power estimator to estimate power dissipation. The transistor-level power estimator provides accurate power results for analyzing the effect of bipartition and encoding techniques.
(7871015), Nicholas Young. "Coevolution and encoding of fuzzy systems, and multiobjective optimisation." Thesis, 2007. https://figshare.com/articles/thesis/Coevolution_and_encoding_of_fuzzy_systems_and_multiobjective_optimisation/26308066.
Повний текст джерелаThis thesis covers several topics relevant to the design of fuzzy systems using evolutionary algorithms (EAs), with application to control problems and constrained multiobjective problems.
Encoding is a fundamental part of any EA. The solution encoding, and its interactions with the EA's operators, should be designed to minimise arbitrary search bias. A multidimensional encoding suitable for fully specified fuzzy logic rulebases is investigated, and is shown to have better convergence than traditional single -dimensional encoding. By comparison with 2 -point and uniform crossover, the improvement is attributed to the elimination of dimensional encoding bias.
The "curse of dimensionality" is the exponential growth of the search space as the number of decision variables increases. In particular, encoding a fully specified fuzzy logic rulebase can result in a prohibitively large search space. Cooperative coevolution and hierarchical fuzzy rulebases both mitigate the curse of dimensionality through modularity, for evolutionary algorithms and fuzzy systems respectively, and these techniques are shown to be highly compatible with one another. The evolutionary convergence, hierarchical design, and opportunity for parallel computation are analysed for the combined techniques.
Most real -world problems are characterised by multiple, conflicting objectives, and are subject to multiple constraints. Multiobjective optimisation, particularly constrained multiobjective optimisation, is investigated using control and function optimisation benchmark problems.
Two multiobjective diversity measures, hypervolume and distance -to -neighbours, are quantitatively analysed: hypervolume is found to more accurately identify the Pareto front, and distance -to neighbours is found to distribute solutions more uniformly. The inverted pendulum is used as a case study to qualitatively investigate multiobjective design and optimisation of a control problem.
This thesis presents the reconciliation of objective optimisation and constraint satisfaction as the main challenge facing any constrained multiobjective optimisation algorithm, and identifies and investigates two strategies for reconciliation: extended dominance, and blended space.
A novel blended space algorithm - the Blended Rank Evolutionary Algorithm (BREA) -is proposed. BREA dynamically maintains trade-offs between objective optimisation, constraint satisfaction, and population diversity, in order to better identify the Pareto optimal set of solutions in difficult problems. BREA is very favourably compared to the extended dominance algorithm NSGA-II on the nonlinear crop -rotation problem, improving both solution quality and reliability.
Tong, Kuo-Feng. "Simultaneous Plant/Controller Optimization of Traction Control for Electric Vehicle." Thesis, 2007. http://hdl.handle.net/10012/3194.
Повний текст джерела