Log in

Relevant bibliographies by topics / Theory of algorithms and mathematical logic / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Theory of algorithms and mathematical logic.

Dissertations / Theses on the topic 'Theory of algorithms and mathematical logic'

Author: Grafiati

Published: 28 May 2022

Last updated: 30 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 'Theory of algorithms and mathematical 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

Tabada, Winston M. "An analysis and implementation of linear derivation strategies." Thesis, Edith Cowan University, Research Online, Perth, Western Australia, 1991. https://ro.ecu.edu.au/theses/1125.

Full text

Abstract:

This study examines the efficacy of six linear derivation strategies: (i) s-linear resolution, (ii) the ME procedure; (iii) t-linear resolution, (iv) SL -resolution, (v) the GC procedure, and (vi) SLM. The analysis is focused on the different restrictions and operations employed in each derivation strategy. The selection function, restrictive ancestor resolution, compulsory ancestor resolution on literals having atoms which are or become identical, compulsory merging operations, reuse of truncated literals, spreading of FALSE literals, no-tautologies resection, no two non-B-literals having ide

APA, Harvard, Vancouver, ISO, and other styles

2

Verga, Juliana 1984. "Algoritmos para redes de transporte multimodal aplicado ao tráfego urbano." [s.n.], 2014. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260596.

Full text

Abstract:

Orientadores: Akebo Yamakami, Ricardo Coelho Silva<br>Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação<br>Made available in DSpace on 2018-08-25T08:18:04Z (GMT). No. of bitstreams: 1 Verga_Juliana_D.pdf: 1085866 bytes, checksum: 6325aac2b413dfa3fc773ecc3791388c (MD5) Previous issue date: 2014<br>Resumo: A teoria de grafos é comumente utilizada na área da engenharia para resolver problemas que podem ser representados na forma de redes. Dentre diversos problemas abordados, o problema de transporte multimodal é um dos que podem ser modelados

APA, Harvard, Vancouver, ISO, and other styles

3

Ho, Hsi-Ming. "Topics in monitoring and planning for embedded real-time systems." Thesis, University of Oxford, 2015. http://ora.ox.ac.uk/objects/uuid:f507756d-8bdc-4b1f-8bbf-214c9997f9c5.

Full text

Abstract:

The verification of real-time systems has gained much interest in the formal verification community during the past two decades. In this thesis, we investigate two real-time verification problems that benefit from the techniques normally used in untimed verification. The first part of this thesis is concerned with the monitoring of real-time specifications. We study the expressiveness of metric temporal logics over timed words, a problem that dates back to early 1990s. We show that the logic obtained by extending Metric Temporal Logic (MTL) with two families of new modalities is expressively c

APA, Harvard, Vancouver, ISO, and other styles

4

Жовтя, Є. М. "Використання Flash-технології для активізації навчання з курсу "Теорія алгоритмів та матлогіка"". Thesis, Видавництво СумДУ, 2011. http://essuir.sumdu.edu.ua/handle/123456789/9872.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Bundala, Daniel. "Algorithmic verification problems in automata-theoretic settings." Thesis, University of Oxford, 2014. https://ora.ox.ac.uk/objects/uuid:60b2d507-153f-4119-a888-56ccd47c3752.

Full text

Abstract:

Problems in formal verification are often stated in terms of finite automata and extensions thereof. In this thesis we investigate several such algorithmic problems. In the first part of the thesis we develop a theory of completeness thresholds in Bounded Model Checking. A completeness threshold for a given model M and a specification φ is a bound k such that, if no counterexample to φ of length k or less can be found in M, then M in fact satisfies φ. We settle a problem of Kroening et al. [KOS<sup>+</sup>11] in the affirmative, by showing that the linearity problem for both regula

APA, Harvard, Vancouver, ISO, and other styles

6

Merry, Alexander. "Reasoning with !-graphs." Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:416c2e6d-2932-4220-8506-50e6b403b660.

Full text

Abstract:

