Relevant bibliographies by topics / Modal logic / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Modal logic.

Dissertations / Theses on the topic 'Modal logic'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 2025

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

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Modal logic.'

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.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Wansing, Heinrich. "Displaying modal logic /." Dordrecht [u.a.] : Kluwer, 1998. http://www.gbv.de/dms/ilmenau/toc/24662969X.PDF.

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

Papacchini, Fabio. "Minimal model reasoning for modal logic." Thesis, University of Manchester, 2015. https://www.research.manchester.ac.uk/portal/en/theses/minimal-model-reasoning-for-modal-logic(dbfeb158-f719-4640-9cc9-92abd26bd83e).html.

Full text
Abstract:
Model generation and minimal model generation are useful for tasks such as model checking, query answering and for debugging of logical specifications. Due to this variety of applications, several minimality criteria and model generation methods for classical logics have been studied. Minimal model generation for modal logics how ever did not receive the same attention from the research community. This thesis aims to fill this gap by investigating minimality criteria and designing minimal model generation procedures for all the sublogics of the multi-modal logic S5(m) and their extensions with
APA, Harvard, Vancouver, ISO, and other styles
3

Batchelor, Roderick. "Investigations in modal logic." Thesis, King's College London (University of London), 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.409258.

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

Wilkinson, Toby. "Enriched coalgebraic modal logic." Thesis, University of Southampton, 2013. https://eprints.soton.ac.uk/354112/.

Full text
Abstract:
We formalise the notion of enriched coalgebraic modal logic, and determine conditions on the category V (over which we enrich), that allow an enriched logical connection to be extended to a framework for enriched coalgebraic modal logic. Our framework uses V-functors L: A → A and T: X → X, where L determines the modalities of the resulting modal logics, and T determines the coalgebras that provide the semantics. We introduce the V-category Mod(A, α) of models for an L-algebra (A, α), and show that the forgetful V-functor from Mod(A, α) to X creates conical colimits. The concepts of bisimulatio
APA, Harvard, Vancouver, ISO, and other styles
5

Murakami, Yuko. "Modal logic of partitions." [Bloomington, Ind.] : Indiana University, 2005. http://wwwlib.umi.com/dissertations/fullcit/3162977.

Full text
Abstract:
Thesis (Ph.D.)--Indiana University, Dept. of Philosophy, 2005.<br>Title from PDF t.p. (viewed Dec. 2, 2008). Source: Dissertation Abstracts International, Volume: 66-02, Section: A, page: 0620. Chairs: Lawrence Moss; Michael Dunn.
APA, Harvard, Vancouver, ISO, and other styles
6

Zanichelli, Riccardo <1993&gt. "Aristotle’s modal syllogistic and first-order modal logic." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2022. http://amsdottorato.unibo.it/10396/1/rzamsafml.pdf.

Full text
Abstract:
In Prior Analytics 1.1–22, Aristotle develops his proof system of non-modal and modal propositions. This system is given in the language of propositions, and Aristotle is concerned with establishing some properties and relations that the expressions of this language enjoy. However, modern scholarship has found some of his results inconsistent with positions defended elsewhere. The set of rules of inference of this system has also caused perplexity: there does not seem to be a single interpretation that validates all the rules which Aristotle is explicitly committed to using in his proofs. Som
APA, Harvard, Vancouver, ISO, and other styles
7

Thalmann, Lars. "Term-modal logic and quantifier-free dynamic assignment logic." Doctoral thesis, Uppsala : Institutionen för informationsteknologi, Univ. [distributör], 2000. http://publications.uu.se/theses/91-506-1443-6/.

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

Chou, Soi Ngan. "Normal systems of modal logic." Thesis, University of Macau, 2000. http://umaclib3.umac.mo/record=b1446655.

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

Martin, Alan J. "Modal and fixpoint linear logic." Thesis, University of Ottawa (Canada), 2002. http://hdl.handle.net/10393/6074.

Full text
Abstract:
This thesis provides adaptations of the algebraic and relational semantics of modal logic to model J.-Y. Girard's linear logic extended with general modalities. This work extends the work of M. D'Agostino, D. Gabbay, and A. Russo on modalities in implication systems, which include a fragment of linear logic, and the work of J.-Y. Girard on phase semantics for linear logic. We develop deductive systems based on the Gentzen-style sequent calculi of Ohnishi and Matsumoto and the indexed sequents of Mints, and prove cut-elimination properties. We show that semantics and deductive systems that are
APA, Harvard, Vancouver, ISO, and other styles
10

