Rozprawy doktorskie na temat „Logic programming”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Logic programming”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
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.
Pełny tekst źródłaMcPhee, Richard. "Compositional logic programming". Thesis, University of Oxford, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.393413.
Pełny tekst źródłaToni, Francesca. "Abductive logic programming". Thesis, Imperial College London, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.490558.
Pełny tekst źródłaHale, Roger William Stephen. "Programming in temporal logic". Thesis, University of Cambridge, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.305467.
Pełny tekst źródłaQuintero, Jacinto Alfonso Davila. "Agents in logic programming". Thesis, Imperial College London, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.263219.
Pełny tekst źródłaMoreno, Dávila Julio Moreno Davila Julio. "Mathematical programming for logic inference /". [S.l.] : [s.n.], 1990. http://library.epfl.ch/theses/?nr=784.
Pełny tekst źródłaWetsel, Gerhard. "Abductive and constraint logic programming". Thesis, Imperial College London, 1997. http://hdl.handle.net/10044/1/7212.
Pełny tekst źródłaWang, Tzone I. "Distributed object oriented logic programming". Thesis, Imperial College London, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.296891.
Pełny tekst źródłaSeres, Silvija. "The algebra of logic programming". Thesis, University of Oxford, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.365466.
Pełny tekst źródłaGoldsmith, M. H. "Logic, programming and formal specification". Thesis, University of Oxford, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.371541.
Pełny tekst źródłaOrmerod, T. C. "Cognitive processes in logic programming". Thesis, University of Sunderland, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.382171.
Pełny tekst źródłaEshghi, Kave. "Meta-language in logic programming". Thesis, Imperial College London, 1987. http://hdl.handle.net/10044/1/38302.
Pełny tekst źródłaSakama, Chiaki. "Studies on Disjunctive Logic Programming". Kyoto University, 1995. http://hdl.handle.net/2433/160755.
Pełny tekst źródłaKyoto University (京都大学)
0048
新制・論文博士
博士(工学)
乙第8778号
論工博第2940号
新制||工||979(附属図書館)
UT51-95-B243
(主査)教授 堂下 修司, 教授 松本 吉弘, 教授 石田 亨
学位規則第4条第2項該当
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.
Pełny tekst źródłaChen, Guiming. "Fuzzy FOIL: A fuzzy logic based inductive logic programming system". Thesis, University of Ottawa (Canada), 1996. http://hdl.handle.net/10393/9621.
Pełny tekst źródłaWichert, Carl-Alexander. "ULTRA - a logic transaction programming language". [S.l. : s.n.], 2000. http://deposit.ddb.de/cgi-bin/dokserv?idn=96114856X.
Pełny tekst źródłaRajnovich, 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.
Pełny tekst źródłaRochefort, 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.
Pełny tekst źródłaFidjeland, Andreas Kirkeby. "Custom computer architectures for logic programming". Thesis, Imperial College London, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.439777.
Pełny tekst źródłaHill, Carla. "Mass assignments for inductive logic programming". Thesis, University of Bristol, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.325748.
Pełny tekst źródłaMukolera, J. "Logic programming in electrical machine design". Thesis, Imperial College London, 1987. http://hdl.handle.net/10044/1/47359.
Pełny tekst źródłaBahgat, Reem. "Pandora : non-deterministic parallel logic programming". Thesis, Imperial College London, 1991. http://hdl.handle.net/10044/1/46657.
Pełny tekst źródłaKhabaza, Tom. "Towards AND/OR parallel logic programming". Thesis, University of Sussex, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.283623.
Pełny tekst źródłaCook, Jonathan J. "Language interoperability and logic programming languages". Thesis, University of Edinburgh, 2005. http://hdl.handle.net/1842/725.
Pełny tekst źródłaDietz, 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.
Pełny tekst źródłaSmaus, Jan-Georg. "Modes and types in logic programming". Thesis, University of Kent, 1999. https://kar.kent.ac.uk/21739/.
Pełny tekst źródłaLin, Dianhuan. "Logic programs as declarative and procedural bias in inductive logic programming". Thesis, Imperial College London, 2013. http://hdl.handle.net/10044/1/24553.
Pełny tekst źródłaSinghi, Soumya. "Computing stable models of logic programs". Lexington, Ky. : [University of Kentucky Libraries], 2003. http://lib.uky.edu/ETD/ukycosc2003t00117/SSThesis.pdf.
Pełny tekst źródłaTitle 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).
Lin, Nai-Wei. "Automatic complexity analysis of logic programs". Diss., The University of Arizona, 1993. http://hdl.handle.net/10150/186287.
Pełny tekst źródłaAthakravi, Duangtida. "Inductive logic programming using bounded hypothesis space". Thesis, Imperial College London, 2015. http://hdl.handle.net/10044/1/33798.
Pełny tekst źródłaWu, Cheng-min, of Western Sydney Nepean University i 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.
Pełny tekst źródłaMaster of Science (Hons) (Computing)
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.
Pełny tekst źródłaQuigley, Claire Louise. "A programming logic for Java bytecode programs". Thesis, University of Glasgow, 2004. http://theses.gla.ac.uk/3030/.
Pełny tekst źródłaAndrews, James H. "Logic programming : operational semantics and proof theory". Thesis, University of Edinburgh, 1991. http://hdl.handle.net/1842/13484.
Pełny tekst źródłaDayantis, George. "Types, modularisation and abstraction in logic programming". Thesis, University of Sussex, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.255977.
Pełny tekst źródłaEbrahim, Rafee E. "Fuzzy logic programming based on alpha-cuts". Thesis, De Montfort University, 2003. http://hdl.handle.net/2086/13274.
Pełny tekst źródłaCorapi, Domenico. "Nonmonotonic inductive logic programming as abductive search". Thesis, Imperial College London, 2012. http://hdl.handle.net/10044/1/9814.
Pełny tekst źródłaWu, Cheng-min. "Implementing a prioritized logic programming system : thesis". Thesis, View thesis, 2000. http://handle.uws.edu.au:8081/1959.7/188.
Pełny tekst źródłaWu, 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.
Pełny tekst źródła"A thesis submitted for the degree of Master of Science (Honours)-Computing at University of Western Sydney - Nepean" Includes bibliographical references (leaves 117-121).
CATTAFI, Massimiliano. "LOGIC AND CONSTRAINT PROGRAMMING FOR COMPUTATIONAL SUSTAINABILITY". Doctoral thesis, Università degli studi di Ferrara, 2012. http://hdl.handle.net/11392/2388775.
Pełny tekst źródłaAZZOLINI, DAMIANO. "Extensions and Applications of Probabilistic Logic Programming". Doctoral thesis, Università degli studi di Ferrara, 2022. http://hdl.handle.net/11392/2478826.
Pełny tekst źródłaSymbolic Artificial Intelligence has been considered ''Good Old-Fashioned Artificial Intelligence'' since it usually represents knowledge through explicit symbols, such as first-order logic predicates and constants, instead of through large numeric matrices, as happens for sub-symbolic solutions, namely, neural networks. Despite the recent predominance of neural networks, considered almost a silver bullet for solving every machine learning problem, there is still an ever-growing field of research called Statistical Relational Artificial Intelligence, where the goal is to combine logic and uncertainty to represent and reason over complex domains. Among all the several possible formalisms, Probabilistic Logic Programming (PLP) is gaining traction thanks to its ability to integrate logical and probabilistic reasoning. The work presented in this dissertation is structured in two parts. In the first, we present several extensions of PLP to widen the possible application scenarios. In particular, we review hybrid probabilistic logic programs, where continuous and discrete random variables coexist, and provide a new well-defined semantics. After this, we introduce probabilistic abductive logic programs, where we extend PLP with the possibility to reason with incomplete data, and probabilistic optimizable and reducible logic programs, where we leverage constraint programming to learn the parameters and the structure of probabilistic logic programs subject to constraints. The definition of these new classes is motivated by real-world examples discussed in the correspondent chapters. For all of these proposals, we formally introduce the task to solve and provide practical inference algorithms. The second part is focused on the adoption of PLP and hybrid probabilistic logic programs to model several blockchain-related scenarios. We discuss models to analyse transaction fees, smart contracts, double spending, and the Lightning Network.
Farrow, P. F. "Logic, dependencies, and specification engineering". Thesis, University of Southampton, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.328298.
Pełny tekst źródłaDuan, 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.
Pełny tekst źródłaWong, Ka-Shu Computer Science & 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.
Pełny tekst źródłaPadmanabhuni, 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.
Pełny tekst źródłaMelendez, 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.
Pełny tekst źródłaALVES, 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.
Pełny tekst źródłaThe use of declarative languages based in logic programming has been spread out due to the great interest in Artificial Intelligence. However, the use of these languages is not evident yet due to performance, portability, integration to other languages capability and other restrictions. This work contains the definition and implementation of a logic programming extension for C called Clog, which intends to cover the above deficiencies, allowing, mainly, the implementation of applications that have logic programming characteristics integrated to interative programming in the same development environment.
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.
Pełny tekst źródłaEsta 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, chamada Máquina LispLog, e de seu compilador. A utilização desta linguagem é possível através do Sistema LispLog, que fornece um ambiente de programação orientado por menus.
This dissertation shows an integration between the function programming and logic programming, achieved through LispLog Language’s definition and implementation. In this new language the resultant of a resolution may be used as an argument of a function (through metalisp operator) and the result of a function’s avaliation may be linked to a logic variable (through avalia operator). The LispLog Language was constructed by a simulation of stack architecture machine, named LispLog Machine, and its compiler, in a microcomputer similar similar to IBM-PC. The LispLog System provides a programming environment oriented by menus, wich makes possible the use of this language
Fuller, David Alfredo. "Partial evaluation and mix computation in logic programming". Thesis, Imperial College London, 1989. http://hdl.handle.net/10044/1/47442.
Pełny tekst źródłaSchild, Uri Jakob. "Open-textured law, expert systems and logic programming". Thesis, Imperial College London, 1990. http://hdl.handle.net/10044/1/46539.
Pełny tekst źródła