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

Dissertations / Theses on the topic 'Logic and language'

Author: Grafiati
Published: 4 June 2021
Last updated: 21 June 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 and language.'

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

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 primitive predicate which evaluates a Prolog structure on a newly forked thread. Communication between threads is based on the unification of variables contained in such a structure. It is also possible for threads to communicate through a globally accessible table. All of the new features are available to the programmer through new built-in Prolog predicates. We present three case studies. The first is an application which allows several users to modify a database. The users are able to disconnect from the database and to modify their own copies of the data before reconnecting. On reconnecting, conflicts must be resolved. The second is an object-oriented assistant, which allows the user to query the contents of a C# namespace or Java package. The third is a tool which allows a user to interact with a graphical display of the inheritance tree. Finally, we optimize P#'s runtime speed by translating some Prolog predicates into more idiomatic C# code than is produced by a naive port of Prolog Cafe. This is achieved by observing that semi-deterministic predicates (being those which always either fail or succeed with exactly one solution) that only call other semi-deterministic predicates enjoy relatively simple control flow. We make use of the fact that Prolog programs often contain predicates which operate as functions, and that such predicates are usually semi-deterministic.
APA, Harvard, Vancouver, ISO, and other styles
2

Mezzadri, Daniele. "Language and logic in Wittgenstein's Tractatus Logico-Philosophicus." Thesis, University of Stirling, 2010. http://hdl.handle.net/1893/2432.

Full text
Abstract:
This thesis discusses some central aspects of Wittgenstein’s conception of language and logic in his Tractatus Logico-Philosophicus and brings them into relation with the philosophies of Frege and Russell. The main contention is that a fruitful way of understanding the Tractatus is to see it as responding to tensions in Frege’s conception of logic and Russell’s theory of judgement. In the thesis the philosophy of the Tractatus is presented as developing from these two strands of criticism and thus as the culmination of the philosophy of logic and language developed in the early analytic period. Part one examines relevant features of Frege’s philosophy of logic. Besides shedding light on Frege’s philosophy in its own right, it aims at preparing the ground for a discussion of those aspects of the Tractatus’ conception of logic which derive from Wittgenstein’s critical response to Frege. Part two first presents Russell’s early view on truth and judgement, before considering several variants of the multiple relation theory of judgement, devised in opposition to it. Part three discusses the development of Wittgenstein’s conception of language and logic, beginning with Wittgenstein’s criticism of the multiple relation theory and his early theory of sense, seen as containing the seeds of the picture theory of propositions presented in the Tractatus. I then consider the relation between Wittgenstein’s pictorial conception of language and his conception of logic, arguing that Wittgenstein’s understanding of sense in terms of bipolarity grounds his view of logical complexity and of the essence of logic as a whole. This view, I show, is free from the internal tensions that affect Frege’s understanding of the nature of logic.
APA, Harvard, Vancouver, ISO, and other styles
3

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
4

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
5

Lucas, R. J. "A logic language as a database utility." Thesis, Coventry University, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.377552.

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

Gally, Tom. "On the Limitations of Language and Logic." 名古屋大学教養教育院, 2013. http://hdl.handle.net/2237/21057.

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

McCabe, Francis Gregory Christopher. "Logic and objects : language, application and implementation." Thesis, Imperial College London, 1989. http://hdl.handle.net/10044/1/47568.

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

Murakami, Yuko. "Modal logic of partitions." [Bloomington, Ind.] : Indiana University, 2005. http://wwwlib.umi.com/dissertations/fullcit/3162977.

Full text
Abstract:
Thesis (Ph.D.)--Indiana University, Dept. of Philosophy, 2005.<br>Title from PDF t.p. (viewed Dec. 2, 2008). Source: Dissertation Abstracts International, Volume: 66-02, Section: A, page: 0620. Chairs: Lawrence Moss; Michael Dunn.
APA, Harvard, Vancouver, ISO, and other styles
9

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.

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

Collett, Guillaume. "Constructivism and language Deleuze's onto-logic of sense." Thesis, University of Kent, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.654092.

