Увійти

Готові списки джерел за темами / Classical or Formal Logic / Дисертації

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Classical or Formal Logic.

Дисертації з теми "Classical or Formal Logic"

Автор: Grafiati

Опубліковано: 3 червня 2025

Оновлено: 31 липня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-50 дисертацій для дослідження на тему "Classical or Formal Logic".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

Bueno-Soler, Juliana 1976. "Multimodalidades anodicas e catodicas : a negação controlada em logicas multimodais e seu poder expressivo." [s.n.], 2009. http://repositorio.unicamp.br/jspui/handle/REPOSIP/280387.

Повний текст джерела

Анотація:

Orientador: Itala Maria Loffredo D'Ottaviano<br>Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciencias Humanas<br>Made available in DSpace on 2018-09-11T21:14:41Z (GMT). No. of bitstreams: 1 Bueno-Soler_Juliana_D.pdf: 1230879 bytes, checksum: c04ce9e8061c154854f6283749f9c12b (MD5) Previous issue date: 2009<br>Resumo: O presente trabalho tem por objetivo investigar o papel da negação no âmbito das modalidades, de forma a poder esclarecer até que ponto a negação pode ser atenuada, controlada ou mesmo totalmente eliminada em favor da melhor expressabilidade lógi

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Rodrigues, Tarcísio Genaro. "Sobre os fundamentos de programação lógica paraconsistente." [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/278897.

Повний текст джерела

Анотація:

Orientador: Marcelo Esteban Coniglio<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciencias Humanas<br>Made available in DSpace on 2018-08-17T03:29:03Z (GMT). No. of bitstreams: 1 Rodrigues_TarcisioGenaro_M.pdf: 1141020 bytes, checksum: 59bb8a3ae7377c05cf6a8d8e6f7e45a5 (MD5) Previous issue date: 2010<br>Resumo: A Programação Lógica nasce da interação entre a Lógica e os fundamentos da Ciência da Computação: teorias de primeira ordem podem ser interpretadas como programas de computador. A Programação Lógica tem sido extensamente utilizada em ramos da

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Neto, Adolfo Gustavo Serra Seca. "\"Um provador de teoremas multi-estratégia\"." Universidade de São Paulo, 2007. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-04052007-175943/.

Повний текст джерела

Анотація:

Nesta tese apresentamos o projeto e a implementação do KEMS, um provador de teoremas multi-estratégia baseado no método de tablôs KE. Um provador de teoremas multi-estratégia é um provador de teoremas onde podemos variar as estratégias utilizadas sem modificar o núcleo da implementação. Além de multi-estratégia, o KEMS é capaz de provar teoremas em três sistemas lógicos: lógica clássica proposicional, mbC e mCi. Listamos abaixo algumas das contribuições deste trabalho: * um sistema KE para mbC que é analítico, correto e completo; * um sistema KE para mCi que é correto e completo; * um provad

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Urban, Christian. "Classical logic and computation." Thesis, University of Cambridge, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.621950.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Goldsmith, M. H. "Logic, programming and formal specification." Thesis, University of Oxford, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.371541.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

McPartlin, Michael P. "Non-classical modal logic for belief." Thesis, University of Edinburgh, 1991. http://hdl.handle.net/1842/11150.

Повний текст джерела

Анотація:

The standard model of knowledge and belief attributes to agents the ability to reason perfectly in classical logic. This is known as the problem of logical omniscience and, in accordance with the requirements of their contexts of use, has led to the development of a number of alternative epistemic logics. Some of these alternatives can, like the standard model, be regarded as presenting for discussion and analysis in a base language a system of reasoning, or consequence relation: the relation under which beliefs are closed. Adopting this perspective with regard to a useful four-valued logic, t

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Almeida, João Marcos de 1974. "Logics of Formal Inconsistency." Phd thesis, Instituições portuguesas -- UTL-Universidade Técnica de Lisboa -- IST-Instituto Superior Técnico -- -Departamento de Matemática, 2005. http://dited.bn.pt:80/29635.

Повний текст джерела

Анотація:

According to the classical consistency presupposition, contradictions have an explosive character: Whenever they are present in a theory, anything goes, and no sensible reasoning can thus take place. A logic is paraconsistent if it disallows such presupposition, and allows instead for some inconsistent yet non-trivial theories to make perfect sense. The Logics of Formal Inconsistency, LFIs, form a particularly expressive class of paraconsistent logics in which the metatheoretical notion of consistency can be internalized at the object-language level. As a consequence, the LFIs are able to r

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Yim, Austin Vincent. "On Galois correspondences in formal logic." Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:b47d1dda-8186-4c81-876c-359409f45b97.

Повний текст джерела

Анотація:

This thesis examines two approaches to Galois correspondences in formal logic. A standard result of classical first-order model theory is the observation that models of L-theories with a weak form of elimination of imaginaries hold a correspondence between their substructures and automorphism groups defined on them. This work applies the resultant framework to explore the practical consequences of a model-theoretic Galois theory with respect to certain first-order L-theories. The framework is also used to motivate an examination of its underlying model-theoretic foundations. The model-theoreti

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Blot, Valentin. "Game semantics and realizability for classical logic." Thesis, Lyon, École normale supérieure, 2014. http://www.theses.fr/2014ENSL0945/document.

Повний текст джерела

Анотація:

Cette thèse étudie deux modèles de réalisabilité pour la logique classique construits sur la sémantique des jeux HO, interprétant la logique, l'arithmétique et l'analyse classiques directement par des programmes manipulant un espace de stockage d'ordre supérieur.La non-innocence en jeux HO autorise les références d'ordre supérieur, et le non parenthésage révèle la CPS des jeux HO et fournit une catégorie de continuations dans laquelle interpréter le lambda-mu calcul de Parigot. Deux modèles de réalisabilité sont construits sur cette interprétation calculatoire directe des preuves classiques.Le

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Wood, Kenneth Robert. "Parallel logic simulation and applied formal methods." Thesis, University of Oxford, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.315774.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Cholodovskis, Ana Flávia de Faria 1988. "Lógicas de inconsistência formal e não-monotonicidade." [s.n.], 2014. http://repositorio.unicamp.br/jspui/handle/REPOSIP/279773.

Повний текст джерела

Анотація:

Orientador: Walter Alexandre Carnielli<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciências Humanas<br>Made available in DSpace on 2018-08-26T05:10:17Z (GMT). No. of bitstreams: 1 Cholodovskis_AnaFlaviadeFaria_M.pdf: 14177739 bytes, checksum: 714f42d947721ac9da9a5d1e34cd497e (MD5) Previous issue date: 2014<br>Resumo: Existem diversas razões para justificar o desenvolvimento de lógicas não-clássicas tais como a expressividade destas linguagens e como elas poderiam ajudar a formalizar o pensamento humano. Neste sentido, as lógicas não-monotônicas for

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Straßburger, Lutz. "Towards a Theory of Proofs of Classical Logic." Habilitation à diriger des recherches, Université Paris-Diderot - Paris VII, 2011. http://tel.archives-ouvertes.fr/tel-00772590.

Повний текст джерела

Анотація:

Les questions <EM>"Qu'est-ce qu'une preuve?"</EM> et <EM>"Quand deux preuves sont-elles identiques?"</EM> sont fondamentales pour la théorie de la preuve. Mais pour la logique classique propositionnelle --- la logique la plus répandue --- nous n'avons pas encore de réponse satisfaisante. C'est embarrassant non seulement pour la théorie de la preuve, mais aussi pour l'informatique, où la logique classique joue un rôle majeur dans le raisonnement automatique et dans la programmation logique. De même, l'architecture des processeurs est fondée sur la logique classique. Tous les domaines dans lesqu

Стилі APA, Harvard, Vancouver, ISO та ін.

13

PeÌrez, RamiÌrez Miguel. "Formal pragmatic model for imperatives interpretation." Thesis, University of Essex, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.268700.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Mohnke, Janett. "A signature-based approach to formal logic verification." [S.l. : s.n.], 1999. http://deposit.ddb.de/cgi-bin/dokserv?idn=960520406.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Gao, Yongsheng. "Formal representation of acupuncture : concept, theory and logic." Thesis, University of Salford, 2010. http://usir.salford.ac.uk/26685/.

Повний текст джерела

Анотація:

This research investigates the development of a single acupuncture ontology which can represent knowledge from two distinct perspectives, i.e., those of so-called orthodox or Western medicine and those of Chinese medicine. Acupuncture, initially a treatment from ancient Chinese medicine, has been widely adopted by increasing numbers of practitioners of orthodox medicine. However the differences between the two traditions make it difficult to exchange knowledge and to compare findings. With a view to facilitate knowledge sharing, this thesis explores how heterogeneous types of acupuncture knowl

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Le, Son Ngoc. "Formal Verification Methodologies for NULL Convention Logic Circuits." Diss., North Dakota State University, 2020. https://hdl.handle.net/10365/31875.

Повний текст джерела

Анотація:

NULL Convention Logic (NCL) is a Quasi-Delay Insensitive (QDI) asynchronous design paradigm that aims to tackle some of the major problems synchronous designs are facing as the industry trend of increased clock rates and decreased feature size continues. The clock in synchronous designs is becoming increasingly difficult to manage and causing more power consumption than ever before. NCL circuits address some of these issues by requiring less power, producing less noise and electro-magnetic interference, and being more robust to Process, Voltage, and Temperature (PVT) variations. With the incre

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Lieto, Antonio. "Non classical concept representation and reasoning in formal ontologies." Doctoral thesis, Universita degli studi di Salerno, 2012. http://hdl.handle.net/10556/346.

Повний текст джерела

Анотація:

2010 - 2011<br>Formal ontologies are nowadays widely considered a standard tool for knowledge representation and reasoning in the Semantic Web. In this context, they are expected to play an important role in helping automated processes to access information. Namely: they are expected to provide a formal structure able to explicate the relationships between different concepts/terms, thus allowing intelligent agents to interpret, correctly, the semantics of the web resources improving the performances of the search technologies. Here we take into account a problem regarding Knowledge Repre

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Smith, Simon Robert. "Formal justification in requirements engineering." Thesis, University of York, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.319716.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Stewart, Charles A. "On the formulae-as-types correspondence for classical logic." Thesis, University of Oxford, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.393591.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Vinter, Ricky Jay. "Evaluating formal specifications : a cognitive approach." Thesis, University of Hertfordshire, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.268048.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Wang, Suning. "Classical and logic based control theory for finite state machines." Thesis, McGill University, 1991. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=70243.

Повний текст джерела

Анотація:

This thesis formulates the state estimation and control problem for partially observed finite machines in terms of classical and logic-based approaches. First, in Part I, we present a set operation based formulation of an observer (tree) and a dynamic programming based controller. Then we provide the results of computational complexity of building and running such classical observer and controllers. In Part II, we introduce a notion of a logic-based dynamical system, a new paradigm for controlling finite machines. In particular, we give concepts of a logic-based dynamic observer, and a logic-b

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Keeble, Clifford George. "The synthesis of self-timed circuits by formal methods." Thesis, University of Southampton, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239920.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Cardell-Oliver, Rachel Mary. "The formal verification of hard real-time systems." Thesis, University of Cambridge, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239756.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Matthews, Chris, and mikewood@deakin edu au. "Fuzzy concepts and formal methods." Deakin University. School of Management Information Systems, 2001. http://tux.lib.deakin.edu.au./adt-VDU/public/adt-VDU20051201.154843.

Повний текст джерела

Анотація:

It has been recognised that formal methods are useful as a modelling tool in requirements engineering. Specification languages such as Z permit the precise and unambiguous modelling of system properties and behaviour. However some system problems, particularly those drawn from the information systems problem domain, may be difficult to model in crisp or precise terms. It may also be desirable that formal modelling should commence as early as possible, even when our understanding of parts of the problem domain is only approximate. This thesis suggests fuzzy set theory as a possible representati

Стилі APA, Harvard, Vancouver, ISO та ін.

25

TASCHERI, MARIO H. A. "AN INTERACTIVE TOOL TO HELP THE STUDIES OF FORMAL LOGIC." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 1985. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=14259@1.

Повний текст джерела

Анотація:

Neste trabalho investigou-se o emprego dos recentes algoritmos de minimização de funções não diferenciáveis para a resolução do problema da síntese de filtros digitais FIR de fase não linear. O problema desta síntese correspondente a um problema de Aproximações de Funções quando o domínio e o contradomínio da função são corpos diferentes, i.e. real e complexo respectivamente. Serão revistos definições e propriedades dos filtros FIR, as técnicas de síntese para o caso de resposta de fase linear e não linear, para a seguir, apresentar a teoria e implementação da Otimização de Funções não Diferen

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Park, Taeshin 1966. "Formal verification and dynamic validation of logic-based control systems." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/50358.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Wang, Shujing. "Logic programming based formal representations for authorization and security protocols." Thesis, View thesis, 2008. http://handle.uws.edu.au:8081/1959.7/13380.

Повний текст джерела

Анотація:

Logic programming with answer set semantics has been considered appealing rule-based formalism language and applied in information security areas. In this thesis, we investigate the problems of authorization in distributed environments and security protocol verification and update. Authorization decisions are required in large-scale distributed environments, such as electronic commerce, remote resource sharing, etc. We adopt the trust management approach, in which authorization is viewed as a ‘proof of compliance" problem. We develop an authorization language AL with non-monotonic feature as t

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Wang, Shujing. "Logic programming based formal representations for authorization and security protocols." View thesis, 2008. http://handle.uws.edu.au:8081/1959.7/13380.

Повний текст джерела

Анотація:

Thesis (Ph.D.) -- University of Western Sydney, 2008.<br>A thesis submitted for the degree of Doctor of Philosophy to the University of Western Sydney, College of Health and Science, School of Computing and Mathematics. Includes bibliography.

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Gario, Marco. "A Formal Foundation of FDI Design via Temporal Epistemic Logic." Doctoral thesis, Università degli studi di Trento, 2016. https://hdl.handle.net/11572/368759.

Повний текст джерела

Анотація:

Autonomous systems must be able to detect and promptly react to faults. Fault Detection and Identification components (FDI) are in charge of detecting the occurrence of faults. The FDI depends on the concrete design of the system, needs to take into account how faults might interact, and can only have a partial view of the run-time state through sensors. For these reasons, the development of the FDI and certification of its correctness and quality are difficult tasks. This difficulty is compounded by the fact that current approaches for verification of the FDI rely on manual inspection and tes

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Gario, Marco. "A Formal Foundation of FDI Design via Temporal Epistemic Logic." Doctoral thesis, University of Trento, 2016. http://eprints-phd.biblio.unitn.it/1676/1/gario_phd.pdf.

Повний текст джерела

Анотація:

Autonomous systems must be able to detect and promptly react to faults. Fault Detection and Identification components (FDI) are in charge of detecting the occurrence of faults. The FDI depends on the concrete design of the system, needs to take into account how faults might interact, and can only have a partial view of the run-time state through sensors. For these reasons, the development of the FDI and certification of its correctness and quality are difficult tasks. This difficulty is compounded by the fact that current approaches for verification of the FDI rely on manual inspection and te

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Herbert, J. M. J. "Application of formal methods to digital system design." Thesis, University of Cambridge, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.233985.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Weydert, Emil. "How to approximate the naive comprehension scheme inside of classical logic." Bonn : [s.n.], 1989. http://catalog.hathitrust.org/api/volumes/oclc/19990751.html.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Lauser, Alexander [Verfasser], and Volker [Akademischer Betreuer] Diekert. "Formal language theory of logic fragments / Alexander Lauser. Betreuer: Volker Diekert." Stuttgart : Universitätsbibliothek der Universität Stuttgart, 2015. http://d-nb.info/1066239460/34.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Sanchez, Carmona Arturo del Sagrado Corazon. "Formal specification and synthesis of sequential/logic controllers for process systems." Thesis, Imperial College London, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.339262.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Sturla, Giancarlo (Giancarlo F. ). "A two-phased approach for natural language parsing into formal logic." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/113294.

Повний текст джерела

Анотація:

Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 53-56).<br>Natural language is an intuitive medium for a human to communicate with a robot. Additionally, there are many tasks in areas such as manufacturing, military, and disaster response where communication is limited am

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Mendler, M. "A modal logic for handling behavioural constraints in formal hardware verification." Thesis, University of Edinburgh, 1992. http://hdl.handle.net/1842/15374.