Costa, Marcos Mota do Carmo. "Characterization of modal (action) logic." Thesis, Imperial College London, 1990. http://hdl.handle.net/10044/1/47821.

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

Frittella, Sabine. "Monotone Modal Logic and Friends." Thesis, Aix-Marseille, 2014. http://www.theses.fr/2014AIXM4751/document.

Full text
Abstract:
Cette thèse étudie la théorie de la correspondance et la théorie des preuves pour la logique modale monotone et les logiques qui en sont proches.La première partie de la thèse établit une connexion formelle entre la théorie de la correspondance algorithmique et des résultats de caractérisation duale pour les treillis finis, similaire à la caractérisation par Nation d'une hiérarchie de variétés de treillis qui généralise les treillis distributifs. Cette connexion formelle est établie en utilisant la logique modale monotone. Nous adaptons l'algorithme ALBA pour la correspondance à l'environnemen
APA, Harvard, Vancouver, ISO, and other styles
12

Rößiger, Martin. "Coalgebras, clone theory, and modal logic." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2000. http://nbn-resolving.de/urn:nbn:de:swb:14-993474604234-75966.

Full text
Abstract:
gekürzte Fassung: Coalgebren wurden sowohl in der Mathematik (seit den 70er Jahren) als auch in der theoretischen Informatik (seit den 90er Jahren) untersucht. In der Mathematik sind Coalgebren dual zu universellen Algebren definiert. Sie bestehen aus einer Trägermenge A zusammen mit Cofunktionen ? : A ? , die A in die n-fache disjunkte Vereinigung von sich selbst abbilden. Das Ziel der Forschung ist hier vor allem, duale Versionen von Definitionen und Resultaten aus der universellen Algebra für die Welt der Coalgebren zu finden. Die theoretische Informatik betrachtet Coalgebren von kategoriel
APA, Harvard, Vancouver, ISO, and other styles
13

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

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

Gaudou, Benoît. "Formalizing social attitudes in modal logic." Toulouse 3, 2008. http://thesesups.ups-tlse.fr/315/.

Full text
Abstract:
Décrire un agent à l'aide de ses états mentaux, comme ses croyances ou ses intentions, est un des moyens les plus puissants pour expliquer ou prédire son comportement. En intelligence artificielle, de nombreuses recherches ont été mené pour décrire en logique (notamment en logique modale) ces attitudes mentales individuelles dans le but de les intégrer dans des agents artificiels. De nombreux exemples, comme : " Le gouvernement pense qu'une guerre est inévitable ", illustrent le fait que des attitudes mentales, en particulier des croyances, peuvent être attribuées à un groupe d'agent. Il est i
APA, Harvard, Vancouver, ISO, and other styles
15

French, Timothy Noel. "Bisimulation quantifiers for modal logics." University of Western Australia. School of Computer Science and Software Engineering, 2006. http://theses.library.uwa.edu.au/adt-WU2007.0013.

