Se connecter

Bibliographies thématiques / Constraint logic / Thèses

Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Constraint logic.

Thèses sur le sujet « Constraint logic »

Auteur : Grafiati

Publié le 7 juin 2025

Mis à jour le 2 août 2025

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les 50 meilleures thèses pour votre recherche sur le sujet « Constraint logic ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Parcourez les thèses sur diverses disciplines et organisez correctement votre bibliographie.

1

Chalmers, Stuart W. "Agents and constraint logic." Thesis, University of Aberdeen, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.401585.

Texte intégral

Résumé :

Using Constraint Logic Programming and a data model approach, we provide an agent with a flexible way to plan and direct its actions and to manipulate and represent its knowledge. We use constraint solving techniques developed in the KRAFT project to provide the agent with a sophisticated reasoning and deliberation process. We explore the declarative use of constraints within a BDI Agent framework to represent knowledge as complex quantified constraints and apply these techniques to a courier scenario where cooperating agents communicate, delegate and exchange desires and information using Gen

Styles APA, Harvard, Vancouver, ISO, etc.

2

Wetsel, Gerhard. "Abductive and constraint logic programming." Thesis, Imperial College London, 1997. http://hdl.handle.net/10044/1/7212.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

3

Martin, Barnaby D. "Logic, computation and constraint satisfaction." Thesis, University of Leicester, 2005. http://hdl.handle.net/2381/30530.

Texte intégral

Résumé :

We study a class of non-deterministic program schemes with while loops: firstly, augmented with a priority queue for memory; secondly, augmented with universal quantification; and, thirdly, augmented with universal quantification and a stack for memory. We try to relate these respective classes of program schemes to well-known complexity classes and logics.;We study classes of structure on which path system logic coincides with polynomial time P.;We examine the complexity of generalisations of non-uniform boolean constraint satisfaction problems, where the inputs may have a bounded number of q

Styles APA, Harvard, Vancouver, ISO, etc.

4

Weidner, Thomas. "Probabilistic Logic, Probabilistic Regular Expressions, and Constraint Temporal Logic." Doctoral thesis, Universitätsbibliothek Leipzig, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-208732.

Texte intégral

Résumé :

The classic theorems of Büchi and Kleene state the expressive equivalence of finite automata to monadic second order logic and regular expressions, respectively. These fundamental results enjoy applications in nearly every field of theoretical computer science. Around the same time as Büchi and Kleene, Rabin investigated probabilistic finite automata. This equally well established model has applications ranging from natural language processing to probabilistic model checking. Here, we give probabilistic extensions Büchi\\\'s theorem and Kleene\\\'s theorem to the probabilistic setting. We obt

Styles APA, Harvard, Vancouver, ISO, etc.

5

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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

6

Madelaine, Florent. "Constraint satisfaction problems and related logic." Thesis, University of Leicester, 2003. http://hdl.handle.net/2381/30524.

Texte intégral

Résumé :

Feder and Vardi have proved that the class captured by a monadic fragment of existential second-order logic, MMSNP, is computationally equivalent (via randomised reductions) to the class of constraint satisfaction problems (CSP) while the latter is strictly included in the former. I introduce a new class of combinatorial problems, the so-called forbidden patterns problems (FP), that correspond exactly to the logic MMSNP and introduce some novel algebraic tools like the re-colouring that allow me to construct a normal form. This leads to a constructive characterisation of the borderline of CSP

Styles APA, Harvard, Vancouver, ISO, etc.

7

CATTAFI, Massimiliano. "LOGIC AND CONSTRAINT PROGRAMMING FOR COMPUTATIONAL SUSTAINABILITY." Doctoral thesis, Università degli studi di Ferrara, 2012. http://hdl.handle.net/11392/2388775.

Texte intégral

Résumé :

Computational Sustainability is an interdisciplinary field that aims to develop computational and mathematical models and methods for decision making concerning the management and allocation of resources in order to help solve environmental problems. This thesis deals with a broad spectrum of such problems (energy efficiency, water management, limiting greenhouse gas emissions and fuel consumption) giving a contribution towards their solution by means of Logic Programming (LP) and Constraint Programming (CP), declarative paradigms from Artificial Intelligence of proven solidity. The p