Повний текст джерела

Анотація:

The application of formal methods to the design of correct computer hardware depends crucially on the use of abstraction mechanisms to partition the synthesis and verification task into tractable pieces. Unfortunately however, behavioural abstractions are genuine mathematical abstractions only up to behavioural <i>constraints, i.e</i>. under certain restrictions imposed on the device's environment. Timing constraints on input signals form an important class of such restrictions. Hardware components that behave properly only under such constraints satisfy their abstract specifications only appr

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Chakrapani, Rao Arun. "A visual framework for formal systems development using interval temporal logic." Thesis, De Montfort University, 2002. http://hdl.handle.net/2086/13288.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Larese, Costanza. "The principle of analyticity of logic : a philosophical and formal Perspective." Doctoral thesis, Scuola Normale Superiore, 2019. http://hdl.handle.net/11384/86138.

Повний текст джерела

Анотація:

The subject of the present work is the principle of analyticity of logic. In order for the question ‘Is logic analytic?’ to make sense and before trying to ﬁnd an answer to this problem, it is obviously necessary to specify two preliminary issues, namely, the meaning of the term ‘analytic’ and the meaning of the term ‘logic’. The former issue is somehow justiﬁed and expected: after all, analyticity represents one of the philosophical concepts par excellence and, as such, it has been at the core of a lively debate throughout the history of the discipline. But, despite possible appearances to th

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Percival, P. R. "Infinity, knowability and understanding." Thesis, University of Cambridge, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.384322.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Doyle, Edward J. "Two categories of refutation decision procedures for classical and intuitionistic propositional logic." Connect to this title online, 2008. http://etd.lib.clemson.edu/documents/1239896403/.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Deters, Troy Nicholas. "John Dewey's theory of inquiry: an interpretation of a classical American approach to logic." Texas A&M University, 2005. http://hdl.handle.net/1969.1/3795.