Full text
Abstract:
Modal logics have found applications in many diferent contexts. For example, epistemic modal logics can be used to reason about security protocols, temporal modal logics can be used to reason about the correctness of distributed systems and propositional dynamic logic can reason about the correctness of programs. However, pure modal logic is expressively weak and cannot represent many interesting secondorder properties that are expressible, for example, in the μ-calculus. Here we investigate the extension of modal logics with propositional quantification modulo bisimulation (bisimulation quant
APA, Harvard, Vancouver, ISO, and other styles
16

Dickson, Mark William. "Aristotle's modal ontology." Thesis, University of British Columbia, 1989. http://hdl.handle.net/2429/42125.

Full text
Abstract:
ModaI logic is concerned with the logic of necessity and possibility. The central problem of modal ontology is summed up in the following question, "What are the ontological commitments of the user of modal terminology? " This thesis is primarily about the ontological commitments that Aristotle made when he employed modal terms. Aristotle’s modal ontology is h e r e analysed in conjunction with four modal problems. My primary objective, is to clarify some of the discussions of Aristotle's modal ontology that have been advanced by certain twentieth century philosophers. The first pro
APA, Harvard, Vancouver, ISO, and other styles
17

Reddy, Pamoori Venkateswara. "Tableau systems for tense logics : a constraint approach." Thesis, Imperial College London, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.283438.

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

Jungteerapanich, Natthapong. "Tableau systems for the modal μ-calculus". Thesis, University of Edinburgh, 2010. http://hdl.handle.net/1842/4208.

Full text
Abstract:
The main content of this thesis concerns a tableau method for solving the satisfiability problem for the modal μ-calculus. A sound and complete tableau system for the modal μ-calculus is given. Since every tableau in such tableau system is finite and bounded by the length of the formula, the tableau system may be used as a decision procedure for determining the satisfiability of the formula. An alternative proof of the small model property is obtained: every satisfiable formula has a model of size singleexponential in the length of the formula. Contrary to known proofs in literature, the resul
APA, Harvard, Vancouver, ISO, and other styles
19

Girard, Patrick. "Modal logic for belief and preference change /." May be available electronically:, 2008. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.

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

Su, Ezgi Iraz. "Extensions of equilibrium logic by modal concepts." Thesis, Toulouse 3, 2015. http://www.theses.fr/2015TOU30056/document.

Full text
Abstract:
La logique Here-and-there (HT) est une logique monotone à trois valeurs, intermédiaire entre les logiques intuitionniste et classique. La logique de l'équilibre est un formalisme non-monotone dont la sémantique est donnée par un critère de minimalisation sur les modèles de la logique HT. Ce formalisme est fortement lié à la programmation orientée ensemble réponse (ASP), un paradigme relativement nouveau de programmation déclarative. La logique de l'équilibre constitue la base logique de l'ASP: elle reproduit la sémantique par ensemble réponse des programmes logiques et étend la syntaxe de l'AS
APA, Harvard, Vancouver, ISO, and other styles
21

Oliver, Martin John. "Visualisation and manipulation tools for Modal logic." Thesis, Open University, 1998. http://oro.open.ac.uk/56464/.

Full text
Abstract:
In this thesis, an investigation into how visualisation and manipulation tools can provide better support for learners of Modal logic is described. Problems associated with learning Modal logic are also researched. Seven areas topics in Modal logic are investigated, as is the influence of domain independent factors (e. g. motivation) on learning. Studies show that students find concepts such as Modal proofs and systems difficult to learn, whilst possible worlds and Modes are fairly straightforward. Areas such as reference, belief and accessibility relations fall between these extremes. Two rol
APA, Harvard, Vancouver, ISO, and other styles
22

Salvatore, Felipe de Souza. "Topics in modal quantification theory." Universidade de São Paulo, 2015. http://www.teses.usp.br/teses/disponiveis/8/8133/tde-14122015-122734/.

Full text
Abstract:
The modal logic S5 gives us a simple technical tool to analyze some main notions from philosophy (e.g. metaphysical necessity and epistemological concepts such as knowledge and belief). Although S5 can be axiomatized by some simple rules, this logic shows some puzzling properties. For example, an interpolation result holds for the propositional version, but this same result fails when we add first-order quantifiers to this logic. In this dissertation, we study the failure of the Definability and Interpolation Theorems for first-order S5. At the same time, we combine the results of justificatio
APA, Harvard, Vancouver, ISO, and other styles
23

VASCONCELOS, DAVI ROMERO DE. "FIRST-ORDER MODAL LOGIC FOR REASONING ABOUT GAMES." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2007. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=10082@1.

Full text
Abstract:
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>O termo jogo tem sido utilizado como uma metáfora, em várias áreas do conhecimento, para modelar e analisar situações onde agentes(jogadores) interagem em ambientes compartilhados para a realização de seus objetivos sejam eles individuais ou coletivos. Existem diversos modelos propostos para jogos por diferentes áreas do conhecimento, tais como matemática, ciência da computação, ciência política e social, entre outras. Dentre as diversas formas de modelar jogo
APA, Harvard, Vancouver, ISO, and other styles
24

Schwarzentruber, François. "Seeing, Knowing, doing : case studies in modal logic." Toulouse 3, 2010. http://thesesups.ups-tlse.fr/1264/.

Full text
Abstract:
Dans le domaine des jeux vidéos par exemple, surtout des jeux de rôles, les personnages virtuels perçoivent un environnement, en tirent des connaissances puis effectuent des actions selon leur besoin. De même en robotique, un robot perçoit son environnement à l'aide de capteurs/caméras, établit une base de connaissances et effectuent des mouvements etc. La description des comportements de ces agents virtuels et leurs raisonnements peut s'effectuer à l'aide d'un langage logique. Dans cette thèse, on se propose de modéliser les trois aspects "voir", "savoir" et "faire" et leurs interactions à l'
APA, Harvard, Vancouver, ISO, and other styles
25

Pemmaraju, Sriram V. "Modal logics of provability." Thesis, Virginia Tech, 1989. http://hdl.handle.net/10919/44652.

Full text
Abstract:
<p>Gödel proved his Incompleteness theorems for any theory 'strong' enough to represent recursive functions. In the process he showed that the provability predicate can be represented in such theories. Modal logics of provability are modal logics which attempt to express the concept of 'provability' and 'consistency' using the modal operators '[]' and '<>' respectively. This is achieved by forcing '[]' to behave like the provability predicate. GL is a modal logic which has been shown to be complete and sound with respect to arithmetic theories (theories which can represent all recursive
APA, Harvard, Vancouver, ISO, and other styles
26

Motoura, Shota. "A General Framework for Dynamic Epistemic Logic." 京都大学 (Kyoto University), 2017. http://hdl.handle.net/2433/225384.

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

Coscarelli, Bruno Costa. "Introdução à Lógica Modal." Universidade de São Paulo, 2009. http://www.teses.usp.br/teses/disponiveis/45/45131/tde-17062009-161423/.

Full text
Abstract:
O presente trabalho tem como objetivo proporcionar aos estudantes que precisem da lógica modal como ferramenta um texto conciso mas suficientemente completo. Embora seja um texto de cunho matemático, procura-se manter o equilíbrio entre os conceitos matemáticos e suas motivações filosóficas, pela crença de que tal equilíbrio é essencial para situar o pensamento em um texto introdutório. O primeiro capítulo começa com um breve histórico filosófico e trabalha os conceitos fundamentais de um ponto de vista sintático. O segundo capítulo retoma os conceitos do primeiro capítulo de um ponto de vista
APA, Harvard, Vancouver, ISO, and other styles
28

Simpson, Alex K. "The proof theory and semantics of intuitionistic modal logic." Thesis, University of Edinburgh, 1994. http://hdl.handle.net/1842/407.

Full text
Abstract:
Possible world semantics underlies many of the applications of modal logic in computer science and philosophy. The standard theory arises from interpreting the semantic definitions in the ordinary meta-theory of informal classical mathematics. If, however, the same semantic definitions are interpreted in an intuitionistic meta-theory then the induced modal logics no longer satisfy certain intuitionistically invalid principles. This thesis investigates the intuitionistic modal logics that arise in this way. Natural deduction systems for various intuitionistic modal logics are presented. From on
APA, Harvard, Vancouver, ISO, and other styles
29

Chen, Liang-Ting. "On a purely categorical framework for coalgebraic modal logic." Thesis, University of Birmingham, 2014. http://etheses.bham.ac.uk//id/eprint/4882/.

Full text
Abstract:
A category CoLog of distributive laws is introduced to unify different approaches to modal logic for coalgebras, based merely on the presence of a contravariant functor P that maps a state space to its collection of predicates. We show that categorical constructions, including colimits, limits, and compositions of distributive laws as a tensor product, in CoLog generalise and extend existing constructions given for Set coalgebraic logics and that the framework does not depend on any particular propositional logic or state space. In the case that P establishes a dual adjunction with its dual fu
APA, Harvard, Vancouver, ISO, and other styles
30

Cloete, Walter (Walter Theophilus Woldemar). "A many-dimensional approach to simulations in modal logic." Thesis, Stellenbosch : Stellenbosch University, 2012. http://hdl.handle.net/10019.1/20152.

Full text
Abstract:
Thesis (MSc)--Stellenbosch University, 2012.<br>ENGLISH ABSTRACT: Truth preservation is an important topic in model theory. However a brief examination of the models for a logic often show that isomorphism is needlessly restrictive as a truth preserving construction. In the case of modal logics with Kripke semantics the notions of simulation and bisimulation prove far more practical and interesting than isomorphism. We present and study these various notions, followed by a discussion of Shehtman’s frame product as semantics for certain many-dimensional modal logics. We show how simulatio
APA, Harvard, Vancouver, ISO, and other styles
31

Paxton, Alan. "Using modal logic proofs to test implementation-specification relations." Thesis, University of Edinburgh, 2000. http://hdl.handle.net/1842/15603.

Full text
Abstract:
This thesis shows how to make use of the intensional information relating specifications to implementations. It views the proofs of properties of specifications as identifying the intensional parts of implementations relevant to the property. It provides a concrete instance of such proofs by adopting labelled transition systems, modal-mu calculus and the tableau methods of Stirling and Bradfield as a framework for generating intensional information. The intensional information generated from proofs about models of systems can be used to verify behaviours of implementations of systems. By annot
APA, Harvard, Vancouver, ISO, and other styles
32

Kretz, Mathis. "Proof-theoretic aspects of modal logic with fixed points /." Bern : [s.n.], 2006. http://www.zb.unibe.ch/download/eldiss/06kretz_m.pdf.

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

Bruse, Florian [Verfasser]. "Extremal fixpoints for higher-order modal logic / Florian Bruse." Kassel : Universitätsbibliothek Kassel, 2020. http://d-nb.info/1220854093/34.

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

Peron, Newton Marques 1982. "(In)completude modal por (N)matrizes finitas." [s.n.], 2014. http://repositorio.unicamp.br/jspui/handle/REPOSIP/281196.

Full text
Abstract:
Orientador: Marcelo Esteban Coniglio<br>Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciências Humanas<br>Made available in DSpace on 2018-08-25T12:43:36Z (GMT). No. of bitstreams: 1 Peron_NewtonMarques_D.pdf: 1773917 bytes, checksum: da2d2a1b1ecf8da6e26e419dee4888c5 (MD5) Previous issue date: 2014<br>Resumo: Esse é um estudo sobre a viabilidade de matrizes finitas como semântica para lógica modal. Separamos nossa análise em dois casos: matrizes determinísticas e não-determinísticas. No primeiro caso, generalizamos o Teorema de Incompletude de Dugundji, garan
APA, Harvard, Vancouver, ISO, and other styles
35

Fajardo, Rogerio Augusto dos Santos. "\"Combinações de lógicas modais não-normais\"." Universidade de São Paulo, 2004. http://www.teses.usp.br/teses/disponiveis/45/45131/tde-13122007-203348/.

Full text
Abstract:
Neste trabalho, estudamos algumas formas de combinar sistemas de Lógica Modal, analisando quando a combinação preserva propriedades como correção, completude e decidibilidade. Estendemos um estudo já realizado sobre combinações de sistemas de Lógica Modal Normal para sistemas de Lógica Modal Não-normal. O principal resultado deste trabalho é a preservação de completude da aplicação externa de um sistema de Lógica Modal Não-normal M em um sistema lógico L. Outro resultado importante é um exemplo de interação forte na combinação independente, ou fusão, de dois sistemas de Lógica Modal Não-norm
APA, Harvard, Vancouver, ISO, and other styles
36

Creel, James Silas. "Intention is commitment with expectation." Texas A&M University, 2005. http://hdl.handle.net/1969.1/2313.

Full text
Abstract:
Modal logics with possible worlds semantics can be used to represent mental states such as belief, goal, and intention, allowing one to formally describe the rational behavior of agents. Agent??s beliefs and goals are typically represented in these logics by primitive modal operators. However, the representation of agent??s intentions varies greatly between theories. Some logics characterize intention as a primitive operator, while others define intention in terms of more primitive constructs. Taking the latter approach is a theory due to Philip Cohen and Hector Levesque, under which intention
APA, Harvard, Vancouver, ISO, and other styles
37

Guido, Nicola. "On the Static Analysis for SPARQL Queries using Modal Logic." Thesis, Université Grenoble Alpes (ComUE), 2015. http://www.theses.fr/2015GREAM059/document.

Full text
Abstract:
L’analyse statique est une tâche essentielle dans l’optimisation des requêtes et la vérification de la base de graphes RDF. Nous étudions des techniques d’analyse statique pour SPARQL, le langage standard pour l’interrogation des données du Web sémantique. Plus précisément, nous étudions le problème d’inclusion des requêtes et de l’analyse de l’indépendance entre les requêtes et la mise à jour de la base de graphes RDF.Nous sommes intéressés par le développement de techniques grâce à des réductions au problème de la satisfaisabilité de la logique.Nous nous traitons le problème d’inclusion des
APA, Harvard, Vancouver, ISO, and other styles
38

Mio, Matteo. "Game semantics for probabilistic modal μ-calculi". Thesis, University of Edinburgh, 2012. http://hdl.handle.net/1842/6223.

Full text
Abstract:
The probabilistic (or quantitative) modal μ-calculus is a fixed-point logic designed for expressing properties of probabilistic labeled transition systems (PLTS’s). Two semantics have been studied for this logic, both assigning to every process state a value in the interval [0, 1] representing the probability that the property expressed by the formula holds at the state. One semantics is denotational and the other is a game semantics, specified in terms of two-player stochastic games. The two semantics have been proved to coincide on all finite PLTS’s. A first contribution of the thesis is to
APA, Harvard, Vancouver, ISO, and other styles
39

Kniazev, Roman. "On geometric models of epistemic logic." Electronic Thesis or Diss., Institut polytechnique de Paris, 2023. http://www.theses.fr/2023IPPAX132.

Full text
Abstract:
Il y a environ 30 ans, deux approches majeures pour l'étude des systèmes distribués ont été développées. Une des approches a établi une perspective topologique sur le calcul distribué,exprimant la solvabilité des tâches distribuées à travers des notions standards de topologie algébrique, en modélisant les espaces d'états sous forme de complexes simpliciaux. En parallèle, une application importante de la logique épistémique, un type de logique modale, a apporté un point de vue alternatif sur la structure des systèmes distribués, en utilisant la notion de connaissance pour décrire le comportemen
APA, Harvard, Vancouver, ISO, and other styles
40

Nair, Vineet. "On Extending BDI Logics." Thesis, Griffith University, 2003. http://hdl.handle.net/10072/365892.

Full text
Abstract:
In this thesis we extend BDI logics, which are normal multimodal logics with an arbitrary set of normal modal operators, from three different perspectives. Firstly, based on some recent developments in modal logic, we examine BDI logics from a combining logic perspective and apply combination techniques like fibring/dovetailing for explaining them. The second perspective is to extend the underlying logics so as to include action constructs in an explicit way based on some recent action-related theories. The third perspective is to adopt a non-monotonic logic like defeasible logic to reason abo
APA, Harvard, Vancouver, ISO, and other styles
41

Gore, Rajeev. "Cut-free sequent and tableau systems for propositional normal modal logics." Thesis, University of Cambridge, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239668.

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

Figueiredo, Daniel Oliveira. "Differential dynamic logic and applications." Master's thesis, Universidade de Aveiro, 2015. http://hdl.handle.net/10773/16841.

Full text
Abstract:
Mestrado em Matemática e Aplicações<br>Na área industrial e habitual usar ferramentas discretas em sistemas cuja evolução e contínua e regida pelas leis da mecânica. Estes sistemas que apresentam tanto comportamento contínuo como discreto são conhecidos como sistemas híbridos. A lógica diferencial dinâmica e uma lógica desenvolvida recentemente para trabalhar com estes sistemas. Neste trabalho, apresentamos a lógica diferencial dinâmica como uma generalização da lógica dinâmica (e, consequentemente, da lógica modal). Também são apresentadas algumas aplicações e discutida a utilidade
APA, Harvard, Vancouver, ISO, and other styles
43

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

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

Kramdi, Seifeddine. "A modal approach to model computational trust." Thesis, Toulouse 3, 2015. http://www.theses.fr/2015TOU30146/document.

Full text
Abstract:
Le concept de confiance est un concept sociocognitif qui adresse la question de l'interaction dans les systèmes concurrents. Quand la complexité d'un système informatique prohibe l'utilisation de solutions traditionnelles de sécurité informatique en amont du processus de développement (solutions dites de type dur), la confiance est un concept candidat, pour le développement de systèmes d'aide à l'interaction. Dans cette thèse, notre but majeur est de présenter une vue d'ensemble de la discipline de la modélisation de la confiance dans les systèmes informatiques, et de proposer quelques modèles
APA, Harvard, Vancouver, ISO, and other styles
45

Lehtinen, Maria Karoliina. "Syntactic complexity in the modal μ calculus". Thesis, University of Edinburgh, 2017. http://hdl.handle.net/1842/29520.

Full text
Abstract:
This thesis studies how to eliminate syntactic complexity in Lμ, the modal μ calculus. Lμ is a verification logic in which a least fixpoint operator μ, and its dual v, add recursion to a simple modal logic. The number of alternations between μ and v is a measure of complexity called the formula’s index: the lower the index, the easier a formula is to model-check. The central question of this thesis is a long standing one, the Lμ index problem: given a formula, what is the least index of any equivalent formula, that is to say, its semantic index? I take a syntactic approach, focused on simplify
APA, Harvard, Vancouver, ISO, and other styles
46

Johnston, Spencer C. "Essentialism, nominalism, and modality : the modal theories of Robert Kilwardby & John Buridan." Thesis, University of St Andrews, 2015. http://hdl.handle.net/10023/7820.

Full text
Abstract:
In the last 30 years there has been growing interest in and a greater appreciation of the unique contributions that medieval authors have made to the history of logic. In this thesis, we compare and contrast the modal logics of Robert Kilwardby and John Buridan and explore how their two conceptions of modality relate to and differ from modern notions of modal logic. We develop formal reconstructions of both authors' logics, making use of a number of different formal techniques. In the case of Robert Kilwardby we show that using his distinction between per se and per accidens modalities, he is
APA, Harvard, Vancouver, ISO, and other styles
47

Fritz, Peter. "Intensional type theory for higher-order contingentism." Thesis, University of Oxford, 2015. http://ora.ox.ac.uk/objects/uuid:b9415266-ad21-494a-9a78-17d2395eb8dd.

Full text
Abstract:
Things could have been different, but could it also have been different what things there are? It is natural to think so, since I could have failed to be born, and it is natural to think that I would then not have been anything. But what about entities like propositions, properties and relations? Had I not been anything, would there have been the property of being me? In this thesis, I formally develop and assess views according to which it is both contingent what individuals there are and contingent what propositions, properties and relations there are. I end up rejecting these views, and con
APA, Harvard, Vancouver, ISO, and other styles
48

Zaverucha, Gerson. "A nonmonotonic multi-agent logic of belief : a Modal Defeasible Relevant approach." Thesis, Imperial College London, 1990. http://hdl.handle.net/10044/1/46629.

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

Castellini, Claudio. "Automated reasoning in quantified modal and temporal logics." Thesis, University of Edinburgh, 2005. http://hdl.handle.net/1842/753.

Full text
Abstract:
This thesis is about automated reasoning in quantified modal and temporal logics, with an application to formal methods. Quantified modal and temporal logics are extensions of classical first-order logic in which the notion of truth is extended to take into account its necessity or equivalently, in the temporal setting, its persistence through time. Due to their high complexity, these logics are less widely known and studied than their propositional counterparts. Moreover, little so far is known about their mechanisability and usefulness for formal methods. The relevant contributions of this t
APA, Harvard, Vancouver, ISO, and other styles
50

Gutierrez, Julian. "On bisimulation and model-checking for concurrent systems with partial order semantics." Thesis, University of Edinburgh, 2011. http://hdl.handle.net/1842/5281.

Full text
Abstract:
In concurrency theory—the branch of (theoretical) computer science that studies the logical and mathematical foundations of parallel computation—there are two main formal ways of modelling the behaviour of systems where multiple actions or events can happen independently and at the same time: either with interleaving or with partial order semantics. On the one hand, the interleaving semantics approach proposes to reduce concurrency to the nondeterministic, sequential computation of the events the system can perform independently. On the other hand, partial order semantics represent concurrency
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Modal logic' for other source types:
Journal articles Books
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