Full text
Abstract:
This thesis argues for a constructivist reading of Gilles Deleuze's early philosophy. In the introduction I outline why I consider Deleuze's philosophical project - from the 1950s to the 1990s - to centre on the problem of immanence (the "plane of immanence"), which for Deleuze is inseparable from its "construction" by various means, including language. The term "onto-logic" is used to capture this notion of immanence as constructed by language, and I claim that "univocal sense" is the name of this immanence during Deleuze' s 1960s works. In Part I, I then show in detail how Deleuze derives his conception of univocal sense from the work of - principally - Nietzsche and Spinoza. I propose that Nietzsche's and Spinoza's critiques of the forms of Man and God are marshalled and transformed by Deleuze, offering a third alternative to the deadlock: either transcendental critique or pre-critical metaphysics. I also show that Deleuze's reading of Spinoza, and Bergson, entails a provisional dualism of Being and Thinking giving way to a monism, thanks to a constructivist "logic" of expression, which is where I locate the original site of Deleuze's "plane of immanence" . In Part Il, I extend this framework to the specific terrain of Deleuze's engagement with the structuralist paradigm - particularly in the guise of Lacanian psychoanalysis - in his texts from the late 1960s, especially The Logic of Sense. I show through detailed analysis how Deleuze constructs a theory of language in this text, a theory which uses the tools of structuralism and psychoanalysis to argue that - thanks to the psychoanalytic "phantasm" - corporeal bodies and the ideal propositional forms of language co-articulate to express univocal sense. The univocal sense expressed by the phantasm merges the dualism of bodies and language ~ Being and Thinking - which produced sense as their own surfaceeffect, a veritable case of Deleuzian immanence.
APA, Harvard, Vancouver, ISO, and other styles
11

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
12

Drew, A. M. "Logic and language in John of Salisbury's 'Metalogicon'." Thesis, University of Cambridge, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.373246.

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

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, 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.<br>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
APA, Harvard, Vancouver, ISO, and other styles
14

Rocktaschel, Tim. "Combining representation learning with logic for language processing." Thesis, University College London (University of London), 2018. http://discovery.ucl.ac.uk/10040845/.

Full text
Abstract:
The current state-of-the-art in many natural language processing and automated knowledge base completion tasks is held by representation learning methods which learn distributed vector representations of symbols via gradient based optimization. They require little or no hand-crafted features, thus avoiding the need for most preprocessing steps and task-specific assumptions. However, in many cases representation learning requires a large amount of annotated training data to generalize well to unseen data. Such labeled training data is provided by human annotators who often use formal logic as the language for specifying annotations. This thesis investigates different combinations of representation learning methods with logic for reducing the need for annotated training data, and for improving generalization. We introduce a mapping of function-free first-order logic rules to loss functions that we combine with neural link prediction models. Using this method, logical prior knowledge is directly embedded in vector representations of predicates and constants. We find that this method learns accurate predicate representations for which no or little training data is available, while at the same time generalizing to other predicates not explicitly stated in rules. However, this method relies on grounding first-order logic rules, which does not scale to large rule sets. To overcome this limitation, we propose a scalable method for embedding implications in a vector space by only regularizing predicate representations. Subsequently, we explore a tighter integration of representation learning and logical deduction. We introduce an end-to-end differentiable prover – a neural network that is recursively constructed from Prolog’s backward chaining algorithm. The constructed network allows us to calculate the gradient of proofs with respect to symbol representations and to learn these representations from proving facts in a knowledge base. In addition to incorporating complex first-order rules, it induces interpretable logic programs via gradient descent. Lastly, we propose recurrent neural networks with conditional encoding and a neural attention mechanism for determining the logical relationship between two natural language sentences.
APA, Harvard, Vancouver, ISO, and other styles
15

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
16

Groves, Teddy. "Let's reappraise Carnapian inductive logic!" Thesis, University of Kent, 2015. https://kar.kent.ac.uk/54023/.

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

King, James Douglass, and University of Lethbridge Faculty of Arts and Science. "On diagonal argument, Russell absurdities and an uncountable notion of lingua characterica." Thesis, Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2004, 2004. http://hdl.handle.net/10133/225.