Повний текст джерела

Анотація:

During the 20th century, John Dewey introduced a new idea with respect to the nature of logical theory: He presented a portrait of logic as a theory about how organisms interact and maintain an integrated balance between themselves and their environment. He wrote many texts on what he called his theory of inquiry, including Essays in Experimental Logic (1916), Studies in Logical Theory (1903), and How We Think (1910). However, the book where he most closely detailed his theory of inquiry is in his Logic: The Theory of Inquiry (1938). These texts by Dewey have served as the source for much rece

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Gardy, Patrick. "Semantics of Strategy Logic." Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLN022/document.

Повний текст джерела

Анотація:

De nombreux bugs informatiques ont mis en lumière le besoin de certifier les programmes informatiques et la vérification de programmes a connu un développement important au cours des quarante dernières années. Parmi les méthodes possibles, on trouve le model-checking, développé par Clarke et Emerson dans les années 80. Le model-checking consiste à trouver un modèle abstrait pour le système et un formalisme logique pour le comportement puis à vérifier si le modèle vérifie la propriété exprimée dans la logique. La difficulté consiste alors à développer des algorithmes efficaces pour les différen

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Brage, Jens. "A Natural Interpretation of Classical Proofs." Doctoral thesis, Stockholm : Dept. of mathematics, Stockholm university, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-913.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Krenz, René. "Graph dominators in logic synthesis and verification." Licentiate thesis, KTH, KTH, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4293.