The aim of this thesis is to present an extension to the string graphs of Dixon, Duncan and Kissinger that allows the finite representation of certain infinite families of graphs and graph rewrite rules, and to demonstrate that a logic can be built on this to allow the formalisation of inductive proofs in the string diagrams of compact closed and traced symmetric monoidal categories. String diagrams provide an intuitive method for reasoning about monoidal categories. However, this does not negate the ability for those using them to make mistakes in proofs. To this end, there is a project (Quan

APA, Harvard, Vancouver, ISO, and other styles

7

Hague, Matthew. "Saturation methods for global model-checking pushdown systems." Thesis, University of Oxford, 2009. http://ora.ox.ac.uk/objects/uuid:40263ddb-312d-4e18-b774-2caf4def0e76.

Full text

Abstract:

Pushdown systems equip a finite state system with an unbounded stack memory, and are thus infinite state. By recording the call history on the stack, these systems provide a natural model for recursive procedure calls. Model-checking for pushdown systems has been well-studied. Tools implementing pushdown model-checking (e.g. Moped) are an essential back-end component of high-profile software model checkers such as SLAM, Blast and Terminator. Higher-order pushdown systems define a more complex memory structure: a higher-order stack is a stack of lower-order stacks. These systems form a robust h

APA, Harvard, Vancouver, ISO, and other styles

8

Thompson, Benjamin Criveli. "A mathematical theory of synchronous concurrent algorithms." Thesis, University of Leeds, 1987. http://etheses.whiterose.ac.uk/945/.

Full text

Abstract:

A synchronous concurrent algorithm is an algorithm that is described as a network of intercommunicating processes or modules whose concurrent actions are synchronised with respect to a global clock. Synchronous algorithms include systolic algorithms; these are algorithms that are well-suited to implementation in VLSI technologies. This thesis provides a mathematical theory for the design and analysis of synchronous algorithms. The theory includes the formal specification of synchronous algorithms; techniques for proving the correctness and performance or time-complexity of synchronous algorith

APA, Harvard, Vancouver, ISO, and other styles

9

Donafee, Andrea. "Picture theory : algorithms and software." Thesis, University of Bedfordshire, 2003. http://hdl.handle.net/10547/305728.

Full text

Abstract:

This thesis is concerned with developing and implementing algorithms based upon the geometry of pictures. Spherical pictures have been used in many areas of combinatorial group theory, and particularly, they have shown to be a useful method when studying the second homotopy module, 1T2, of a presentation ([3],[4],[7],[12],[41] and [64]). Computational programs that implement picture theoretical and design algorithms could advance the areas in which picture theory can be used, due to the much faster time taken to derive results than that of manual calculations. A variety of algorithms are prese

APA, Harvard, Vancouver, ISO, and other styles

10

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.

Full text

Abstract:

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, and other styles

11

Fors, Mikael. "Elementary Discrete Sets in Martin-Löf Type Theory." Thesis, Uppsala universitet, Algebra och geometri, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-175717.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Kirby, P. J. "The theory of exponential differential equations." Thesis, University of Oxford, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.433471.

Full text

Abstract:

This thesis is a model-theoretic study of exponential differential equations in the context of differential algebra. I define the theory of a set of differential equations and give an axiomatization for the theory of the exponential differential equations of split semiabelian varieties. In particular, this includes the theory of the equations satisfied by the usual complex exponential function and the Weierstrass p-functions. The theory consists of a description of the algebraic structure on the solution sets together with necessary and sufficient conditions for a system of equations to have s

APA, Harvard, Vancouver, ISO, and other styles

13

Collazo, Antonio. "The Mathematical Landscape." Scholarship @ Claremont, 2011. http://scholarship.claremont.edu/cmc_theses/116.

Full text

Abstract:

The intent of this paper is to present the reader will enough information to spark a curiosity in to the subject. By no means is the following a complete formulation of any of the topics covered. I want to give the reader a tour of the mathematical landscape. There are plenty of further details to explore in each section, I have just touched the tip the iceberg. The work is basically in four sections: Numbers, Geometry, Functions, Sets and Logic, which are the basic building blocks of Math. The first sections are a exposition into the mathematical objects and their algebras. The last sec

APA, Harvard, Vancouver, ISO, and other styles

14

Brierley, William. "Undecidability of intuitionistic theories." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Farnsworth, Michael Arlington. "Improvements in the theory of confirmation as improvability by incorporating mathematical simplicity." Laramie, Wyo. : University of Wyoming, 2008. http://proquest.umi.com/pqdweb?did=1798480851&sid=1&Fmt=2&clientId=18949&RQT=309&VName=PQD.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Manickavasagam, SenthilKumar. ""a+b" arithmetic theory and implementation." Ohio : Ohio University, 1996. http://www.ohiolink.edu/etd/view.cgi?ohiou1178051605.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Abraham, Tara Helen. "Microscopic cybernetics, mathematical logic, automata theory, and the formalization of biological phenomena, 1936-1970." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp02/NQ53763.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Sharma, Richa. "Semi-automated approach to support logical formalism for requirements analysis and validation." Thesis, IIT Delhi, 2016. http://localhost:8080/xmlui/handle/12345678/7227.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Esteban, María. "Duality Theory and Abstract Algebraic Logic." Doctoral thesis, Universitat de Barcelona, 2013. http://hdl.handle.net/10803/125336.

Full text

Abstract:

In this thesis we present the results of our research on duality theory for non-classical logics under the point of view of Abstract Algebraic Logic (AAL). Firstly, we propose an abstract Spectral-like duality and an abstract Priestley-style duality for every filter distributive finitary congruential logic with theorems. This proposal aims to unify the various dualities for concrete logics that we find in the literature, by showing the abstract template in which all of them fit. Secondly, the dual correspondence of some logical properties is examined. This serves to reveal the connection betwe

APA, Harvard, Vancouver, ISO, and other styles

21

Kasal, Ozcan. "Model Theory Of Derivation Spaces." Phd thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/2/12611715/index.pdf.

Full text

Abstract:

In this thesis, the notion of the derivation spaces is introduced. In a suitable two-sorted language, the first order theory of these structures is studied. In particular, it is shown that the theory is not companionable. In the last section, the language is expanded by predicate symbols for a dependence relation. In this language it is shown that the extension of the corresponding theory has a model companion. It is shown that the model companion is a complete, unstable theory which does not eliminate quantifiers.

APA, Harvard, Vancouver, ISO, and other styles

22

Lindroth, Olof. "A random formula lower bound for ordered DLL extended with local symmetry recognition /." Uppsala, 2004. http://www.math.uu.se/research/pub/Lindroth1.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Naziazeno, Galvão Eudes. "A class of QFA rings." Universidade Federal de Pernambuco, 2011. https://repositorio.ufpe.br/handle/123456789/1291.

Full text

Abstract:

Made available in DSpace on 2014-06-12T15:48:50Z (GMT). No. of bitstreams: 2 arquivo2717_1.pdf: 481883 bytes, checksum: bb9d70f42c1cda245b5340284b5dc431 (MD5) license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5) Previous issue date: 2011<br>Coordenação de Aperfeiçoamento de Pessoal de Nível Superior<br>Nesta tese, provamos que todo domínio infinito finitamente gerado é bi-interpretável com a estrutura dos números naturais. Usando este argumento, demonstramos que todo anel f.g. R que tem um ideal primo nilpotente I tal que R/I é um domínio é Quase-Finitamente Axiomati

