Log in

Relevant bibliographies by topics / Logic programming / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Logic programming.

Dissertations / Theses on the topic 'Logic programming'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

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

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Logic programming.'

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

Zhu, Biao. "Logic programming framework for resolution logics." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0006/MQ43411.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

McPhee, Richard. "Compositional logic programming." Thesis, University of Oxford, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.393413.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Toni, Francesca. "Abductive logic programming." Thesis, Imperial College London, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.490558.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Hale, Roger William Stephen. "Programming in temporal logic." Thesis, University of Cambridge, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.305467.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Quintero, Jacinto Alfonso Davila. "Agents in logic programming." Thesis, Imperial College London, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.263219.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Moreno, Dávila Julio Moreno Davila Julio. "Mathematical programming for logic inference /." [S.l.] : [s.n.], 1990. http://library.epfl.ch/theses/?nr=784.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Wang, Tzone I. "Distributed object oriented logic programming." Thesis, Imperial College London, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.296891.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Seres, Silvija. "The algebra of logic programming." Thesis, University of Oxford, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.365466.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Ormerod, T. C. "Cognitive processes in logic programming." Thesis, University of Sunderland, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.382171.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Eshghi, Kave. "Meta-language in logic programming." Thesis, Imperial College London, 1987. http://hdl.handle.net/10044/1/38302.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Sakama, Chiaki. "Studies on Disjunctive Logic Programming." Kyoto University, 1995. http://hdl.handle.net/2433/160755.

Full text

Abstract:

本文データは平成22年度国立国会図書館の学位論文(博士)のデジタル化実施により作成された画像ファイルを基にpdf変換したものである<br>Kyoto University (京都大学)<br>0048<br>新制・論文博士<br>博士(工学)<br>乙第8778号<br>論工博第2940号<br>新制||工||979(附属図書館)<br>UT51-95-B243<br>(主査)教授堂下修司, 教授松本吉弘, 教授石田亨<br>学位規則第4条第2項該当

APA, Harvard, Vancouver, ISO, and other styles

14

Bird, Philip. "Unifying programming paradigms : logic programming and finite state automata." Thesis, University of Sheffield, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.419609.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Chen, Guiming. "Fuzzy FOIL: A fuzzy logic based inductive logic programming system." Thesis, University of Ottawa (Canada), 1996. http://hdl.handle.net/10393/9621.

Full text

Abstract:

In many domains, characterizations of a given attribute are imprecise, uncertain and incomplete in the available learning examples. The definitions of classes may be vague. Learning systems are frequently forced to deal with such uncertainty. Traditional learning systems are designed to work in the domains where imprecision and uncertainty in the data are absent. Those learning systems are limited because of their impossibility to cope with uncertainty--a typical feature of real-world data. In this thesis, we developed a fuzzy learning system which combines inductive learning with a fuzzy appr

APA, Harvard, Vancouver, ISO, and other styles

16

Wichert, Carl-Alexander. "ULTRA - a logic transaction programming language." [S.l. : s.n.], 2000. http://deposit.ddb.de/cgi-bin/dokserv?idn=96114856X.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Rajnovich, James Jacob. "Piilog, partial information ionic logic programming." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0016/NQ58159.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Rochefort, Stephen. "Logic programming applications in educational environments." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0012/NQ61676.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Fidjeland, Andreas Kirkeby. "Custom computer architectures for logic programming." Thesis, Imperial College London, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.439777.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

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

21

Mukolera, J. "Logic programming in electrical machine design." Thesis, Imperial College London, 1987. http://hdl.handle.net/10044/1/47359.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Bahgat, Reem. "Pandora : non-deterministic parallel logic programming." Thesis, Imperial College London, 1991. http://hdl.handle.net/10044/1/46657.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Khabaza, Tom. "Towards AND/OR parallel logic programming." Thesis, University of Sussex, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.283623.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Cook, Jonathan J. "Language interoperability and logic programming languages." Thesis, University of Edinburgh, 2005. http://hdl.handle.net/1842/725.

Full text

Abstract:

We discuss P#, our implementation of a tool which allows interoperation between a concurrent superset of the Prolog programming language and C#. This enables Prolog to be used as a native implementation language for Microsoft's .NET platform. P# compiles a linear logic extension of Prolog to C# source code. We can thus create C# objects from Prolog and use C#'s graphical, networking and other libraries. P# was developed from a modified port of the Prolog to Java translator, Prolog Cafe. We add language constructs on the Prolog side which allow concurrent Prolog code to be written. We add a pri

APA, Harvard, Vancouver, ISO, and other styles

25

Dietz, Saldanha Emmanuelle-Anna. "From Logic Programming to Human Reasoning:." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-227412.

Full text

Abstract:

Results of psychological experiments have shown that humans make assumptions, which are not necessarily valid, that they are influenced by their background knowledge and that they reason non-monotonically. These observations show that classical logic does not seem to be adequate for modeling human reasoning. Instead of assuming that humans do not reason logically at all, we take the view that humans do not reason classical logically. Our goal is to model episodes of human reasoning and for this purpose we investigate the so-called Weak Completion Semantics. The Weak Completion Semantics is a L

APA, Harvard, Vancouver, ISO, and other styles

26

Smaus, Jan-Georg. "Modes and types in logic programming." Thesis, University of Kent, 1999. https://kar.kent.ac.uk/21739/.

Full text

Abstract:

This thesis deals with two themes: (1) construction of abstract domains for mode analysis of typed logic programs; (2) verification of logic programs using non-standard selection rules. (1) Mode information is important mainly for compiler optimisations. The precision of a mode analysis depends partly on the expressiveness of the abstract domain. We show how specialised abstract domains may be constructed for each type in a typed logic program. These domains capture the degree of instantiation of a term very precisely. The domain construction procedure is implemented using the Godel language a

APA, Harvard, Vancouver, ISO, and other styles

27

Lin, Dianhuan. "Logic programs as declarative and procedural bias in inductive logic programming." Thesis, Imperial College London, 2013. http://hdl.handle.net/10044/1/24553.

Full text

Abstract:

Machine Learning is necessary for the development of Artificial Intelligence, as pointed out by Turing in his 1950 article ``Computing Machinery and Intelligence''. It is in the same article that Turing suggested the use of computational logic and background knowledge for learning. This thesis follows a logic-based machine learning approach called Inductive Logic Programming (ILP), which is advantageous over other machine learning approaches in terms of relational learning and utilising background knowledge. ILP uses logic programs as a uniform representation for hypothesis, background knowled

APA, Harvard, Vancouver, ISO, and other styles

28

Singhi, Soumya. "Computing stable models of logic programs." Lexington, Ky. : [University of Kentucky Libraries], 2003. http://lib.uky.edu/ETD/ukycosc2003t00117/SSThesis.pdf.

Full text

Abstract:

Thesis (M.S.)--University of Kentucky, 2003.<br>Title from document title page (viewed June 21, 2004). Document formatted into pages; contains viii, 55 p. : ill. Includes abstract and vita. Includes bibliographical references (p. 52-54).

APA, Harvard, Vancouver, ISO, and other styles

29

Lin, Nai-Wei. "Automatic complexity analysis of logic programs." Diss., The University of Arizona, 1993. http://hdl.handle.net/10150/186287.

Full text

Abstract:

This dissertation describes research toward automatic complexity analysis of logic programs and its applications. Automatic complexity analysis of programs concerns the inference of the amount of computational resources consumed during program execution, and has been studied primarily in the context of imperative and functional languages. This dissertation extends these techniques to logic programs so that they can handle nondeterminism, namely, the generation of multiple solutions via backtracking. We describe the design and implementation of a (semi)-automatic worst-case complexity analysis

APA, Harvard, Vancouver, ISO, and other styles

30

Athakravi, Duangtida. "Inductive logic programming using bounded hypothesis space." Thesis, Imperial College London, 2015. http://hdl.handle.net/10044/1/33798.

Full text

Abstract:

Inductive Logic Programming (ILP) systems apply inductive learning to an inductive learning task by deriving a hypothesis which explains the given examples. Applying ILP systems to real applications poses many challenges as they require large search space, noise is present in the learning task, and in domains such as software engineering hypotheses are required to satisfy domain specific syntactic constraints. ILP systems use language biases to define the hypothesis space, and learning can be seen as a search within the defined hypothesis space. Past systems apply search heuristics to traverse

APA, Harvard, Vancouver, ISO, and other styles

31

