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

Dissertations / Theses on the topic 'Programming theory'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

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 'Programming theory.'

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

Hancock, P. G. "Proof theory and programming." Thesis, University of Edinburgh, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.652060.

Full text
Abstract:
The work reported in this thesis arises from the old idea, going back to the origins of constructive logic, that a proof is fundamentally a kind of program. If proofs can be considered as programs, then one might expect that proof theory should have much to contribute to the theory of programming. This has indeed turned out to be the case. Various technologies developed in proof theory are now widely used in computer science for formulating and investigating programming languages and logics connected with them. Yet there is a vigorous and venerable part of proof theory which has so far had little impact in computer science, namely ordinal-theoretic proof theory. This focuses on proofs of well-foundedness, usually expressed in the form of a schema of transfinite induction with respect to a representation of an initial segment of the countable ordinals. Proof theory of this kind is concerned with what it is that limits the capacity of a proof system to 'see into the transfinite'. If proofs can be considered as programs, what kind of program is a proof of well-foundedness? My hypothesis is that the limitations of a formal system for writing proofs of well-foundedness reflect its limitations as a system in which to program strategies for defeating ones opponent in a certain kind of game. In recent computer science, games have proved invaluable as models for describing patterns of interaction between a system and its environment. I cannot claim to have substantiated this hypothesis, but only to have taken a few steps in that direction. The work reported in the thesis lies in three areas. First, I present a framework for dependently typed programming in the style advocated by Martin-Löf. The novelties here are connected with bringing the type-theoretic approach to programming that comes from the Curry-Howard correspondence closer to the calculational approach in the categorical tradition that comes from Lambek and Lawvere. A particular challenge is to find a smooth and practical way of encoding inductive definitions. Second, I have investigated a number of ways of modeling interactive systems and transition systems in a constructive context. The focus here is on models with a direct computational interpretation, that can actually be used in programming. The approach is inspired by a construction due to Petersson and Synek. It is shown how one may represent game-theoretic strategies of various kinds using these models. Finally, I give a construction of provable ordinals within a Martin-Löf style type theory that has a type of natural numbers, and an external sequence of universes closed under general Cartesian products. The locus of the ideas for this construction lie more in conventional proof theory, and were the basis for a conjecture made by me almost thirty years ago in the work that I then abandoned. What is new here is the concept of a ‘lens’. This is a predicate transformer that has been implicit in the construction of proofs of well-foundedness since Gentzen. I hope this may be of some use in an algebraic, systematic approach to setting lower bounds on the proof-theoretic strength of more extensive type theories.
APA, Harvard, Vancouver, ISO, and other styles
2

Spjøtvold, Jørgen. "Parametric Programming in Control Theory." Doctoral thesis, Norwegian University of Science and Technology, Faculty of Information Technology, Mathematics and Electrical Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-2198.

Full text
Abstract:

The main contributions in this thesis are advances in parametric programming. The thesis is divided into three parts; theoretical advances, application areas and constrained control allocation. The first part deals with continuity properties and the structure of solutions to convex parametric quadratic and linear programs. The second part focuses on applications of parametric quadratic and linear programming in control theory. The third part deals with constrained control allocation and how parametric programming can be used to obtain explicit solutions to this problem.

APA, Harvard, Vancouver, ISO, and other styles
3

Huang, Zhengwen. "Schema theory for gene expression programming." Thesis, Brunel University, 2014. http://bura.brunel.ac.uk/handle/2438/8539.

Full text
Abstract:
This thesis studied a new variant of Evolutionary Algorithms called Gene Expression Programming. The evolution process of Gene Expression Programming was investigated from the practice to the theory. As a practice level, the original version of Gene Expression Programming was applied to a classification problem and an enhanced version of the algorithm was consequently developed. This allowed the development of a general understanding of each component of the genotype and phenotype separated representation system of the solution employed by the algorithm. Based on such an understanding, a version of the schema theory was developed for Gene Expression Programming. The genetic modifications provided by each genetic operator employed by this algorithm were analysed and a set of theorems predicting the propagation of the schema from one generation to another was developed. Also a set of experiments were performed to test the validity of the developed schema theory obtaining good agreement between the experimental results and the theoretical predictions.
APA, Harvard, Vancouver, ISO, and other styles
4

Taha, Walid. "Multi-Stage Programming : Its Theory and Applications." Doctoral thesis, Oregon Graduate Institute of Science and Technology, 1999. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-15052.