APA, Harvard, Vancouver, ISO, and other styles

24

Steimle, Yan. "Aspects of Recursion Theory in Arithmetical Theories and Categories." Thesis, Université d'Ottawa / University of Ottawa, 2019. http://hdl.handle.net/10393/39877.

Full text

Abstract:

Traditional recursion theory is the study of computable functions on the natural numbers. This thesis considers recursion theory in first-order arithmetical theories and categories, thus expanding the work of Ritchie and Young, Lambek, Scott, and Hofstra. We give a complete characterisation of the representability of computable functions in arithmetical theories, paying attention to the differences between intuitionistic and classical theories and between theories with and without induction. When considering recursion theory from a category-theoretic perspective, we examine syntactic catego

APA, Harvard, Vancouver, ISO, and other styles

25

Ranga, Mithun Kumar. "Fixed order optimal control using genetic algorithms /." free to MU campus, to others for purchase, 2004. http://wwwlib.umi.com/cr/mo/fullcit?p1426097.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Yildirim, Irem. "The Theory Of Generic Difference Fields." Master's thesis, METU, 2003. http://etd.lib.metu.edu.tr/upload/766444/index.pdf.

Full text

Abstract:

A difference field M , is a field with a distinguished endomorphism, is called a generic difference field if it is existentially closed among the models of the theory of difference fields. In the language Ld, by a theorem of Hrushovski, it is characterized by the following: M is an algebraically closed field, s is an automorphism of M, and if W and V are varieties defined over M such that W is a subset of VU s (V ) and the projection maps W to V and W to s(V ) are generically onto, then there is a tuple a in M such that (a, s ( a)) in W. This thesis is a survey on the theory of generic diffe