Wu, Cheng-min, of Western Sydney Nepean University, and School of Computing and Information Technology. "Implementing a prioritized logic programming system : thesis." THESIS_XXX_CIT_Wu_C.xml, 2000. http://handle.uws.edu.au:8081/1959.7/188.

Full text

Abstract:

Rule based knowledge representation and reasoning often face a problem of conflict with rules. One common way of solving conflicts is to introduce priorities associate with rules. The thesis describes the underlying algorithm to implement prioritized logic programs (PLPs) proposed by Zhang and Foo in 1997. PLPs are proposed as an extension of Gelfond and Lifschitz's extended logic programs by introducing preferences associatied with rules to the program, where answer sets provide a semantics of PLPs. Major algorithms are presented in detail, and how answer sets can be derived from the algorith

APA, Harvard, Vancouver, ISO, and other styles

32

Gaubatz, Donald Almo. "Logic programming analysis of asynchronous digital circuits." Thesis, University of Cambridge, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.386062.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Quigley, Claire Louise. "A programming logic for Java bytecode programs." Thesis, University of Glasgow, 2004. http://theses.gla.ac.uk/3030/.

Full text

Abstract:

One significant disadvantage of interpreted bytecode languages, such as Java, is their low execution speed in comparison to compiled languages like C. The mobile nature of bytecode adds to the problem, as many checks are necessary to ensure that downloaded code from untrusted sources is rendered as safe as possible. But there do exist ways of speeding up such systems. One approach is to carry out static type checking at load time, as in the case of the Java Bytecode Verifier. This reduces the number of runtime checks that must be done and also allows certain instructions to be replaced by fast

APA, Harvard, Vancouver, ISO, and other styles

34

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 d

APA, Harvard, Vancouver, ISO, and other styles

35

Dayantis, George. "Types, modularisation and abstraction in logic programming." Thesis, University of Sussex, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.255977.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Ebrahim, Rafee E. "Fuzzy logic programming based on alpha-cuts." Thesis, De Montfort University, 2003. http://hdl.handle.net/2086/13274.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Corapi, Domenico. "Nonmonotonic inductive logic programming as abductive search." Thesis, Imperial College London, 2012. http://hdl.handle.net/10044/1/9814.

Full text

Abstract:

Inductive Logic Programming (ILP) is a machine learning technique that relies on logic programs as a representation language. Most of the effort in the field of ILP has concentrated on a restricted class of problems, providing solutions that do not fully support negation. On the other hand, integration of negation and nonmonotonic reasoning in logic programming is common and important for a number of problems. This thesis presents an approach to nonmonotonic ILP that is based on a transformation of the original problem to a problem that can be solved by employing abductive reasoning. In partic

APA, Harvard, Vancouver, ISO, and other styles

38

Wu, Cheng-min. "Implementing a prioritized logic programming system : thesis." Thesis, View thesis, 2000. http://handle.uws.edu.au:8081/1959.7/188.

Full text

Abstract:

Rule based knowledge representation and reasoning often face a problem of conflict with rules. One common way of solving conflicts is to introduce priorities associate with rules. The thesis describes the underlying algorithm to implement prioritized logic programs (PLPs) proposed by Zhang and Foo in 1997. PLPs are proposed as an extension of Gelfond and Lifschitz's extended logic programs by introducing preferences associatied with rules to the program, where answer sets provide a semantics of PLPs. Major algorithms are presented in detail, and how answer sets can be derived from the algorith

APA, Harvard, Vancouver, ISO, and other styles

39

Wu, Cheng-min. "Implementing a prioritized logic programming system : thesis /." View thesis, 2000. http://library.uws.edu.au/adt-NUWS/public/adt-NUWS20030618.084318/index.html.

Full text

Abstract:

Thesis (MSc (Hons.)) -- University of Western Sydney, Nepean, 2000.<br>"A thesis submitted for the degree of Master of Science (Honours)-Computing at University of Western Sydney - Nepean" Includes bibliographical references (leaves 117-121).

APA, Harvard, Vancouver, ISO, and other styles

40

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

41

AZZOLINI, DAMIANO. "Extensions and Applications of Probabilistic Logic Programming." Doctoral thesis, Università degli studi di Ferrara, 2022. http://hdl.handle.net/11392/2478826.