Styles APA, Harvard, Vancouver, ISO, etc.

8

Padmanabhuni, Srinivas. "Logic programming with stable models for constraint satisfaction." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0009/NQ60011.pdf.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

9

Pippin, William E. Jr. "Optimizing Threads of Computation in Constraint Logic Programs." The Ohio State University, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=osu1041551800.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

10

Li, Bai. "Constraint-based reasoning in artificial intelligence." Thesis, University of Nottingham, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.282033.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

11

Egri, László. "The complexity of constraint satisfaction problems and symmetric Datalog /." Thesis, McGill University, 2007. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=101843.

Texte intégral

Résumé :

Constraint satisfaction problems (CSPs) provide a unified framework for studying a wide variety of computational problems naturally arising in combinatorics, artificial intelligence and database theory. To any finite domain D and any constraint language Γ (a finite set of relations over D), we associate the constraint satisfaction problem CSP(Γ): an instance of CSP(Γ) consists of a list of variables x1, x2,..., x n and a list of constraints of the form "(x 7, x2,..., x5) ∈ R" for some relation R in Γ. The goal is to determine whether the variables can be assigned values in D such that all cons

Styles APA, Harvard, Vancouver, ISO, etc.

12

Diaconescu, Razvan. "Category-based semantics for equational and constraint logic programming." Thesis, University of Oxford, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239361.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

13

Saglam, Hueseyin. "A toolkit for static analysis of constraint logic programs." Thesis, University of Bristol, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.262739.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

14

Coghill, George MacLeod. "Mycroft : a framework for constraint based fuzzy qualitative reasoning." Thesis, Heriot-Watt University, 1996. http://hdl.handle.net/10399/1235.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

15

Senkul, Karagoz Pinar. "Specification And Scheduling Of Workflows Under Resource Allocation Constraints." Phd thesis, METU, 2003. http://etd.lib.metu.edu.tr/upload/739193/index.pdf.

Texte intégral

Résumé :

Workflow is a collection of tasks organized to accomplish some business process. It also defines the order of task invocation or conditions under which task must be invoked, task synchronization, and information flow. Before the execution of the workflow, a correct execution schema, in other words, the schedule of the workflow, must be determined. Workflow scheduling is finding an execution sequence of tasks that obeys the business logic of workflow. Research on specification and scheduling of workflows has concentrated on temporal and causality constraints, which specify existence and order d

Styles APA, Harvard, Vancouver, ISO, etc.

16

Wang, Pengming. "Descriptive complexity of constraint problems." Thesis, University of Cambridge, 2018. https://www.repository.cam.ac.uk/handle/1810/276188.

Texte intégral

Résumé :

Constraint problems are a powerful framework in which many common combinatorial problems can be expressed. Examples include graph colouring problems, Boolean satisfaction, graph cut problems, systems of equations, and many more. One typically distinguishes between constraint satisfaction problems (CSPs), which model strictly decision problems, and so-called valued constraint satisfaction problems (VCSPs), which also include optimisation problems. A key open problem in this field is the long-standing dichotomy conjecture by Feder and Vardi. It claims that CSPs only fall into two categories: Tho

Styles APA, Harvard, Vancouver, ISO, etc.

17

Altunyuva, Fethi. "Implementation Of Concurrent Constraint Transaction Logic And Its User Interface." Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/12607623/index.pdf.

Texte intégral

Résumé :

This thesis implements a logical formalism framework called Concurrent Constraint Transaction Logic (abbr.,CCTR) which was defined for modeling and scheduling of workflows under resource allocation and cost constraints and develops an extensible and flexible graphical user interface for the framework. CCTR extends Concurrent Transaction Logic and integrates with Constraint Logic Programming to find the correct scheduling of tasks that involves resource and cost constraints. The developed system, which integrates Prolog and Java Platforms, is designed to serve as the basic environment for enter