APA, Harvard, Vancouver, ISO, and other styles

27

Shi, Bin. "A Mathematical Framework on Machine Learning: Theory and Application." FIU Digital Commons, 2018. https://digitalcommons.fiu.edu/etd/3876.

Full text

Abstract:

The dissertation addresses the research topics of machine learning outlined below. We developed the theory about traditional first-order algorithms from convex opti- mization and provide new insights in nonconvex objective functions from machine learning. Based on the theory analysis, we designed and developed new algorithms to overcome the difficulty of nonconvex objective and to accelerate the speed to obtain the desired result. In this thesis, we answer the two questions: (1) How to design a step size for gradient descent with random initialization? (2) Can we accelerate the current convex

APA, Harvard, Vancouver, ISO, and other styles

28

Florio, Salvatore. "Completeness of the Predicate Calculus in the Basic Theory of Predication." The Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1281927327.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Anscombe, William George. "Definability in Henselian fields." Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:65eec6d9-457d-4673-80de-6413865a6a46.

Full text

Abstract:

We investigate definability in henselian fields. Specifically, we are interested in those sets and substructures that are existentially definable or definable with `few' parameters. Our general approach is to use various versions of henselianity to understand the `local structure' of these definable sets. The fields in which we are most interested are those of positive characteristic, for example the local fields F<sub>q</sub>((t)), but many of our methods and results also apply to p-adic and real closed fields. In positive characteristic we have to deal with inseparable field extensions and w

APA, Harvard, Vancouver, ISO, and other styles

30

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.

Full text

Abstract:

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, and other styles

31

Mok, Tsz-kin, and 莫子建. "Modeling, analysis and control design for the UPFC with fuzzy theory and genetic algorithm application." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2000. http://hub.hku.hk/bib/B31224969.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Kingham, Mark. "An adaptive hierarchical fuzzy logic system for modelling and prediction of financial systems." Thesis, Edith Cowan University, Research Online, Perth, Western Australia, 1999. https://ro.ecu.edu.au/theses/1228.

Full text

Abstract:

In this thesis, an intelligent fuzzy logic system using genetic algorithms for the prediction and modelling of interest rates is developed. The proposed system uses a Hierarchical Fuzzy Logic system in which a genetic algorithm is used as a training method for learning the fuzzy rules knowledge bases. A fuzzy logic system is developed to model and predict three month quarterly interest rate fluctuations. The system is further trained to model and predict interest rates for six month and one year periods. The proposed system is developed with first two, three, then four and finally five hierarc

APA, Harvard, Vancouver, ISO, and other styles

33

Solanki, Vinesh. "Zariski structures in noncommutative algebraic geometry and representation theory." Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:3fa23b75-9b85-4dc2-9ad6-bdb20d61fe45.

Full text

Abstract:

A suitable subcategory of aﬃne Azumaya algebras is deﬁned and a functor from this category to the category of Zariski structures is constructed. The rudiments of a theory of presheaves of topological structures is developed and applied to construct examples of structures at a generic parameter. The category of equivariant algebras is deﬁned and a ﬁrst-order theory is associated to each object. For those theories satisfying a certain technical condition, uncountable categoricity and quantiﬁer elimination results are established. Models are shown to be Zariski structures and a functor from the c

APA, Harvard, Vancouver, ISO, and other styles

34

Lu, Weiyun. "Topics in Many-valued and Quantum Algebraic Logic." Thesis, Université d'Ottawa / University of Ottawa, 2016. http://hdl.handle.net/10393/35173.

Full text

Abstract:

Introduced by C.C. Chang in the 1950s, MV algebras are to many-valued (Łukasiewicz) logics what boolean algebras are to two-valued logic. More recently, effect algebras were introduced by physicists to describe quantum logic. In this thesis, we begin by investigating how these two structures, introduced decades apart for wildly different reasons, are intimately related in a mathematically precise way. We survey some connections between MV/effect algebras and more traditional algebraic structures. Then, we look at the categorical structure of effect algebras in depth, and in particular see how

