No description available.

Dynamic logic circuits are highly suitable for high-speed applications, considering the fact that they have a smaller area and faster transition. However, their application in space or other radiation-rich environments has been significantly inhibited by their susceptibility to radiation effects. This work begins with the basic operations of dynamic logic circuits, elaborates upon the physics underlying their radiation vulnerability, and evaluates three techniques that harden dynamic logic from the layout: drain extension, pulse quenching, and a proposed method. The drain extension method adds an extra drain to the sensitive node in order to improve charge sharing, the pulse quenching scheme utilizes charge sharing by duplicating a component that offsets the transient pulse, and the proposed technique takes advantage of both. Domino buffers designed using these three techniques, along with a conventional design as reference, were modeled and simulated using a 3D TCAD tool. Simulation results confirm a significant reduction of soft error rate in the proposed technique and suggest a greater reduction with angled incidence. A 130 nm chip containing designed buffer and register chains was fabricated and tested with heavy ion irradiation. According to the experiment results, the proposed design achieved 30% soft error rate reduction, with 19%, 20%, and 10% overhead in speed, power, and area, respectively.

As the application of the consuming electronic products being used extensively, more and more functions can be worked on the same chip. Different function blocks may need different supply voltage. Considering of power consumption, circuit operated at low voltage and low current can achieve power reduction. Due to the energy crisis nowadays, plenty of products begin to focus on the green power. The main advantage of green power is saving power, which will not affect the efficiency. In addition, while the CMOS technology process evolves all the time, the stability of the operation voltage needs to be reduced by the advancement. Thus, the power management in a 3D graphic chip application is going to be introduced in this thesis. Utilizing the linear regulator to reduce the DC to 1.2, 1.1, 1.0, 0.9 and 0.8 V from 3.3V, and support a stable voltage for core circuits and I/O circuits. With the emphasis on the circuit efficiency is affected by power management, the level shifter to embed normal useful digital logic is also investigated. When using in the logic gates, it can reduce power consumption simultaneously. Therefore, it is important to adopt power IC in the future.

The purpose of this work is to investigate how processes of inference are reflected in the grammar of the natural language. I consider a range of phenomena which call for a representational theory of mind and thought. These constructions display a certain regularity in their truth conditions, but the regularity does not extend to closure under arbitrary logical entailment. I develop a logic that allows me to speak formally about classes of inferences. This logic is then applied to analysis of indirect speech, belief reports, evidentials (with special attention to Bulgarian) and clarity assertions. / text

No description available.

A disjunction is an expression using ‘or’, such as ‘Anne has a Ford or a Tesla’. From such a statement, we cannot usually infer either disjunct, for example, that ‘Anne has a Ford’. However, in choice situations like ‘You may have coffee or tea’ we can infer either option. The problem of free choice disjunction is to determine why these choice inferences are legitimate (von Wright 1968, Kamp 1973, Meyer 2016). Central to this discussion is the observation that a modal possibility operator ranging over a disjunction sometimes implies a conjunction of possibilities. In the case of permission, we express this as the choice principle ‘May (P or Q)’ entails ‘May P and May Q’ (Zimmerman 2000). Unfortunately, this inference cannot hold in a logical language without significant modification of the systems involved. I explore the history of proposed solutions to this problem, including semantic solutions that assign a distinctive meaning to free choice disjunctions and pragmatic solutions that use features of their utterance to solve the problem. I draw connections between semantics and pragmatics and, using the tools of dynamic logic (Baltag et al. 1998, van Benthem 2010), I present a formal account of one major (Gricean) approach to the problem (Kratzer & Shimoyama 2002). Ultimately, I explore the role of logic in this debate and argue that we should formally represent the meaning of these expressions directly as conjunctions of possibilities. Thus, rather than trying to account for the choice principle within a logical system, we must instead account for the fact that, in choice situations, the meaning of ‘May (P or Q)’ translates into logical formalism as (May P & May Q). / Thesis / Doctor of Philosophy (PhD) / A disjunction is a statement using ‘or’, like ‘Anne has a Ford or a Tesla’. From such a statement, we cannot infer either disjunct—e.g. ‘Anne has a Ford’. In choice situations like ‘You may have coffee or tea’ we can infer either option. Why this choice inference is legitimate is the problem of free choice disjunction. I explore the history of solutions to the problem, including semantic solutions that propose a special meaning to choice disjunctions and pragmatic solutions that appeal to the circumstances in which they are uttered. I draw connections between semantics and pragmatics and present a formal account of one major pragmatic approach to the problem. Where others have sought to explain how 'May(P or Q)' entails 'May P and May Q', I argue instead that the meaning of ‘May (P or Q)’ in choice scenarios translates directly into logical formalism as ‘May P & May Q’.