Styles APA, Harvard, Vancouver, ISO, etc.

18

Manandhar, S. K. "Relational extensions to feature logic : applications to constraint based grammars." Thesis, University of Edinburgh, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.657261.

Texte intégral

Résumé :

This thesis investigates the logical and computational foundations of unification-based or more appropriately constraint based grammars. The thesis explores extensions to feature logics (which provide the basic knowledge representation services to constraint based grammars) with multi- valued or relational features. These extensions are useful for knowledge representation tasks that cannot be expressed within current feature logics. The approach bridges the gap between concept languages (such as KL-ONE) which are the mainstay of knowledge representation languages in AI and feature logics. Vari

Styles APA, Harvard, Vancouver, ISO, etc.

19

Swain, Martin T. "Protein side-chain placement using CLP." Thesis, University of Aberdeen, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.248614.

Texte intégral

Résumé :

Constraint logic programming (CLP) techniques can be used in protein side-chain placement, an important sub-task in comparative modelling. In a simple formulation values for domain variables represent rotamer side-chain conformations, and constraints represent atomic clashes. These constraints can be visualised using a "rotamer contact map", and observations made with this visualisation tool have been used to develop a strategy that overcomes limitations present in CLP caused by over-constrained residues. Null rotamers provide a mechanism that can automatically identify over-constrained residu

Styles APA, Harvard, Vancouver, ISO, etc.

20

Peralta, Estrada Julio C. "Analysis and specialisation of imperative programs : an approach using CLP." Thesis, University of Bristol, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.322591.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

21

Lafave, Laura. "A constraint-based partial evaluator for functional logic programs and its application." Thesis, University of Bristol, 1998. http://hdl.handle.net/1983/9ba4d239-e90c-478a-9c84-facde9a70355.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

22

Pietrzak, Paweł. "A type-based framework for locating errors in constraint logic programs /." Linköping : Dep. of Computer and Information Science, Univ, 2002. http://www.bibl.liu.se/liupubl/disp/disp2002/tek772s.pdf.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

23

Shapiro, Albina. "Interface timing verification using constraint logic programming and binary decision diagrams." Thesis, McGill University, 2004. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=82632.

Texte intégral

Résumé :

The design and verification of high performance circuits is becoming increasingly challenging due to the complex sets of constraints that must hold to ensure correct operation. The complexity of digital circuits increases rapidly, which in turn results in an increased complexity of the verification process and increased user effort. Efficient and easy to use tools are therefore required for timed verification.<br>In this thesis we propose two methods to aid the verification process. Firstly, we introduce a new verification methodology that combines the advantages of several existing suc

Styles APA, Harvard, Vancouver, ISO, etc.

24

SENNI, VALERIO. "Transformation techniques for constraint logic programs with applications to protocol verification." Doctoral thesis, Università degli Studi di Roma "Tor Vergata", 2008. http://hdl.handle.net/2108/530.

Texte intégral

Résumé :

Il contributo di questa tesi consiste nell'estensione delle tecniche per la trasformazione dei programmi logici con vincoli e lo sviluppo di metodi per l'applicazione di queste tecniche alla prova di proprietà temporali di protocolli parametrizzati. Per prima cosa viene proposto un metodo per la prova automatica della correttezza totale delle trasformazioni che usano regole di unfolding e folding basato sulla risoluzione di sistemi di equazioni e disequazioni sui numeri naturali. In secondo luogo viene proposto un metodo trasformazionale per la prova di proprietà del primo ordine di p

Styles APA, Harvard, Vancouver, ISO, etc.

25

Indrakumar, Selvaratnam. "Towards a constraint-based multi-agent approach to complex applications." Thesis, University of Surrey, 2000. http://epubs.surrey.ac.uk/2095/.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

26

Kwan, Alvin Chi Ming. "A framework for mapping constraint satisfaction problems to solution methods." Thesis, University of Essex, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.339436.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

27