APA, Harvard, Vancouver, ISO, and other styles

35

Goel, Gagan. "Algorithms for budgeted auctions and multi-agent covering problems." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29679.

Full text

Abstract:

Thesis (Ph.D)--Computing, Georgia Institute of Technology, 2010.<br>Committee Chair: Vazirani, Vijay; Committee Member: Kalai, Adam; Committee Member: Mihail, Milena; Committee Member: Tetali, Prasad; Committee Member: Thomas, Robin. Part of the SMARTech Electronic Thesis and Dissertation Collection.

APA, Harvard, Vancouver, ISO, and other styles

36

Sedaaghi, Mohammad Hossein. "Morphological filtering in signal/image processing." Thesis, University of Liverpool, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.367104.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Dahlgren, Fredrik. "Effective Distribution Theory." Doctoral thesis, Uppsala : Department of Mathematics, Uppsala University, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-8210.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Kavvos, Georgios Alexandros. "On the semantics of intensionality and intensional recursion." Thesis, University of Oxford, 2017. https://ora.ox.ac.uk/objects/uuid:f89b46d8-b514-42fd-9321-e2803452681f.

Full text

Abstract:

Intensionality is a phenomenon that occurs in logic and computation. In the most general sense, a function is intensional if it operates at a level finer than (extensional) equality. This is a familiar setting for computer scientists, who often study different programs or processes that are interchangeable, i.e. extensionally equal, even though they are not implemented in the same way, so intensionally distinct. Concomitant with intensionality is the phenomenon of intensional recursion, which refers to the ability of a program to have access to its own code. In computability theory, intensiona

APA, Harvard, Vancouver, ISO, and other styles

39

Harris, Elena Yavorska. "A parallel algorithm to solve the mathematical problem "double coset enumeration of S₂₄ over M₂₄"." CSUSB ScholarWorks, 2003. https://scholarworks.lib.csusb.edu/etd-project/2432.

Full text

Abstract:

This thesis presents and evaluates a new parallel algorithm that computes all single cosets in the double coset M₂₄ P M₂₄, where P is a permutation on n points of a certain cycle structure, and M₂₄ is the Mathieu group related to a Steiner system S(5, 8, 24) as its automorphism group. The purpose of this work is not to replace the existing algorithms, but rather to explore a possibility to extend calculations of single cosets beyond the limits encountered when using currently available methods.

APA, Harvard, Vancouver, ISO, and other styles

40

Sun, Wei. "Efficient inference for hybrid Bayesian networks." Fairfax, VA : George Mason University, 2007. http://hdl.handle.net/1920/2952.

Full text

Abstract:

Thesis (Ph. D.)--George Mason University, 2007.<br>Title from PDF t.p. (viewed Jan. 22, 2008). Thesis director: KC Chang. Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Information Technology. Vita: p. 117. Includes bibliographical references (p. 108-116). Also available in print.

APA, Harvard, Vancouver, ISO, and other styles

41

Lou, Jian. "Study on efficient sparse and low-rank optimization and its applications." HKBU Institutional Repository, 2018. https://repository.hkbu.edu.hk/etd_oa/543.

Full text

Abstract:

Sparse and low-rank models have been becoming fundamental machine learning tools and have wide applications in areas including computer vision, data mining, bioinformatics and so on. It is of vital importance, yet of great difficulty, to develop efficient optimization algorithms for solving these models, especially under practical design considerations of computational, communicational and privacy restrictions for ever-growing larger scale problems. This thesis proposes a set of new algorithms to improve the efficiency of the sparse and low-rank models optimization. First, facing a large numbe

APA, Harvard, Vancouver, ISO, and other styles

42

Konecny, Jan. "Isotone fuzzy Galois connections and their applications in formal concept analysis." Diss., Online access via UMI:, 2009.

Find full text

Abstract:

Thesis (Ph. D.)--State University of New York at Binghamton, Thomas J. Watson School of Engineering and Applied Science, Department of Systems Science and Industrial Engineering, 2009.<br>Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

43

Mehta, Aranyak. "Algorithmic Game Theory." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7220.

Full text

Abstract:

The interaction of theoretical computer science with game theory and economics has resulted in the emergence of two very interesting research directions. First, it has provided a new model for algorithm design, which is to optimize in the presence of strategic behavior. Second, it has prompted us to consider the computational aspects of various solution concepts from game theory, economics and auction design which have traditionally been considered mainly in a non-constructive manner. In this thesis we present progress along both these directions. We first consider optimization problems that a

APA, Harvard, Vancouver, ISO, and other styles

44

Braun, H. T. F. "Model theory of holomorphic functions." Thesis, University of Oxford, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.401108.

Full text

Abstract:

This thesis is concerned with a conjecture of Zilber: that the complex field expanded with the exponential function should be `quasi-minimal'; that is, all its definable subsets should be countable or have countable complement. Our purpose is to study the geometry of this structure and other expansions by holomorphic functions of the complex field without having first to settle any number-theoretic problems, by treating all countable sets on an equal footing. We present axioms, modelled on those for a Zariski geometry, defining a non-first-order class of ``quasi-Zariski'' structures endowed wi

APA, Harvard, Vancouver, ISO, and other styles

45

D'Silva, Vijay Victor. "Logical abstract interpretation." Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:3648e579-01dc-4054-8290-31626d53b003.

Full text

Abstract:

Logical deduction and abstraction from detail are fundamental, yet distinct aspects of reasoning about programs. This dissertation shows that the combination of logic and abstract interpretation enables a unified and simple treatment of several theoretical and practical topics which encompass the model theory of temporal logics, the analysis of satisfiability solvers, and the construction of Craig interpolants. In each case, the combination of logic and abstract interpretation leads to more general results, simpler proofs, and a unification of ideas from seemingly disparate fields. The first c

APA, Harvard, Vancouver, ISO, and other styles

46

Eliasson, Jonas. "Ultrasheaves." Doctoral thesis, Uppsala : Matematiska institutionen, Univ. [distributör], 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-3762.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Hermo, Reyes Eduardo. "The Logic of Turing Progressions." Doctoral thesis, Universitat de Barcelona, 2019. http://hdl.handle.net/10803/668144.

Full text

Abstract:

This dissertation is devoted to developing modal logical tools that can be used in the field of proof theory and ordinal analysis. More precisely, we focus on the relation between strictly positive modal logics and both Turing progressions and ordinal notation systems. With respect to the former one, we introduce the system TSC that is tailored to generate exactly all relations that hold between different Turing progressions given a particular set of natural consistency notions. We also present an arithmetical interpretation for this modal system, named the Formalized Turing progressions in

APA, Harvard, Vancouver, ISO, and other styles

48

Axelsson, Henrik. "Optimal Control of Switched Autonomous Systems: Theory, Algorithms, and Robotic Applications." Diss., Available online, Georgia Institute of Technology, 2006, 2006. http://etd.gatech.edu/theses/available/etd-04052006-131248/.

Full text

Abstract:

Thesis (Ph. D.)--Electrical and Computer Engineering, Georgia Institute of Technology, 2006.<br>Ashraf Saad, Committee Member ; Spyros Reveliotis, Committee Member ; Anthony Yezzi, Committee Member ; Erik Verriest, Committee Member ; Yorai Wardi, Committee Co-Chair ; Magnus Egerstedt, Committee Chair.

APA, Harvard, Vancouver, ISO, and other styles

49

Raimi, Richard Saul. "Environment modeling and efficient state reachability checking /." Digital version accessible at:, 1999. http://wwwlib.umi.com/cr/utexas/main.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Hunt, Julian David. "Integration of rationale management with multi-criteria decision analysis, probabilistic forecasting and semantics : application to the UK energy sector." Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:2cc24d23-3e93-42e0-bb7a-6e39a65d7425.

Full text

Abstract:

This thesis presents a new integrated tool and decision support framework to approach complex problems resulting from the interaction of many multi-criteria issues. The framework is embedded in an integrated tool called OUTDO (Oxford University Tool for Decision Organisation). OUTDO integrates Multi-Criteria Decision Analysis (MCDA), decision rationale management with a modified Issue-Based Information Systems (IBIS) representation, and probabilistic forecasting to effectively capture the essential reasons why decisions are made and to dynamically re-use the rationale. In doing so, it allows e

APA, Harvard, Vancouver, ISO, and other styles

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!