Full text
Abstract:
There is an interesting connection between cardinality of language and the distinction of lingua characterica from calculus rationator. Calculus-type languages have only a countable number of sentences, and only a single semantic valuation per sentence. By contrast, some of the sentences, and only a single semantic valuation per sentence. By contrast, some of the sentences of a lingua have available an uncountable number of semantic valuations. Thus, the lingua-type of language appears to have a greater degree of semantic universality than that of a calculus. It is suggested that the present notion of lingua provides a platform for a theory of ambiguity, whereby single sentences may have multiply - indeed, uncountably - many semantic valuations. It is further suggested that this might lead to a pacification of paradox. This thesis involves Peter Aczel's notion of a universal syntax, Russell's question, Keith Simmons' theory of diagonal argument, Curry's paradox, and a 'Leibnizian' notion of language.<br>vii, 111 leaves ; 29 cm.
APA, Harvard, Vancouver, ISO, and other styles
18

Loomis, Eric John. "Meaning, generality, and rules : language and logic in the later Wittgenstein /." Digital version accessible at:, 1999. http://wwwlib.umi.com/cr/utexas/main.

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

Nogueira, Vitor Beires. "Temporal reasoning in a logic programming language with modularity." Doctoral thesis, Universidade de Évora, 2008. http://hdl.handle.net/10174/11138.

Full text
Abstract:
Actualmente os Sistemas de Informação Organizacionais (SIO) lidam cada vez mais com informação que tem dependências temporais. Neste trabalho concebemos um ambiente de trabalho para construir e manter SIO Temporais. Este ambiente assenta sobre um linguagem lógica denominada Temporal Contextua) Logic Programming que integra modularidade com raciocínio temporal fazendo com que a utilização de um módulo dependa do tempo do contexto. Esta linguagem é a evolução de uma outra, também introduzida nesta tese, que combina Contextua) Logic Programming com Temporal Annotated Constraint Logic Programming, na qual a modularidade e o tempo são características ortogonais. Ambas as linguagens são formalmente discutidas e exemplificadas. As principais contribuições do trabalho descrito nesta tese incluem: • Optimização de Contextua) Logic Programming (CxLP) através de interpretação abstracta. • Sintaxe e semântica operacional para uma linguagem que combina de um modo independente as linguagens Temporal Annotated Constraint Logic Programming (TACLP) e CxLP. É apresentado um compilador para esta linguagem. • Linguagem (sintaxe e semântica) que integra de um modo inovador modularidade (CxLP) com raciocínio temporal (TACLP). Nesta linguagem a utilização de um dado módulo está dependente do tempo do contexto. É descrito um interpretador e um compilador para esta linguagem. • Ambiente de trabalho para construir e fazer a manutenção de SIO Temporais. Assenta sobre uma especificação revista da linguagem ISCO, adicionando classes e manipulação de dados temporais. É fornecido um compilador em que a linguagem resultante é a descrita no item anterior. ABSTRACT- Current Organisational Information Systems (OIS) deal with more and more Infor-mation that, is time dependent. In this work we provide a framework to construct and maintain Temporal OIS. This framework builds upon a logical language called Temporal Contextual. Logic Programming that deeply integrates modularity with tem-poral reasoning making the usage of a module time dependent. This language is an evolution of another one, also introduced in this thesis, that combines Contextual Logic Programming with Temporal Annotated Constraint Logic Programming where modularity and time are orthogonal features. Both languages are formally discussed and illustrated. The main contributions of the work described in this thesis include: • Optimisation of Contextual Logic Programming (CxLP) through abstract interpretation. • Syntax and operational semantics for an independent combination of the temporal framework Temporal Annotated Constraint Logic Programming (TACLP) and CxLP. A compiler for this language is also provided. • Language (syntax and semantics) that integrates in a innovative way modularity (CxLP) with temporal reasoning (TACLP). In this language the usage of a given module depends of the time of the context. An interpreter and a compiler for this language are described. • Framework to construct and maintain Temporal Organisational Information Systems. It builds upon a revised specification of the language ISCO, adding temporal classes and temporal data manipulation. A compiler targeting the language presented in the previous item is also given.
APA, Harvard, Vancouver, ISO, and other styles
20