Повний текст джерела

Анотація:

<p>This work focuses on the usage of dominators in circuit graphs in order to reduce the complexity of synthesis and verification tasks. One of the contributions of this thesis is a new algorithm for computing multiple-vertex dominators in circuit graphs. Previous algorithms, based on single-vertex dominators suffer from their rare appearance in many circuits. The presented approach searches efficiently for multiple-vertex dominators in circuit graphs. It finds dominator relations, where algorithms for computing single-vertex dominators fail. Another contribution of this thesis is the applicat

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Podiacki, Rodrigo. "Logicas da inconsistencia formal quantificadas." [s.n.], 2008. http://repositorio.unicamp.br/jspui/handle/REPOSIP/281585.

Повний текст джерела

Анотація:

Orientador: Walter Carnielli<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciencias Humanas<br>Made available in DSpace on 2018-08-12T05:55:31Z (GMT). No. of bitstreams: 1 Podiacki_Rodrigo_M.pdf: 538726 bytes, checksum: 3a51529177d89ce92122bde746a321c3 (MD5) Previous issue date: 2008<br>Resumo: Esta dissertação tem como objetivo desenvolver uma semântica correta e completa para uma classe de lógicas de primeira ordem conhecidas como Lógicas da Inconsistência Formal (LIFs). Após uma elucidação geral sobre semânticas paraconsistentes e de primeira ord

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Alves, Thiago de Oliveira. "Lógica formal e sua aplicação na argumentação matemática." Universidade Federal de Juiz de Fora (UFJF), 2016. https://repositorio.ufjf.br/jspui/handle/ufjf/3248.