Weidner, Thomas [Verfasser], Manfred [Akademischer Betreuer] Droste, Manfred [Gutachter] Droste, and Benedikt [Gutachter] Bollig. "Probabilistic Logic, Probabilistic Regular Expressions, and Constraint Temporal Logic / Thomas Weidner ; Gutachter: Manfred Droste, Benedikt Bollig ; Betreuer: Manfred Droste." Leipzig : Universitätsbibliothek Leipzig, 2016. http://d-nb.info/1240627777/34.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

28

Dageförde, Jan Christoph [Verfasser], and Herbert [Akademischer Betreuer] Kuchen. "An Integrated Constraint-Logic and Object-Oriented Programming Language : The Münster Logic-Imperative Language / Jan Christoph Dageförde ; Betreuer: Herbert Kuchen." Münster : Universitäts- und Landesbibliothek Münster, 2020. http://d-nb.info/1219449806/34.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

29

Zhao, Jicheng. "A study of answer set programming /." View Abstract or Full-Text, 2002. http://library.ust.hk/cgi/db/thesis.pl?COMP%202002%20ZHAO.

Texte intégral

Résumé :

Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2002.<br>Includes bibliographical references (leaves 49-51). Also available in electronic version. Access restricted to campus users.

Styles APA, Harvard, Vancouver, ISO, etc.

30

Little, James. "Integer programming, constraint logic programming and their collaboration in solving discrete optimisation problems." Thesis, Brunel University, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.365073.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

31

Magatão, Leandro. "Mixed integer linear programming and constraint logic programming : towards a unified modeling framework." Centro Federal de Educação Tecnológica do Paraná, 2005. http://repositorio.utfpr.edu.br/jspui/handle/1/86.

Texte intégral

Résumé :

The struggle to model and solve Combinatorial Optimization Problems (COPs) has challenged the development of new approaches to deal with COPs. In one of the front lines of such approaches, Operational Research (OR) and Constraint Programming (CP) optimization techniques are beginning to converge, despite their very different origins. More specifically, Mixed Integer Linear Programming (MILP) and Constraint Logic Programming (CLP) are at the confluence of the OR and the CP fields. This thesis summarizes and contrasts the essential characteristics of MILP and CLP, and the ways that they can be f

Styles APA, Harvard, Vancouver, ISO, etc.

32

Maloberti, Jérôme. "Improving inductive logic programming with constraint satisfaction techniques : applications to frequent query discovery." Paris 11, 2005. http://www.theses.fr/2005PA112139.

Texte intégral

Résumé :

Le travail presente vise a l'integration d'algorithmes de problemes de satisfaction de contraintes (psc) en programmation logique inductive (pli) et en fouille de donnees relationnelles. Cette integration est fondee sur le fait que le test de theta-subsomption, intensivement utilise pour evaluer des hypotheses et des requetes relationnelles, est equivalent a un psc. Trois algorithmes sont presentes : django, un algorithme de theta-subsomption qui combine des procedures (forward checking, coherence par arc, ordonnancement dynamique des variables) et des heuristiques (first fail principle) class

Styles APA, Harvard, Vancouver, ISO, etc.

33

Mário, Oliveira Rodrigues Cleyton. "Component assembly and theorem proving in constraint handling rules." Universidade Federal de Pernambuco, 2009. https://repositorio.ufpe.br/handle/123456789/1821.

Texte intégral

Résumé :

Made available in DSpace on 2014-06-12T15:52:36Z (GMT). No. of bitstreams: 1 license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5) Previous issue date: 2009<br>Devido á grande demanda por softwares cada vez mais robustos, complexos e flexíveis, e, sobretudo, pelo curtíssimo tempo de entrega exigido, a engenharia de software tem procurado novos meios de desenvolvimento que supram satisfatoriamente essas demandas. Uma forma de galgar esses novos patamares de produtividade provém do uso de uma metodologia baseada em agentes que se comunicam e com isso, ao invés dos prog

Styles APA, Harvard, Vancouver, ISO, etc.

34

Guzmán, Michell. "On the expressiveness of spatial constraint systems." Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLX064/document.