Pareschi, Remo. "Type-driven natural language analysis." Thesis, University of Edinburgh, 1988. http://hdl.handle.net/1842/19215.

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

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
22

Nerbonne, John A. "German temporal semantics three-dimensional tense logic and a GPSG fragment /." New York : Garland Pub, 1985. http://books.google.com/books?id=pMRbAAAAMAAJ.

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

Brien, Stephen. "A logic and model for the Z standard." Thesis, University of Oxford, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.326076.

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

Besson, Corine. "Language and existence : on a new application of free logic." Thesis, University of Oxford, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.432111.

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

Gregory, S. "Design, application and implementation of a parallel logic programming language." Thesis, Imperial College London, 1985. http://hdl.handle.net/10044/1/37712.

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

Hussain, Faraz. "Enhancing a behavioral interface specification language with temporal logic features." [Ames, Iowa : Iowa State University], 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
27

Dahlstedt, Olle. "On a fuzzy scientific language." Thesis, Uppsala universitet, Filosofiska institutionen, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-413850.

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

Tagliaferri, Mirko. "A Logical Language for Computational Trust." Doctoral thesis, Urbino, 2019. http://hdl.handle.net/11576/2666335.

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

Zulaica, Hernandez Iker. "Demonstrative pronouns in Spanish a discourse-based study /." Columbus, Ohio : Ohio State University, 2007. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1196826616.

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

Jackson, E. P. "A representation language based on a game-theoretic interpretation of logic." Thesis, University of Leeds, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.376515.

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

King, Andrew Christopher. "Language, logic and ethics : a study of the Tractatus Logico-Philosophicus and its impact on Wittgenstein's subsequent thought." Thesis, University of Cambridge, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.620689.

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

Silvia, Gilezan. "Intersection types in lambda calculus and logic." Phd thesis, Univerzitet u Novom Sadu, Prirodno-matematički fakultet u Novom Sadu, 1993. https://www.cris.uns.ac.rs/record.jsf?recordId=73293&source=NDLTD&language=en.

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

Lauser, Alexander [Verfasser], and Volker [Akademischer Betreuer] Diekert. "Formal language theory of logic fragments / Alexander Lauser. Betreuer: Volker Diekert." Stuttgart : Universitätsbibliothek der Universität Stuttgart, 2015. http://d-nb.info/1066239460/34.

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

Mercer, Robert Ernest. "A default logic approach to the derivation of natural language presuppositions." Thesis, University of British Columbia, 1987. http://hdl.handle.net/2429/27457.

Full text
Abstract:
A hearer's interpretation of the meaning of an utterance consists of more than what is conveyed by just the sentence itself. Other parts of the meaning are produced as inferences from three knowledge sources: the sentence itself, knowledge about the world, and knowledge about language use. One inference of this type is the natural language presupposition. This category of inference is distinguished by a number of features: the inferences are generated only, but not necessarily, if certain lexical or syntactic environments are present in the uttered sentence; normal interpretations of these presuppositional environments in the scope of a negation in a simple sentence produce the same inferences as the unnegated environment; and the inference can be cancelled by information in the conversational context. We propose a method for deriving presuppositions of natural language sentences that has its foundations in an inference-based concept of meaning. Whereas standard (monotonic) forms of reasoning are able to capture portions of a sentence's meaning, such as its entailments, non-monotonic forms of reasoning are required to derive its presuppositions. Gazdar's idea of presuppositions being consistent with the context, and the usual connection of presuppositions with lexical and syntactic environments motivates the use of Default Logic as the formal nonmonotonic reasoning system. Not only does the default logic approach provide a natural means to represent presuppositions, but also a single (slightly restricted) default proof procedure is all that is required to generate the presuppositions. The naturalness and simplicity of this method contrasts with the traditional projection methods. Also available to the logical approach is the proper treatment of 'or' and 'if ... then ...' which is not available to any of the projection methods. The default logic approach is compared with four others, three projection methods and one non-projection method. As well as serving the function of demonstrating empirical and methodological difficulties with the other methods, the detailed investigation also provides the motivation for the topics discussed in connection with default logic approach. Some of the difficulties have been solved using the default logic method, while possible solutions for others have only been sketched. A brief discussion of a new method for providing corrective answers to questions is presented. The novelty of this method is that the corrective answers are viewed as correcting presuppositions of the answer rather than of the question.<br>Science, Faculty of<br>Computer Science, Department of<br>Graduate
APA, Harvard, Vancouver, ISO, and other styles
35