Full text
Abstract:
MetaML is a statically typed functional programming language with special support for programgeneration. In addition to providing the standard features of contemporary programminglanguages such as Standard ML, MetaML provides three staging annotations. These staging annotationsallow the construction, combination, and execution of object-programs.Our thesis is that MetaML's three staging annotations provide a useful, theoretically soundbasis for building program generators. This dissertation reports on our study of MetaML's stagingconstructs, their use, their implementation, and their formal semantics. Our results include anextended example of where MetaML allows us to produce ecient programs, an explanation ofwhy implementing these constructs in traditional ways can be challenging, two formulations ofMetaML's semantics, a type system for MetaML, and a proposal for extending MetaML with atype construct for closedness.The dissertation consolidates a number of previous publications by the author, includingMetaML's type systems and big-step semantics. The presentation is new. The proposed solutionto an implementation problem and the reduction semantics for MetaML's three staging constructsare also new.
APA, Harvard, Vancouver, ISO, and other styles
5

Qiwen, Xu. "A theory of state-based parallel programming." Thesis, University of Oxford, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.306838.

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

Luo, Xiaodong. "Continuous linear programming : theory, algorithms and applications." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/10591.

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

Gammon, Shauna C. A. "Notions of category theory in functional programming." Thesis, University of British Columbia, 2007. http://hdl.handle.net/2429/31756.

Full text
Abstract:
We present a detailed examination of applications of category theory to functional programming languages, with a primary focus on monads in Haskell. First, we explore E. Moggi's work in categorical semantics, which provides the theoretical foundation for employing monads in functional languages. In particular, we examine his use of Kleisli triples to model notions of computation. We then study P. Wadler's implementation of Moggi's ideas as a means to mimic side-effects in the purely functional language Haskell. We explicitly demonstrate the connections between Kleisli triples, categorytheoretic monads, and Haskell monads. It is our principal aim to provide a coherent translation between the abstracted concept of monads that exists in category theory, and the formulation of monads as type-constructors that is implemented in Haskell.
Science, Faculty of
Mathematics, Department of
Graduate
APA, Harvard, Vancouver, ISO, and other styles
8

Andrews, James H. "Logic programming : operational semantics and proof theory." Thesis, University of Edinburgh, 1991. http://hdl.handle.net/1842/13484.