Texte intégral

Résumé :

Les comportement épistémiques, mobiles et spatiaux sont omniprésent dans les systèmes distribués aujourd’hui. La nature intrinsèque épistémique de ces types de systèmes provient des interactions des éleménts qui en font parties. La plupart des gens sont familiarisés avec des systèmes numériques où les utilisateurs peuvent partager ses croyances, opinions et même des mensonges intentionnels (des canulars). Aussi, les modèles de ces systèmes doivent tenir compte des interactions avec d’autres de même que leur nature distribués. Ces comportements spatiaux et mobiles font part d’applications où le

Styles APA, Harvard, Vancouver, ISO, etc.

35

Chaudhari, Gunavant Dinkar. "Simulation and emulation of massively parallel processor for solving constraint satisfaction problems based on oracles." PDXScholar, 2011. https://pdxscholar.library.pdx.edu/open_access_etds/11.

Texte intégral

Résumé :

Most part of my thesis is devoted to efficient automated logic synthesis of oracle processors. These Oracle Processors are of interest to several modern technologies, including Scheduling and Allocation, Image Processing and Robot Vision, Computer Aided Design, Games and Puzzles, and Cellular Automata, but so far the most important practical application is to build logic circuits to solve various practical Constraint Satisfaction Problems in Intelligent Robotics. For instance, robot path planning can be reduced to Satisfiability. In short, an oracle is a circuit that has some proposition of so

Styles APA, Harvard, Vancouver, ISO, etc.

36

Knight, Sophia. "The Epistemic View of Concurrency Theory." Palaiseau, Ecole polytechnique, 2013. http://tel.archives-ouvertes.fr/docs/00/94/04/13/PDF/thesis.pdf.

Texte intégral

Résumé :

Le raisonnement epistémique joue un rôle en théorie de la concurrence de plusieurs manières distinctes mais complémentaires; cette thèse en décrit trois. La première, et presque certainement la moins explorée jusqu'à présent, est l'idée d'utiliser les modalités épistémiques comme éléments d'un langage de programmation. La programmation logique émergea sous le slogan <> et dans le paradigme de la programmation concurrente par contraintes, le lien est manifeste de manière très claire. Dans la première partie de cette thèse, nous explorons le rôle des modalités épistémiques, ainsi que celui

Styles APA, Harvard, Vancouver, ISO, etc.

37

Geske, Ulrich, and Armin Wolf. "Preface." Universität Potsdam, 2010. http://opus.kobv.de/ubp/volltexte/2010/4140/.

Texte intégral

Résumé :

The workshops on (constraint) logic programming (WLP) are the annual meeting of the Society of Logic Programming (GLP e.V.) and bring together researchers interested in logic programming, constraint programming, and related areas like databases, artificial intelligence and operations research. In this decade, previous workshops took place in Dresden (2008), Würzburg (2007), Vienna (2006), Ulm (2005), Potsdam (2004), Dresden (2002), Kiel (2001), and Würzburg (2000). Contributions to workshops deal with all theoretical, experimental, and application aspects of constraint programming (CP) and log

Styles APA, Harvard, Vancouver, ISO, etc.

38

Magnusson, Martin. "Deductive Planning and Composite Actions in Temporal Action Logic." Licentiate thesis, Linköping : Department of Computer and Information Science, Linköpings universitet, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-9726.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

39

BERTAGNON, ALESSANDRO. "Improving Reasoning in Constraint Logic Programming: an Application to Route Planning and Qualitative Temporal Reasoning Problems." Doctoral thesis, Università degli studi di Ferrara, 2022. http://hdl.handle.net/11392/2487898.

Texte intégral

Résumé :

Constraint (Logic) Programming (CLP) is a popular paradigm to deal with Constraint Satisfaction Problems (CSPs) and Constraint Optimization Problems (COPs) in artificial intelligence. Constraint solving techniques, also known as constraint reasoning algorithms, can be divided into two distinct and orthogonal strategies: inference (or constraint propagation) and search. In this research we address constraint reasoning algorithms for two popular application domains: vehicle route planning and qualitative temporal reasoning. Regarding vehicle route planning, we study the Euclidean TSP (ETSP), a s