Jelly, Innes E. "A parallel process model and architecture for a Pure Logic Language." Thesis, Sheffield Hallam University, 1990. http://shura.shu.ac.uk/8778/.

Full text
Abstract:
The research presented in this thesis has been concerned with the use of parallel logic systems for the implementation of large knowledge bases. The thesis describes proposals for a parallel logic system based on a new logic programming language, the Pure Logic Language. The work has involved the definition and implementation of a new logic interpreter which incorporates the parallel execution of independent OR processes, and the specification and design of an appropriate non shared memory multiprocessor architecture. The Pure Logic Language which is under development at JeL, Bracknell, differs from Prolog in its expressive powers and implementation. The resolution based Prolog approach is replaced by a rewrite rule technique which successively transforms expressions according to logical axioms and user defined rules until no further rewrites are possible. A review of related work in the field of parallel logic language systems is presented. The thesis describes the different forms of parallelism within logic languages and discusses the decision to concentrate on the efficient implementation of OR parallelism. The parallel process model for the Pure Logic Language uses the same execution technique of rule rewriting but has been adapted to implement the creation of independent OR processes and the required message passing operations. The parallelism in the system is implemented automatically and, unlike many other parallel logic systems there are no explicit program annotations for the control of parallel execution. The spawning of processes involves computational overheads within the interpreter: these have been measured and results are presented. The functional requirements of a multiprocessor architecture are discussed: shared memory machines are not scalable for large numbers of processing elements, but, with no shared memory, data needed by offspring processors must be copied from the parent or else recomputed. The thesis describes an optimised format for the copying of data between processors. Because a one-to-many communication pattern exits between parent and offspring processors a broadcast architecture is indicated. The development of a system based on the broadcasting of data packets represents a new approach to the parallel execution of logic languages and has led to the design of a novel bus based multiprocessor architecture. A simulation of this multiprocessor architecture has been produced and the parallel logic interpreter mapped onto it: this provides data on the predicted performance of the system. A detailed analysis of these results is presented and the implications for future developments to the proposed system are discussed.
APA, Harvard, Vancouver, ISO, and other styles
36

Cheng, A. S. K. "An OR parallel logic programming language : its compiler and abstract machine." Thesis, University of Essex, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.233029.

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

Gurr, Corin Alistair. "A self-applicable partial evaluator for the logic programming language Goedel." Thesis, University of Bristol, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.385689.

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

Sturla, Giancarlo (Giancarlo F. ). "A two-phased approach for natural language parsing into formal logic." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/113294.

Full text
Abstract:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 53-56).<br>Natural language is an intuitive medium for a human to communicate with a robot. Additionally, there are many tasks in areas such as manufacturing, military, and disaster response where communication is limited among the agents performing these tasks. Due to this limited communication, we focus on a protocol where most of the communication is done before and after the mission execution. As a first step in analyzing the effectiveness of this protocol, this thesis presents a two-phased approach to parsing natural language into an arbitrary formal logic. In the first phase, we aim to learn the generic structure of the logical expression associated with a natural language utterance. For example, if the sentence "Approach the target from the west" were to be parsed into the expression Approach(target;west), then the first phase would output a generic structure such as f(c0; c1), where f, c0, and c1 are placeholders for the actual values Approach, target, and west, respectively. In the second phase, we aim the learn how to assign the intended values to these placeholders. The method developed in this thesis is able to achieve an accuracy of 46% and 78% for the first and second phase of our natural language parser, respectively. With the help of our natural language parser, we can use the outputted logical expressions in future work to help in the analysis of the mission execution's success or failure.<br>by Giancarlo Sturla.<br>M. Eng.
APA, Harvard, Vancouver, ISO, and other styles
39

Downen, Paul. "Sequent Calculus: A Logic and a Language for Computation and Duality." Thesis, University of Oregon, 2017. http://hdl.handle.net/1794/22659.