Full text
Abstract:
Logic programming systems which use parallel strategies for computing 'and' and 'or' are theoretically elegant, but systems which use sequential strategies are far more widely used and do not fit well into the traditional theory of logic programming. This thesis presents operational and proof-theoreticcharacterisations for systems having each of the possible combinations of parallel or sequential 'and' and parallel or sequential 'or'. The operational semantics are in the form of an abstract machine. The four control strategies emerge as simple variants of this machine with varying degrees of determinism; some of these variants have equivalent, compositional operational semantics, which are given. The proof-theoretic characterisations consist of a single central sequent calculus, LKE (similar to Gentzen's sequent calculus for classical first order logic), and sets of axioms which capture the success or failure of queries in the four control strategies in a highly compositional, logical way. These proof-theoretic characterisations can be seen as logical semantics of the logic programming languages. The proof systems can also be used in practice to prove more general properties of logic programs, although it is shown that they are unavoidably incomplete for this purpose. One aspect of this incompleteness is that it is not possible to derive all valid sequents having free variables; however, induction rules are given which can help to prove many useful sequents of this kind.
APA, Harvard, Vancouver, ISO, and other styles
9

Hagino, Tatsuya. "A categorical programming language." Thesis, University of Edinburgh, 1987. http://hdl.handle.net/1842/13976.

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

Kirby, Graham N. C. "Reflection and hyper-programming in persistent programming systems." Thesis, University of St Andrews, 1992. http://hdl.handle.net/10023/1673.

Full text
Abstract:
In an orthogonally persistent programming system, data is treated in a manner independent of its persistence. This gives simpler semantics, allows the programmer to ignore details of long-term data storage and enables type checking protection mechanisms to operate over the entire lifetime of the data. The ultimate goal of persistent programming language research is to reduce the costs of producing software. The work presented in this thesis seeks to improve programmer productivity in the following ways: • by reducing the amount of code that has to be written to construct an application; • by increasing the reliability of the code written; and • by improving the programmer’s understanding of the persistent environment in which applications are constructed. Two programming techniques that may be used to pursue these goals in a persistent environment are type-safe linguistic reflection and hyper-programming. The first provides a mechanism by which the programmer can write generators that, when executed, produce new program representations. This allows the specification of programs that are highly generic yet depend in non-trivial ways on the types of the data on which they operate. Genericity promotes software reuse which in turn reduces the amount of new code that has to be written. Hyper-programming allows a source program to contain links to data items in the persistent store. This improves program reliability by allowing certain program checking to be performed earlier than is otherwise possible. It also reduces the amount of code written by permitting direct links to data in the place of textual descriptions. Both techniques contribute to the understanding of the persistent environment through supporting the implementation of store browsing tools and allowing source representations to be associated with all executable programs in the persistent store. This thesis describes in detail the structure of type-safe linguistic reflection and hyper-programming, their benefits in the persistent context, and a suite of programming tools that support reflective programming and hyper-programming. These tools may be used in conjunction to allow reflection over hyper-program representations. The implementation of the tools is described.
APA, Harvard, Vancouver, ISO, and other styles
11

Gebser, Martin. "Proof theory and algorithms for answer set programming." Phd thesis, Universität Potsdam, 2011. http://opus.kobv.de/ubp/volltexte/2011/5542/.

Full text
Abstract:
Answer Set Programming (ASP) is an emerging paradigm for declarative programming, in which a computational problem is specified by a logic program such that particular models, called answer sets, match solutions. ASP faces a growing range of applications, demanding for high-performance tools able to solve complex problems. ASP integrates ideas from a variety of neighboring fields. In particular, automated techniques to search for answer sets are inspired by Boolean Satisfiability (SAT) solving approaches. While the latter have firm proof-theoretic foundations, ASP lacks formal frameworks for characterizing and comparing solving methods. Furthermore, sophisticated search patterns of modern SAT solvers, successfully applied in areas like, e.g., model checking and verification, are not yet established in ASP solving. We address these deficiencies by, for one, providing proof-theoretic frameworks that allow for characterizing, comparing, and analyzing approaches to answer set computation. For another, we devise modern ASP solving algorithms that integrate and extend state-of-the-art techniques for Boolean constraint solving. We thus contribute to the understanding of existing ASP solving approaches and their interconnections as well as to their enhancement by incorporating sophisticated search patterns. The central idea of our approach is to identify atomic as well as composite constituents of a propositional logic program with Boolean variables. This enables us to describe fundamental inference steps, and to selectively combine them in proof-theoretic characterizations of various ASP solving methods. In particular, we show that different concepts of case analyses applied by existing ASP solvers implicate mutual exponential separations regarding their best-case complexities. We also develop a generic proof-theoretic framework amenable to language extensions, and we point out that exponential separations can likewise be obtained due to case analyses on them. We further exploit fundamental inference steps to derive Boolean constraints characterizing answer sets. They enable the conception of ASP solving algorithms including search patterns of modern SAT solvers, while also allowing for direct technology transfers between the areas of ASP and SAT solving. Beyond the search for one answer set of a logic program, we address the enumeration of answer sets and their projections to a subvocabulary, respectively. The algorithms we develop enable repetition-free enumeration in polynomial space without being intrusive, i.e., they do not necessitate any modifications of computations before an answer set is found. Our approach to ASP solving is implemented in clasp, a state-of-the-art Boolean constraint solver that has successfully participated in recent solver competitions. Although we do here not address the implementation techniques of clasp or all of its features, we present the principles of its success in the context of ASP solving.
Antwortmengenprogrammierung (engl. Answer Set Programming; ASP) ist ein Paradigma zum deklarativen Problemlösen, wobei Problemstellungen durch logische Programme beschrieben werden, sodass bestimmte Modelle, Antwortmengen genannt, zu Lösungen korrespondieren. Die zunehmenden praktischen Anwendungen von ASP verlangen nach performanten Werkzeugen zum Lösen komplexer Problemstellungen. ASP integriert diverse Konzepte aus verwandten Bereichen. Insbesondere sind automatisierte Techniken für die Suche nach Antwortmengen durch Verfahren zum Lösen des aussagenlogischen Erfüllbarkeitsproblems (engl. Boolean Satisfiability; SAT) inspiriert. Letztere beruhen auf soliden beweistheoretischen Grundlagen, wohingegen es für ASP kaum formale Systeme gibt, um Lösungsmethoden einheitlich zu beschreiben und miteinander zu vergleichen. Weiterhin basiert der Erfolg moderner Verfahren zum Lösen von SAT entscheidend auf fortgeschrittenen Suchtechniken, die in gängigen Methoden zur Antwortmengenberechnung nicht etabliert sind. Diese Arbeit entwickelt beweistheoretische Grundlagen und fortgeschrittene Suchtechniken im Kontext der Antwortmengenberechnung. Unsere formalen Beweissysteme ermöglichen die Charakterisierung, den Vergleich und die Analyse vorhandener Lösungsmethoden für ASP. Außerdem entwerfen wir moderne Verfahren zum Lösen von ASP, die fortgeschrittene Suchtechniken aus dem SAT-Bereich integrieren und erweitern. Damit trägt diese Arbeit sowohl zum tieferen Verständnis von Lösungsmethoden für ASP und ihrer Beziehungen untereinander als auch zu ihrer Verbesserung durch die Erschließung fortgeschrittener Suchtechniken bei. Die zentrale Idee unseres Ansatzes besteht darin, Atome und komposite Konstrukte innerhalb von logischen Programmen gleichermaßen mit aussagenlogischen Variablen zu assoziieren. Dies ermöglicht die Isolierung fundamentaler Inferenzschritte, die wir in formalen Charakterisierungen von Lösungsmethoden für ASP selektiv miteinander kombinieren können. Darauf aufbauend zeigen wir, dass unterschiedliche Einschränkungen von Fallunterscheidungen zwangsläufig zu exponentiellen Effizienzunterschieden zwischen den charakterisierten Methoden führen. Wir generalisieren unseren beweistheoretischen Ansatz auf logische Programme mit erweiterten Sprachkonstrukten und weisen analytisch nach, dass das Treffen bzw. Unterlassen von Fallunterscheidungen auf solchen Konstrukten ebenfalls exponentielle Effizienzunterschiede bedingen kann. Die zuvor beschriebenen fundamentalen Inferenzschritte nutzen wir zur Extraktion inhärenter Bedingungen, denen Antwortmengen genügen müssen. Damit schaffen wir eine Grundlage für den Entwurf moderner Lösungsmethoden für ASP, die fortgeschrittene, ursprünglich für SAT konzipierte, Suchtechniken mit einschließen und darüber hinaus einen transparenten Technologietransfer zwischen Verfahren zum Lösen von ASP und SAT erlauben. Neben der Suche nach einer Antwortmenge behandeln wir ihre Aufzählung, sowohl für gesamte Antwortmengen als auch für Projektionen auf ein Subvokabular. Hierfür entwickeln wir neuartige Methoden, die wiederholungsfreies Aufzählen in polynomiellem Platz ermöglichen, ohne die Suche zu beeinflussen und ggf. zu behindern, bevor Antwortmengen berechnet wurden.
APA, Harvard, Vancouver, ISO, and other styles
12

Charter, Kevin Robert. "A constructive type theory for simple imperative programming." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ40035.pdf.

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

Faisca, Nuno Patricio. "Multi-parametric programming : novel theory and algorithmic developments." Thesis, Imperial College London, 2008. http://hdl.handle.net/10044/1/8869.

Full text
Abstract:
Multi-parametric programming is a mathematical theory to address optimisation problems involving varying parameters. Based on sensitivity and singularity theories, multi-parametric programming derives the optimum solution of the optimisation variables as analytical continuous functions of the varying parameters. In this thesis, novel theory .and algorithmic developments are presented for the solution of various classes of multi-parametric programs with relevance to real-life applications. In Part 1, Advances in global optimisation, particular focus is given to the following classes of global optimisation problems in the context of mUlti-parametric programming: (i) bilevel programming, (ii) multi-level hierarchical and decentralised programming and (iii) multi-parametric mixed integer linear programming. In Part 2, Advances in robust optimisation & control, the foundations towards a comprehensive general theory for robust optimal control are described in detail. These involve two steps, the effective solution of (iv) constrained dynamic programming, and the (v) robust reformulation of the original model-based predictive control problem.
APA, Harvard, Vancouver, ISO, and other styles
14

Wolfram, David Anthony. "The Clausal Theory of Types." Thesis, University of Cambridge, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.358763.

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

Colletti, Bruce William. "Group theory and metaheuristics /." Digital version accessible at:, 1999. http://wwwlib.umi.com/cr/utexas/main.

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

Tyber, Steven Jay. "Cutting planes in mixed integer programming: theory and algorithms." Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/47560.

Full text
Abstract:
Recent developments in mixed integer programming have highlighted the need for multi-row cuts. To this day, the performance of such cuts has typically fallen short of the single-row Gomory mixed integer cut. This disparity between the theoretical need and the practical shortcomings of multi-row cuts motivates the study of both the mixed integer cut and multi-row cuts. In this thesis, we build on the theoretical foundations of the mixed integer cut and develop techniques to derive multi-row cuts. The first chapter introduces the mixed integer programming problem. In this chapter, we review the terminology and cover some basic results that find application throughout this thesis. Furthermore, we describe the practical solution of mixed integer programs, and in particular, we discuss the role of cutting planes and our contributions to this theory. In Chapter 2, we investigate the Gomory mixed integer cut from the perspective of group polyhedra. In this setting, the mixed integer cut appears as a facet of the master cyclic group polyhedron. Our chief contribution is a characterization of the adjacent facets and the extreme points of the mixed integer cut. This provides insight into the families of cuts that may work well in conjunction with the mixed integer cut. We further provide extensions of these results under mappings between group polyhedra. For the remainder of this thesis we explore a framework for deriving multi-row cuts. For this purpose, we favor the method of superadditive lifting. This technique is largely driven by our ability to construct superadditive under-approximations of a special value function known as the lifting function. We devote our effort to precisely this task. Chapter 3 reviews the theory behind superadditive lifting and returns to the classical problem of lifted flow cover inequalities. For this specific example, the lifting function we wish to approximate is quite complicated. We overcome this difficulty by adopting an indirect method for proving the validity of a superadditive approximation. Finally, we adapt the idea to high-dimensional lifting problems, where evaluating the exact lifting function often poses an immense challenge. Thus we open entirely unexplored problems to the powerful technique of lifting. Next, in Chapter 4, we consider the computational aspects of constructing strong superadditive approximations. Our primary contribution is a finite algorithm that constructs non-dominated superadditive approximations. This can be used to build superadditive approximations on-the-fly to strengthen cuts derived during computation. Alternately, it can be used offline to guide the search for strong superadditive approximations through numerical examples. We follow up in Chapter 5 by applying the ideas of Chapters 3 and 4 to high-dimensional lifting problems. By working out explicit examples, we are able to identify non-dominated superadditive approximations for high-dimensional lifting functions. These approximations strengthen existing families of cuts obtained from single-row relaxations. Lastly, we show via the stable set problem how the derivation of the lifting function and its superadditive approximation can be entirely embedded in the computation of cuts. Finally, we conclude by identifying future avenues of research that arise as natural extensions of the work in this thesis.
APA, Harvard, Vancouver, ISO, and other styles
17

Cymer, Radosław [Verfasser]. "Applications of matching theory in constraint programming / Radosław Cymer." Hannover : Technische Informationsbibliothek und Universitätsbibliothek Hannover (TIB), 2014. http://d-nb.info/1050990498/34.

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

Hiller, Randall S., Carol Anne Holmes, T. M. Magee, and Jeremy F. 1939 Shapiro. "Constructive Duality for Mixed Integer Programming: Part I, Theory." Massachusetts Institute of Technology, Operations Research Center, 1986. http://hdl.handle.net/1721.1/5366.

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

Wang, Chen. "Modeling multi-attribute utility theory with object-oriented programming." Master's thesis, This resource online, 1994. http://scholar.lib.vt.edu/theses/available/etd-01122010-020130/.

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

Halim, Azza Abdel Rahman Taha Abdel. "A foundational theory of contexts in functional programming Language." 京都大学 (Kyoto University), 2001. http://hdl.handle.net/2433/150224.

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

Schweimeier, Ralf. "Categorical and graphical models of programming languages." Thesis, University of Sussex, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.366059.

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

Sung, Joo-Ho. "Dynamic programming approaches to pension funding." Thesis, City University London, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.361860.

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

Rich, Nelson G. "An introduction to the theory of schemata /." Online version of thesis, 1987. http://hdl.handle.net/1850/10292.

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

Elhedhli, Samir. "Interior-point decomposition methods for integer programming : theory and application." Thesis, McGill University, 2001. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=37887.

Full text
Abstract:
Mixed integer programming (MIP) provides an important modeling and decision support tool for a wide variety of real-life problems. Unfortunately, practical MIPs are large-scale in size and pose serious difficulties to the available solution methodology and software.
This thesis presents a novel solution approach for large-scale mixed integer programming that integrates three bodies of research: interior point methods, decomposition techniques and branch-and-bound approaches. The combination of decomposition concepts and branch-and-bound is commonly known as branch-and-price, while the integration of decomposition concepts and interior point methods lead to the analytic centre cutting plane method (ACCPM). Unfortunately, the use of interior point methods within branch-and-bound methods could not compete with simplex based branch-and-bound due to the inability of "warm" starting.
The motivation for this study stems from the success of branch-and-price and ACCPM in solving integer and non-differentiable optimization problems respectively and the quest for a method that efficiently integrates interior-point methods and branch-and-bound.
The proposed approach is called an Interior Point Branch-and-Price method (IP-B&P) and works as follows. First, a problem's structure is exploited using Lagrangean relaxation. Second, the resulting master problem is solved using ACCPM. Finally, the overall approach is incorporated within a branch-and-bound scheme. The resulting method is more than the combination of three different techniques. It addresses and fixes complications that arise as a result of this integration. This includes the restarting of the interior-point methods, the branching rule and the exploitation of past information as a warm start.
In the first part of the thesis, we give the details of the interior-point branch-and-price method. We start by providing, discussing and implementing new ideas within ACCPM, then detail the IP-B&P method and its different components. To show the practical applicability of IP-B&P, we use the method as a basis for a new solution methodology for the production-distribution system design (PDSD) problem in supply chain management. In this second part of the thesis, we describe a two-level Lagrangean relaxation heuristic for the PDSD. The numerical results show the superiority of the method in providing the optimal solution for most of the problems attempted.
APA, Harvard, Vancouver, ISO, and other styles
25

Prémont, Patrick. "The situation calculus and Hehner's programming theory, harmonization through reification." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/mq29241.pdf.

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

Dryllerakis, Kostantinos. "Domain logic programming : theory and applications to scientific knowledge representation." Thesis, Imperial College London, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.299452.

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

Chisholm, Paul. "Investigations into Martin-Löf type theory as a programming logic." Thesis, Heriot-Watt University, 1988. http://hdl.handle.net/10399/977.

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

Seaman, Iris Rubi. "Probabilistic Programming for Theory of Mind for Autonomous Decision Making." BYU ScholarsArchive, 2018. https://scholarsarchive.byu.edu/etd/6826.

Full text
Abstract:
As autonomous agents (such as unmanned aerial vehicles, or UAVs) become more ubiquitous, they are being used for increasingly complex tasks. Eventually, they will have to reason about the mental state of other agents, including those agents' beliefs, desires and goals – so-called Theory of Mind – and make decisions based on that reasoning. We describe increasingly complex theory of mind models of a UAV pursuing an intruder, and show that (1) there is a natural Bayesian formulation to reasoning about the uncertainty inherent in our estimate of another agent's mental state, and that (2) probabilistic programming is a natural way to describe models that involve one agent reasoning about another agent, where the target agent uses complex primitives such as path planners and saliency maps to make decisions. We propose a nested self-normalized importance sampling inference algorithm for probabilistic programs, and show that it can be used with planning-as-inference to simultaneously reason about other agents' plans and craft counter plans. We demonstrate that more complex models lead to improved performance, and that nested modeling manifests a wide variety of rational agent behavior.
APA, Harvard, Vancouver, ISO, and other styles
29

de, Queiroz Ruy Jose Guerra Barretto. "Proof theory and computer programming : the logical foundations of computing." Thesis, Imperial College London, 1990. http://hdl.handle.net/10044/1/46514.

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

Mambrini, Andrea. "Theory grounded design of genetic programming and parallel evolutionary algorithms." Thesis, University of Birmingham, 2015. http://etheses.bham.ac.uk//id/eprint/5928/.

Full text
Abstract:
Evolutionary algorithms (EAs) have been successfully applied to many problems and applications. Their success comes from being general purpose, which means that the same EA can be used to solve different problems. Despite that, many factors can affect the behaviour and the performance of an EA and it has been proven that there isn't a particular EA which can solve efficiently any problem. This opens to the issue of understanding how different design choices can affect the performance of an EA and how to efficiently design and tune one. This thesis has two main objectives. On the one hand we will advance the theoretical understanding of evolutionary algorithms, particularly focusing on Genetic Programming and Parallel Evolutionary algorithms. We will do that trying to understand how different design choices affect the performance of the algorithms and providing rigorously proven bounds of the running time for different designs. This novel knowledge, built upon previous work on the theoretical foundation of EAs, will then help for the second objective of the thesis, which is to provide theory grounded design for Parallel Evolutionary Algorithms and Genetic Programming. This will consist in being inspired by the analysis of the algorithms to produce provably good algorithm designs.
APA, Harvard, Vancouver, ISO, and other styles
31

Moyle, Stephen Anthony. "An investigation into theory completion techniques in inductive logic programming." Thesis, University of Oxford, 2003. http://ora.ox.ac.uk/objects/uuid:823d64c1-eae9-4e8e-b159-fe1cbf68c1c7.

Full text
Abstract:
Traditional Inductive Logic Programming (ILP) focuses on the setting where the target theory is a generalisation of the observations. This is known as Observational Predicate Learning (OPL). In the Theory Completion setting the target theory is not in the same predicate as the observations (non-OPL). This thesis investigates two alternative simple extensions to traditional ILP to perform non-OPL or Theory Completion. Both techniques perform extraction-case abduction from an existing background theory and one seed observation. The first technique -- Logical Back-propagation -- modifies the existing background theory so that abductions can be achieved by a form of constructive negation using a standard SLD-resolution theorem prover. The second technique -- SOLD-resolution -- modifies the theorem prover, and leaves the existing background theory unchanged. It is shown that all abductions produced by Logical Back-propagation can also be generated by SOLD-resolution; but the reverse does not hold. The implementation using the SOLD-resolution technique -- the ALECTO system -- was applied to the problems of completing context free and context dependant grammars; and learning Event Calculus programs. It was successfully able to learn an Event Calculus program to control the navigation of a real-life robot. The Event Calculus is a formalism to represent common-sense knowledge. It follows that the discovery of some common-sense knowledge was produced with the assistance of a machine.
APA, Harvard, Vancouver, ISO, and other styles
32

Hill, Carla. "Mass assignments for inductive logic programming." Thesis, University of Bristol, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.325748.

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

Reed, G. M. "A uniform mathematical theory for real-time distributed computingT." Thesis, University of Oxford, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.233548.

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

Anderson, Jon K. "Genetic algorithms applied to graph theory." Virtual Press, 1999. http://liblink.bsu.edu/uhtbin/catkey/1136714.

Full text
Abstract:
This thesis proposes two new variations on the genetic algorithm. The first attempts to improve clustering problems by optimizing the structure of a genetic string dynamically during the run of the algorithm. This is done by using a permutation on the allele which is inherited by the next generation. The second is a multiple pool technique which ensures continuing convergence by maintaining unique lineages and merging pools of similar age. These variations will be tested against two well-known graph theory problems, the Traveling Salesman Problem and the Maximum Clique Problem. The results will be analyzed with respect to string rates, child improvement, pool rating resolution, and average string age.
Department of Computer Science
APA, Harvard, Vancouver, ISO, and other styles
35

Su, Li. "Modelling human cognition using concurrency theory." Thesis, University of Kent, 2009. https://kar.kent.ac.uk/24069/.

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

Karamanis, Dimitrios. "Stochastic dynamic programming methods for the portfolio selection problem." Thesis, London School of Economics and Political Science (University of London), 2013. http://etheses.lse.ac.uk/724/.

Full text
Abstract:
In this thesis, we study the portfolio selection problem with multiple risky assets, linear transaction costs and a risk measure in a multi-period setting. In particular, we formulate the multi-period portfolio selection problem as a dynamic program and to solve it we construct approximate dynamic programming (ADP) algorithms, where we include Conditional-Value-at-Risk (CVaR) as a measure of risk, for different separable functional approximations of the value functions. We begin with the simple linear approximation which does not capture the nature of the portfolio selection problem since it ignores risk and leads to portfolios of only one asset. To improve it, we impose upper bound constraints on the holdings of the assets and we notice that we have more diversified portfolios. Then, we implement a piecewise linear approximation, for which we construct an update rule for the slopes of the approximate value functions that preserves concavity as well as the number of slopes. Unlike the simple linear approximation, in the piecewise linear approximation we notice that risk affects the composition of the selected portfolios. Further, unlike the linear approximation with upper bounds, here wealth flows naturally from one asset to another leading to diversified portfolios without us needing to impose any additional constraints on how much we can hold in each asset. For comparison, we consider existing portfolio selection methods, both myopic ones such as the equally weighted and a single-period portfolio models, and multi-period ones such as multistage stochastic programming. We perform extensive simulations using real-world equity data to evaluate the performance of all methods and compare all methods to a market Index. Computational results show that the piecewise linear ADP algorithm significantly outperforms the other methods as well as the market and runs in reasonable computational times. Comparative results of all methods are provided and some interesting conclusions are drawn especially when it comes to comparing the piecewise linear ADP algorithms with multistage stochastic programming.
APA, Harvard, Vancouver, ISO, and other styles
37

Fukasawa, Ricardo. "Single-row mixed-integer programs : theory and computations /." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/24660.

Full text
Abstract:
Thesis (Ph.D.)--Industrial and Systems Engineering, Georgia Institute of Technology, 2009.
Committee Chair: William J. Cook; Committee Member: Ellis Johnson; Committee Member: George Nemhauser; Committee Member: Robin Thomas; Committee Member: Zonghao Gu
APA, Harvard, Vancouver, ISO, and other styles
38

Khamiss, A.-A. M. "Program construction in Martin-Lof's theory of types." Thesis, University of Essex, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.373210.

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

Portman, Martin. "Imprecision in real-time systems : theory and practice." Thesis, University of York, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.282288.

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

Jernlund, Per, and Martin Stenberg. "Functional and Imperative Object-Oriented Programming in Theory and Practice : A Study of Online Discussions in the Programming Community." Thesis, Uppsala universitet, Institutionen för informatik och media, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-387881.

Full text
Abstract:
Functional programming (FP) has progressively become more prevalent and techniques from the FP paradigm has been implemented in many different Imperative object-oriented programming (OOP) languages. However, there is no indication that OOP is going out of style. Nevertheless the increased popularity in FP has sparked new discussions across the Internet between the FP and OOP communities regarding a multitude of related aspects. These discussions could provide insights into the questions and challenges faced by programmers today. This thesis investigates these online discussions in a small and contemporary scale in order to identify the most discussed aspect of FP and OOP. Once identified the statements and claims made by various discussion participants were selected and compared to literature relating to the aspects and the theory behind the paradigms in order to determine whether there was any discrepancies between practitioners and theory. It was done in order to investigate whether the practitioners had different ideas in the form of best practices that could influence theories. The most discussed aspect within FP and OOP was ​immutability and state​ relating primarily to the aspects of ​concurrency ​ and ​performance​ . This thesis presents a selection of representative quotes that illustrate the different points of view held by groups in the community and then addresses those claims by investigating what is said in literature. It was shown that there were no direct discrepancies between the practitioners and the theory.
APA, Harvard, Vancouver, ISO, and other styles
41

Simons, Anthony James Howard. "A language with class : the theory of classification exemplified in an object-oriented language." Thesis, University of Sheffield, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.389555.

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

de, Farias Ismael Jr. "A polyhedral approach to combinatorial complementarity programming problems." Diss., Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/25574.

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

Crook, Nigel T. "The theory of explanation applied to medical expert systems." Thesis, Oxford Brookes University, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.303194.

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

Jervis, Clive Andrew. "A theory of program correctness with three valued logic." Thesis, University of Leeds, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.277297.

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

Telford, Alastair J. "Static analysis of Martin-Löf's intuitionistic type theory." Thesis, University of Kent, 1995. https://kar.kent.ac.uk/21246/.

Full text
Abstract:
Martin-Lof's intuitionistic type theory has been under investigation in recent years as a potential source for future functional programming languages. This is due to its properties which greatly aid the derivation of provably correct programs. These include the Curry-Howard correspondence (whereby logical formulas may be seen as specifications and proofs of logical formulas as programs) and strong normalisation (i.e. evaluation of every proof/program must terminate). Unfortunately, a corollary of these properties is that the programs may contain computationally irrelevant proof objects: proofs which are not to be printed as part of the result of a program. We show how a series of static analyses may be used to improve the efficiency of type theory as a lazy functional programming language. In particular we show how variants of abstract interpretation may be used to eliminate unnecessary computations in the object code that results from a type theoretic program. After an informal treatment of the application of abstract interpretation to type theory (where we discuss the features of type theory which make it particularly amenable to such an approach), we give formal proofs of correctness of our abstract interpretation techniques, with regard to the semantics of type theory. We subsequently describe how we have implemented abstract interpretation techniques within the Ferdinand functional language compiler. Ferdinand was developed as a lazy functional programming system by Andrew Douglas at the University of Kent at Canterbury. Finally, we show how other static analysis techniques may be applied to type theory. Some of these techniques use the abstract interpretation mechanisms previously discussed. abstract
APA, Harvard, Vancouver, ISO, and other styles
46

Salah, Maher Jawad Younis. "Optimum plastic design of structures by generalized inverse theory and quadratic programming." Thesis, Queen Mary, University of London, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.337445.

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

Passuello, Alberto. "Semidefinite programming in combinatorial optimization with applications to coding theory and geometry." Phd thesis, Université Sciences et Technologies - Bordeaux I, 2013. http://tel.archives-ouvertes.fr/tel-00948055.

Full text
Abstract:
We apply the semidefinite programming method to obtain a new upper bound on the cardinality of codes made of subspaces of a linear vector space over a finite field. Such codes are of interest in network coding.Next, with the same method, we prove an upper bound on the cardinality of sets avoiding one distance in the Johnson space, which is essentially Schrijver semidefinite program. This bound is used to improve existing results on the measurable chromatic number of the Euclidean space.We build a new hierarchy of semidefinite programs whose optimal values give upper bounds on the independence number of a graph. This hierarchy is based on matrices arising from simplicial complexes. We show some properties that our hierarchy shares with other classical ones. As an example, we show its application to the problem of determining the independence number of Paley graphs.
APA, Harvard, Vancouver, ISO, and other styles
48

Gabbay, Murdoch James. "A theory of inductive definitions with α-equivalence : semantics, implementation, programming language." Thesis, University of Cambridge, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.620988.

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

Dyer, Caitlin Elizabeth. "Reality Television: Using Para-Social Relationship Theory and Economic Theory to Define the Success of Network Reality Programming." Thesis, University of North Texas, 2010. https://digital.library.unt.edu/ark:/67531/metadc33144/.

Full text
Abstract:
This study seeks to use a dual-theoretical approach, through the use of para-social relationship theory and economic data analysis, to explain the success of reality television since the early 2000s. This study uses both qualitative and quantitative components to understand the growth of reality television. This study includes a literature analysis of both methodologies used. Focus groups were used to seek to find a strong level of para-social interaction in viewers of reality television. Two focus groups were conducted with participants 18-35. There were a total of 16 participants who attended the focus group sessions. The information collected suggested that viewers of reality television formed para-social relationships. It appeared that female viewers were more likely to form para-social relationships than male viewers.
APA, Harvard, Vancouver, ISO, and other styles
50

Lee, Mark. "Belief, rationality and inference : a general theory of computational pragmatics." Thesis, University of Sheffield, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.287357.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Programming theory' 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