Styles APA, Harvard, Vancouver, ISO, etc.

40

Karatas, Ahmet Serkan. "Analysis Of Extended Feature Models With Constraint Programming." Phd thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/3/12612082/index.pdf.

Texte intégral

Résumé :

In this dissertation we lay the groundwork of automated analysis of extended feature models with constraint programming. Among different proposals, feature modeling has proven to be very effective for modeling and managing variability in Software Product Lines. However, industrial experiences showed that feature models often grow too large with hundreds of features and complex cross-tree relationships, which necessitates automated analysis support. To address this issue we present a mapping from extended feature models, which may include complex feature-feature, feature-attribute and attribute

Styles APA, Harvard, Vancouver, ISO, etc.

41

Sahebkar, Khorasani Elham Sahebkar. "FORMALIZATION AND IMPLEMENTATION OF GENERALIZED CONSTRAINT LANGUAGE FOR REALIZATION OF COMPUTING WITH WORDS." OpenSIUC, 2012. https://opensiuc.lib.siu.edu/dissertations/592.

Texte intégral

Résumé :

The Generalized Constraint Language (GCL), introduced by Zadeh, is the essence of Computing with Words (CW). It provides an genda to represent the meaning of imprecise words and phrases in natural language and introduces advanced techniques to perform reasoning on imprecise knowledge. Despite its fundamental role, the definition of GCL has remained informal since its introduction by Zadeh and, to our knowledge, no attempt has been made to formalize GCL or to build a working GCL deduction system. In this dissertation, two main interrelated objectives are pursued: First, the syntax and semantic

Styles APA, Harvard, Vancouver, ISO, etc.

42

Eriksson, Skoog Gun. "The soft budget constraint : the emergence, persistence and logic of an institution : The Case of Tanzania1967-1992." Doctoral thesis, Handelshögskolan i Stockholm, Internationell Ekonomi och Geografi (IEG), 1998. http://urn.kb.se/resolve?urn=urn:nbn:se:hhs:diva-652.

Texte intégral

Résumé :

The soft budget constraint - today a popular metaphor - is a paradox. In socialist economies, it implies that the state tends to bail out state-owned firms in financial trouble, in spite of the tremendous performance problems of the entire system that result. When the system broke down, the soft budget constraint was expected to disappear. However, it seems to persist, and its persistence appears to hamper the transition process itself. This study seeks an answer to this paradox. It aims at increasing our understanding of why the soft budget constraint exists. By investigating state-owned ente

Styles APA, Harvard, Vancouver, ISO, etc.

43

Palavalasa, Swetha Rao. "Implementation of Constraint Propagation Tree for Question Answering Systems." Available to subscribers only, 2009. http://proquest.umi.com/pqdweb?did=1796121021&sid=6&Fmt=2&clientId=1509&RQT=309&VName=PQD.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

44

Eriksson, Skoog Gun. "The soft budget constraint : the emergence, persistence and logic of an institution : the case of Tanzania 1967-1992 /." Stockholm : Economic Research Institute, Stockholm School of Economics (Ekonomiska forskningsinstitutet vid Handelshögsk.) (EFI), 1998. http://www.hhs.se/efi/summary/496.htm.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

45

Ågren, Magnus. "Set Constraints for Local Search." Doctoral thesis, Uppsala universitet, Avdelningen för datalogi, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-8373.

Texte intégral

Résumé :

Combinatorial problems are ubiquitous in our society and solving such problems efficiently is often crucial. One technique for solving combinatorial problems is constraint-based local search. Its compositional nature together with its efficiency on large problem instances have made this technique particularly attractive. In this thesis we contribute to simplifying the solving of combinatorial problems using constraint-based local search. To provide higher-level modelling options, we introduce set variables and set constraints in local search by extending relevant local search concepts. We also

Styles APA, Harvard, Vancouver, ISO, etc.