Full text
Abstract:
Truth and falsehood, questions and answers, construction and deconstruction; most things come in dual pairs. Duality is a mirror that reveals the new from the old via opposition. This idea appears pervasively in logic, where duality inverts "true" with "false" and "and" with "or." However, even though programming languages are closely connected to logics, this kind of strong duality is not so apparent in practice. Sum types (disjoint tagged unions) and product types (structures) are dual concepts, but in the realm of programming, natural biases obscure their duality. To better understand the role of duality in programming, we shift our perspective. Our approach is based on the Curry-Howard isomorphism which says that programs following a specification are the same as proofs for mathematical theorems. This thesis explores Gentzen's sequent calculus, a logic steeped in duality, as a model for computational duality. By applying the Curry-Howard isomorphism to the sequent calculus, we get a language that combines dual programming concepts as equal opposites: data types found in functional languages are dual to co-data types (interface-based objects) found in object-oriented languages, control flow is dual to information flow, induction is dual to co-induction. This gives a duality-based semantics for reasoning about programs via orthogonality: checking safety and correctness based on a comprehensive test suite. We use the language of the sequent calculus to apply ideas from logic to issues relevant to program compilation. The idea of logical polarity reveals a symmetric basis of primitive programming constructs that can faithfully represent all user-defined data and co-data types. We reflect the lessons learned back into a core language for functional languages, at the cost of symmetry, with the relationship between the sequent calculus and natural deduction. This relationship lets us derive a pure lambda calculus with user-defined data and co-data which we further extend by bringing out the implicit control-flow in functional programs. Explicit control-flow lets us share and name control the same way we share and name data, enabling a direct representation of join points, which are essential for tractable optimization and compilation.
APA, Harvard, Vancouver, ISO, and other styles
40

Taing, Austin. "Application of Boolean Logic to Natural Language Complexity in Political Discourse." UKnowledge, 2019. https://uknowledge.uky.edu/cs_etds/77.

Full text
Abstract:
Press releases serve as a major influence on public opinion of a politician, since they are a primary means of communicating with the public and directing discussion. Thus, the public’s ability to digest them is an important factor for politicians to consider. This study employs several well-studied measures of linguistic complexity and proposes a new one to examine whether politicians change their language to become more or less difficult to parse in different situations. This study uses 27,500 press releases from the US Senate between 2004–2008 and examines election cycles and natural disasters, namely hurricanes, as situations where politicians’ language may change. We calculate the syntactic complexity measures clauses per sentence, T-unit length, and complex-T ratio, as well as the Automated Readability Index and Flesch Reading Ease of each press release. We also propose a proof-of-concept measure called logical complexity to find if classical Boolean logic can be applied as a practical linguistic complexity measure. We find that language becomes more complex in coastal senators’ press releases concerning hurricanes, but see no significant change for those in election cycles. Our measure shows similar results to the well-established ones, showing that logical complexity is a useful lens for measuring linguistic complexity.
APA, Harvard, Vancouver, ISO, and other styles
41

Stehr, Mark-Oliver. "Programming, specification and interactive theorem proving towards a unified language based on equational logic, rewriting logic and type theory /." [S.l. : s.n.], 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=965649423.

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

Boyd, Richard Victor 1942. "PLAN GENERATION AND PROLOG (LOGIC, DECLARATIVE, WARPLAN)." Thesis, The University of Arizona, 1986. http://hdl.handle.net/10150/291278.

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

Roberts, Lesley. "Towards a probabilistic semantics for natural language /." [St. Lucia, Qld.], 2003. http://www.library.uq.edu.au/pdfserve.php?image=thesisabs/absthe18482.pdf.

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

Pierpoint, Alan S. "Logic: The first term revisited." CSUSB ScholarWorks, 1995. https://scholarworks.lib.csusb.edu/etd-project/480.

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

Salim, Juliani Susanti. "An expert system shell for processing logic grammars." Thesis, University of British Columbia, 1985. http://hdl.handle.net/2429/24912.