Dans cette thèse, nous proposons des modèles logiques pour la représentation des croyances et leur changement dans un cadre multi-agent, en insistant sur l'importance de se fixer un point de vue particulier pour la modélisation. A cet égard, nous distinguons deux approches différentes: l'approche externe, où le modélisateur est quelqu'un d'externe à la situation; l'approche interne, où le modélisateur est l'un des agents. Nous proposons une version interne de la logique épistémique dynamique (avec des modèles d'événements), ce qui nous permet de généraliser facilement la théorie de la révision des croyances d'AGM au cas multi-agent. Ensuite, nous mod´elisons les dynamismes logiques complexes qui soustendent notre interprétation des événements en introduisant des probabilités et des infinitésimaux. Finalement, nous proposons un formalisme alternatif qui n'utilise pas de modèle d'événement mais qui introduit à la place un opérateur d'événement inverse.

Submitted by Franciele Moreira (francielemoreyra@gmail.com) on 2018-02-15T15:02:41Z No. of bitstreams: 2 Dissertação - Thiago de Almeida Bastos -2018 .pdf: 2834099 bytes, checksum: 20704146dd6e29dc70c067fcbd0011a2 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2018-02-16T09:38:12Z (GMT) No. of bitstreams: 2 Dissertação - Thiago de Almeida Bastos -2018 .pdf: 2834099 bytes, checksum: 20704146dd6e29dc70c067fcbd0011a2 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2018-02-16T09:38:12Z (GMT). No. of bitstreams: 2 Dissertação - Thiago de Almeida Bastos -2018 .pdf: 2834099 bytes, checksum: 20704146dd6e29dc70c067fcbd0011a2 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2018-01-30 / This master's thesis seeks to contribute to the automation of production lines, and proposes a methodology for the formal verification of flexible manufacturing models by the Petri-PDL tool. The Petri-PDL framework is based on a multimodal logic associated with a scheme defined for the problem with the Petri nets to specify and model sequential problems demonstrating in logical proofs the correctness of properties inferred by the model. This formal treatment is adapted for the treatment of flexible sequential processes, since these models are used in many other applications with Petri nets. They will be considered models of flexible production system found in the systematic review to evaluate the efficiency of its model and its adaptation to this formal refinement. / Este trabalho busca contribuir com a automação de linhas de produção e propõe uma metodologia para a verificação formal de modelos de manufatura flexível a partir da ferramenta Petri-PDL. O conceito Petri-PDL baseia-se em uma lógica multimodal associada ao esquema definido para o problema com as redes de Petri para especificar e modelar problemas sequenciais demonstrando em provas lógicas a corretude de propriedades inferidas pelo modelo. Este tratamento formal será adaptado para o tratamento de processos sequenciais flexíveis, uma vez que estes modelos são usados em muitas outras aplicações com redes de Petri. Serão considerados modelos de sistema de produção flexível encontrados na revisão sistemática para avaliar a eficiência de seu modelo e sua adaptação a este refinamento formal.

One way of modeling workflows in business process management (BPM) is by using a declarative approach, that is, instead of imperatively specifying what needs to be done, and in what order, one can specify constraints on what is allowed. The result is a more flexible model as everything that does not violate the specified constraints is allowed. In recent years, Linear Temporal Logic on finite traces (LTLf) has been one of the available logics used to specify such constraints. However, LTLf lacks the ability to monitor metaconstraints (i.e., constraints overconstraints). To handle this, one can use Linear Dynamic Logic on finite traces (LDLf) instead. In their paper Monitoring Constraints and Metaconstraints withTemporal Logics on Finite Traces, De Giacomo et al. (2020) presented a framework, and a formal way of translating LDLf formula to an executable Deterministic Finite Automaton (DFA), to be used in BPM. The algorithm they used for the translation was LDLf2NFA. This paper investigates if the construction time, and the size, of the DFA can be reduced by using a compositional algorithm, CLDLf, instead. The results show that the time can be reduced for larger formulae, that is, formulae with a length above 20. However, as both algorithms produce a minimal DFA as the end product, no reduction in size (i.e., the number of states) could be made.

Le projet de cette thèse émane du constat d'une scission entre épistémologie d'une part et logique épistémique d'autre part. Si des tentatives de conciliation se sont avérées fructueuses, nous explorons ici la possibilité d'une réconciliation entre épistémologie et logique épistémique à travers l'argumentation.Étudier la logique épistémique au sein d'une pratique argumentative, c'est-À-Dire au sein de dialogues, nous permet de bénéficier d'un cadre d'étude dynamique pour explorer le dynamisme et la signification du langage de la logique épistémique. Nous montrons que cette conciliation de l'épistémologie et de la logique épistémique dans une pratique argumentative est pertinente dans le domaine juridique car elle offre une approche originale de la notion de condition dans le droit. / The project of this thesis stems from the observation of a split between epistemology and epistemic logic.If some attempts at conciliation have been successful, here we explore the possibility of reconciliation between epistemology and epistemic logic through argumentation.Studying epistemic logic in argumentative practice, that is to say in dialogues, enables us to benefit from a dynamic framework to explore the dynamics and the meaning of the language of epistemic logic.We show that this reconciliation of epistemology and epistemic logic in an argumentative practice is relevant in the legal field because it offers an original approach to the notion of condition in law.