46

Pivkina, Inna Valentinovna. "REVISION PROGRAMMING: A KNOWLEDGE REPRESENTATION FORMALISM." Lexington, Ky. : [University of Kentucky Libraries], 2001. http://lib.uky.edu/ETD/ukycosc2001d00022/pivkina.pdf.

Texte intégral

Résumé :

Thesis (Ph. D.)--University of Kentucky, 2001.<br>Title from document title page. Document formatted into pages; contains vii, 121 p. : ill. Includes abstract. Includes bibliographical references (p. 116-119).

Styles APA, Harvard, Vancouver, ISO, etc.

47

Traynard, Pauline. "Model Building by Temporal Logic Constraint Solving : Investigation of the Coupling between the Cell Cycle and the Circadian Clock." Sorbonne Paris Cité, 2016. http://www.theses.fr/2016USPCC087.

Texte intégral

Résumé :

Cette dissertation explore l'utilisation de la logique temporelle et de la vérification de modèle en biologie des systèmes. Nous soutenons que la logique temporalle constitue un outil puissant pour formaliser des propriétés dynamiques à la fois complexes et imprécises permettant de caractériser un système biologique. Cet outil peut être utilisé pour partiellement automatiser la construction de modèle, comme une résolution d'un problème de satisfaction de contraintes. Tout d'abord, nous étudions l'emploi de la logique arborecente (Computation Tree Logic) pour vérifier des propriétés dynamiques

Styles APA, Harvard, Vancouver, ISO, etc.

48

Vitorino, dos Santos Filho Jairson. "CHROME: a model-driven component-based rule engine." Universidade Federal de Pernambuco, 2009. https://repositorio.ufpe.br/handle/123456789/1638.

Texte intégral

Résumé :

Made available in DSpace on 2014-06-12T15:51:39Z (GMT). No. of bitstreams: 2 arquivo2757_1.pdf: 5759741 bytes, checksum: 8075c58c36a6d409b242f2a7873fb02f (MD5) license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5) Previous issue date: 2009<br>Coordenação de Aperfeiçoamento de Pessoal de Nível Superior<br>Vitorino dos Santos Filho, Jairson; Pierre Louis Robin, Jacques. CHROME: a model-driven component-based rule engine. 2009. Tese (Doutorado). Programa de Pós-Graduação em Ciência da Computação, Universidade Federal de Pernambuco, Recife, 2009.

Styles APA, Harvard, Vancouver, ISO, etc.

49

Dsouza, Michael Dylan. "Fast Static Learning and Inductive Reasoning with Applications to ATPG Problems." Thesis, Virginia Tech, 2015. http://hdl.handle.net/10919/51591.

Texte intégral

Résumé :

Relations among various nodes in the circuit, as captured by static and inductive invariants, have shown to have a positive impact on a wide range of EDA applications. Techniques such as boolean constraint propagation for static learning and assume-then-verify approach to reason about inductive invariants have been possible due to efficient SAT solvers. Although a significant amount of research effort has been dedicated to the development of effective invariant learning techniques over the years, the computation time for deriving powerful multi-node invariants is still a bottleneck for large c

Styles APA, Harvard, Vancouver, ISO, etc.

50

Vargas, Patricia Kayser. "Exploração de paralelismo ou em uma linguagem em lógica com restrições." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 1998. http://hdl.handle.net/10183/26307.

Texte intégral

Résumé :

Este trabalho a dedicado ao estudo da exploração de paralelismo OU na programação em lógica com restrições em ambientes distribuídos. A programação em lógica, cuja linguagem mais significativa 6 Prolog, tem como premissa a utilização da lógica de predicados como linguagem computacional. A programação em lógica com restrições (CLP) é uma extensão da programação em lógica, onde busca-se a eficiência e a possibilidade de executar novas classes de problemas. Variáveis em CLP podem pertencer a domínios específicos como, por exemplo, reais ou booleanos. O principal conceito introduzido é a restrição

Styles APA, Harvard, Vancouver, ISO, etc.

Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!