Full text
Abstract:
Many expert systems have been developed over the past decades. ProGrammar is a modest expert system shell that has been developed recently. It is built on top of the CProlog/UNIX* system running on a VAX† 11/750. ProGrammar is designed for processing and developing grammars. It can also be used as a knowledge base constructor for other fields besides grammars, a learning tool, a Prolog interpreter, and as a consulting system. ProGrammar is an interactive system meaning not only can the user query ProGrammar but ProGrammar also can question the user. The user is allowed to request an explanation from the ProGrammar on how the solution to the query was derived.<br>Science, Faculty of<br>Computer Science, Department of<br>Graduate
APA, Harvard, Vancouver, ISO, and other styles
46

Cardoso, Tuscani. "The book and the rhizome : the implications of and alternatives to linear logic, with special reference to artist books." Thesis, Stellenbosch : Stellenbosch University, 2015. http://hdl.handle.net/10019.1/96908.

Full text
Abstract:
Thesis (MA)--Stellenbosch University, 2015.<br>ENGLISH ABSTRACT: This thesis entails an explorative and argumentative study that is concerned with the importance and relevance of artist books, as substantiated by art-historical research into the way in which people present, organize and interpret knowledge about their world as observed in the history of the ever-evolving book; as well as related critical and theoretical discussions surrounding language and art. The structure of the thesis is based on the triadic treatment of book types as presented in philosophers Deleuze and Guattari’s theory of the Rhizome in A Thousand Plateaus: Capitalism and Schizophrenia (1987). Each book essentially stands for a particular system or paradigm of thought that is described in terms of a biological structure. These are the Root book, the Fascicular book and the Rhizome. The root and fascicular structures are shown to be ubiquitous within dominant Western habits of thought, emphasised by the tendency to organize elements around a singular, central motif and, as a result, to create binaries. Although useful for certain practices in life, these patterns of thought have potentially problematic socio-political implications, and they are especially limiting with regards to creative work. An argument is developed in defence of the third book type, the rhizome, as a means of thinking in a non-linear, acentred and more complex and connected way about art, oneself and one’s world. At its core, this thesis works towards establishing a theoretical framework for the practice of artist books, showing how, in numerous ways, artist books encompass this rhizomatic way of thinking.<br>AFRIKAANSE OPSOMMING: Hierdie tesis omvat ’n verkennende en argumentatiewe studie wat gemoeid is met die belang en relevansie van kunstenaarsboeke, soos gestaaf deur kunsgeskiedkundige navorsing oor die maniere waarop mense kennis aanbied, organiseer en vertolk, soos dit in die geskiedenis van die altyd-veranderende boek gesien word. Die tesis sluit ook verwante kritiese en teoretiese besprekings rondom taal en kuns in. Die struktuur van die tesis gebruik as basis die drievoudige indeling van boektipes in die *losowe Deleuze en Guattari se teorie van die Risoom in hulle werk A Thousand Plateaus: Capitalism and Schizophrenia (1987). Elke boek verteenwoordig in essensie ’n bepaalde sisteem of paradigma van denke wat in terme van ’n biologiese struktuur beskryf word. Die drie tipes is die Wortelboek, die Fassikulêre of Trosboek, en die Risoom. Die wortel- en trosstrukture word uitgewys as alomteenwoordig binne dominante Westerse denkgewoontes, waar dit beklemtoon word deur die geneigdheid om elemente rondom ’n enkele sentrale motief te organiseer, en sodoende binêre opposisies te vorm. Alhoewel dit nuttig mag wees vir sekere lewenspraktyke, hou hierdie denkpatrone potensieel problematiese sosio-politiese implikasies in, en hulle is besonder beperkend vir kreatiewe werk. Die tesis ontwikkel verder ’n argument ter verdediging van die derde boektipe, die risoom, as ’n wyse om op ’n nie-lineêre, a-sentriese en meer komplekse en verbonde manier oor kuns, die self en die wêreld te dink. Die kern van die tesis is gemoeid met die vestiging van ’n teoretiese raamwerk vir die praktyk van kunstenaarsboeke, en dit wys hoe kunstenaarsboeke op velerlei maniere die risomatiese wyse van denke omvat.
APA, Harvard, Vancouver, ISO, and other styles
47