Full text

Abstract:

L'intelligenza artificiale simbolica viene definita come ''Good Old-Fashioned Artificial Intelligence'' perché rappresenta ciò che è noto tramite simboli (per esempio, predicati del primo ordine e costanti) invece che tramite matrici di numeri, come accade per le soluzioni sub-simboliche (principalmente reti neurali). Nonostante il recente predominio delle reti neurali, considerate quasi una panacea per risolvere qualsiasi problema legato all'apprendimento automatico, esiste un ambito di ricerca in rapida espansione chiamato Statistical Relational Artificial Intelligence dove l'obiettivo è qu

APA, Harvard, Vancouver, ISO, and other styles

42

Farrow, P. F. "Logic, dependencies, and specification engineering." Thesis, University of Southampton, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.328298.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Duan, Zhenhua. "An extended interval temporal logic and a framing technique for temporal logic programming." Thesis, University of Newcastle Upon Tyne, 1996. http://hdl.handle.net/10443/2075.

Full text

Abstract:

Temporal logic programming is a paradigm for specification and verification of concurrent programs in which a program can be written, and the properties of the program can be described and verified in a same notation. However, there are many aspects of programming in temporal logics that are not well-understood. One such an aspect is concurrent programming, another is framing and the third is synchronous communication for parallel processes. This thesis extends the original Interval Temporal Logic (ITL) to include infinite models, past operators, and a new projection operator for dealing with

APA, Harvard, Vancouver, ISO, and other styles

44

Wong, Ka-Shu Computer Science &amp Engineering Faculty of Engineering UNSW. "Forgetting in logic programs." Publisher:University of New South Wales. Computer Science & Engineering, 2009. http://handle.unsw.edu.au/1959.4/43732.

Full text

Abstract:

Forgetting is an operation which removes information from a set of logical statements, such that a) the language used by the logic is simplified; and b) as much information as possible from the original logical statements are preserved. Forgetting operations are useful in a variety of contexts, including knowledge representation, where it is necessary to have an operation for removing information from knowledge bases; and the problem of relevance, where logical statements are simplified by removing irrelevant information. In this thesis we consider forgetting operations on logic programs with

APA, Harvard, Vancouver, ISO, and other styles

45

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Melendez, Rafael Ramirez. "A logic-based concurrent object-oriented programming language." Thesis, University of Bristol, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.337487.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

ALVES, MARIA DO CARMO ELIAS. "A LOGIC PROGRAMMING EXTENSION FOR C CALLED CLOG." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 1993. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=8753@1.

Full text

Abstract:

A aplicação de linguagens declarativas baseadas na programação em lógica tem sido bastante difundida devido ao grande interesse hoje existente na área de Inteligência Artificial. Porém, o uso destas linguagens ainda não é muito evidente devido à restrições de desempenho, portabilidade, capacidade de integração com outras linguagens, etc. O presente trabalho contém a definição e implementação de uma extensão de programação em lógica para o C, denominada CLog, que têm como objetivo suprir as deficiências acima, permitindo, principalmente, a implementação de aplicações que apresentem

APA, Harvard, Vancouver, ISO, and other styles

48

FILHO, DANTE CORBUCCI. "LISPLOG: A LANGUAGE FOR FUNCTIONAL AND LOGIC PROGRAMMING." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 1989. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=14348@1.

Full text

Abstract:

CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>Esta dissertação apresenta uma integração entre a programação funcional e a programação em lógica, obtida pela definição e implementação da Linguagem LispLog. Nesta nova linguagem, o resultado de uma resolução pode ser utilizado como argumento de uma função (pelo operador metalisp) e o resultado da avaliação de uma função pode ser ligado a uma variável lógica (pelo operador avalia). A construção desta linguagem foi realizada a partir da simulação, em microcomputador similar ao IBM-PC, de uma máquina com arquitetura de pilhas, cha

APA, Harvard, Vancouver, ISO, and other styles

49

Fuller, David Alfredo. "Partial evaluation and mix computation in logic programming." Thesis, Imperial College London, 1989. http://hdl.handle.net/10044/1/47442.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Schild, Uri Jakob. "Open-textured law, expert systems and logic programming." Thesis, Imperial College London, 1990. http://hdl.handle.net/10044/1/46539.

Full text

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!