Повний текст джерела

Анотація:

Submitted by Renata Lopes (renatasil82@gmail.com) on 2017-01-13T17:27:04Z No. of bitstreams: 1 thiagodeoliveiraalves.pdf: 655489 bytes, checksum: e3e858183683f82164e751d989a96b35 (MD5)<br>Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2017-02-07T13:56:24Z (GMT) No. of bitstreams: 1 thiagodeoliveiraalves.pdf: 655489 bytes, checksum: e3e858183683f82164e751d989a96b35 (MD5)<br>Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2017-02-07T14:05:47Z (GMT) No. of bitstreams: 1 thiagodeoliveiraalves.pdf: 655489 bytes, checks

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Burgis, Benjamin. "Truth is a One-Player Game: A Defense of Monaletheism and Classical Logic." Scholarly Repository, 2011. http://scholarlyrepository.miami.edu/oa_dissertations/677.

Повний текст джерела

Анотація:

The Liar Paradox and related semantic antinomies seem to challenge our deepest intuitions about language, truth and logic. Many philosophers believe that to solve them, we must give up either classical logic, or the expressive resources of natural language, or even the “naïve theory of truth” (according to which "P" and “it is true that 'P'” always entail each other). A particularly extreme form of radical surgery is proposed by figures like Graham Priest, who argues for “dialetheism”—the position that some contradictions are actually true—on the basis of the paradoxes. While Priest’s willingn

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Flores, Javier Alejandro. "Autonomous vehicle navigation a comparative study of classical logic and neural network technique /." To access this resource online via ProQuest Dissertations and Theses @ UTEP, 2009. http://0-proquest.umi.com.lib.utep.edu/login?COPT=REJTPTU0YmImSU5UPTAmVkVSPTI=&clientId=2515.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Mukhopadhyay, Trisha. "A Flexible, Natural Deduction, Automated Reasoner for Quick Deployment of Non-Classical Logic." Scholar Commons, 2019. https://scholarcommons.usf.edu/etd/7862.

Повний текст джерела

Анотація:

Automated Theorem Provers (ATP) are software programs which carry out inferences over logico-mathematical systems, often with the goal of finding proofs to some given theorem. ATP systems are enormously powerful computer programs, capable of solving immensely difficult problems. Currently, many automated theorem provers exist like E, vampire, SPASS, ACL2, Coq etc. However, all the available theorem provers have some common problems: (1) Current ATP systems tend not to try to find proofs entirely on their own. They need help from human experts to supply lemmas, guide the proof, etc. (2) There i

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Dimitriov, Jordan. "Developing semantics of Verilog HDL in formal compositional design of mixed hardware/software systems." Thesis, De Montfort University, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.250766.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!