McNamara, Brian. "Multiparadigm programming novel devices for implementing functional and logic programming constructs in C++ /." Diss., Available online, Georgia Institute of Technology, 2004:, 2004. http://etd.gatech.edu/theses/available/etd-07122004-121450/unrestricted/mcnamara%5Fbrian%5Fm%5F200407%5Fphd.pdf.

Full text
Abstract:
Thesis (Ph. D.)--College of Computing, Georgia Institute of Technology, 2005. Directed by Yannis Smaragdakis.<br>Spencer Rugaber, Committee Member ; Olin Shivers, Committee Member ; Mary Jean Harrold, Committee Member ; Yannis Smaragdakis, Committee Chair ; Philip Wadler, Committee Member. Includes bibliographical references.
APA, Harvard, Vancouver, ISO, and other styles
48

Vieira, Pinto Rodrigo Lamas. "A logic-based modelling language and integer-programming framework for multicriteria optimisation." Thesis, Imperial College London, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.307518.

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

POLAKOF, ANA CLARA OLIVERA. "EVENTS, FACTS, AND STATES OF AFFAIRS: FROM LOGIC ONTOLOGY TO LANGUAGE USE." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2017. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=31527@1.

Full text
Abstract:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>Esta tese visa propor uma delimitação ontológica entre eventos, fatos e estados de coisas, a partir de uma ontologia realista/platonista, e relacionar a ontologia lógica à linguagem em uso, a partir da análise da referência a essas entidades. Eventos, fatos e estados de coisas têm estado presentes na discussão analítica desde os tempos de Frege; no entanto, a discussão ainda continua. Eventos têm sido reduzidos a objetos, a fatos e a estados de coisas; fatos têm sido reduzidos a estados de coisas e a proposições; estados de coisas e fatos têm sido considerados como a mesma entidade, e assim por diante. Essas três entidades estão associadas à linguagem desde os tempos de Russell (1918). Os fatos eram relacionados às afirmações verdadeiras, sendo compreendidos como as entidades às quais apontavam essas afirmações. Os eventos eram relacionados com as sentenças de ação. De acordo com Davidson (1981a), temos sentenças de ação porque há eventos no mundo. Embora esta tese vise relacionar a ontologia à linguagem em uso, ela as desvincula num primeiro momento; por isso define a ontologia independentemente da linguagem. Propõe que a diferença entre eventos, fatos e estados de coisas é que os primeiros são concretos e os últimos, abstratos, entre outras características. Uma vez definida a ontologia, a relacionamos, a partir da referência, com a linguagem em uso. Analisamos se é possível referir a essas entidades a partir da análise de certas construções linguísticas, e vemos se é possível estabelecer tal relação a partir dessa análise.<br>This thesis proposes an ontological delimitation between events, facts and states of affairs. It does so from a Platonist/realist perspective. It also relates the logic ontology to language use through the analysis of reference to these entities. Events, facts, and states of affairs have been present in the discussion of analytical philosophy from the times of Frege. However, the discussion still continues, and nothing has been defined. Events have been reduced to objects, facts and states of affairs. Facts have been reduced to states of affairs and propositions. States of affairs and facts have been considered as the same entity by some authors, and so forth. These three entities have been associated to language since the times of Russell (1918). Facts were related to true statements, and were understood as entities to which those statements pointed. Events were related to action sentences. According to Davidson (1981a), we have action sentences because there are events in the world. Though this thesis relates ontology to language, it defines ontology independent of language use. That is, ontology is defined without taking language use into account. It proposes that the difference between events, facts, and states of affairs is that the first are concrete, and the last abstract. Among other characteristics. Once we define the ontology, we relate it to language use through reference. We analyze whether it s possible to refer to events, facts, and states of affairs, because we understand that it is through reference that we may establish the relationship between ontology and linguistics.
APA, Harvard, Vancouver, ISO, and other styles
50

Tse, Clifford Sheung-Ching. "The design and implementation of an actor language based on linear logic." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/12045.

Full text
Abstract:
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.<br>Includes bibliographical references (p. 95-98).<br>by Clifford Sheung-Ching Tse.<br>M.S.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Logic and language' 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