To see the other types of publications on this topic, follow the link: Logic - Reasoning.
Dissertations / Theses on the topic 'Logic - Reasoning'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Logic - Reasoning.'
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
Obeid, Naji. "MIM-Logic : a logic for reasoning about molecular interaction maps." Toulouse 3, 2014. http://thesesups.ups-tlse.fr/2527/.
Full textAbstract:
Les séries de réactions biochimiques apparaissant au cœur d'une cellule forme ce qu'on appelle des voies métaboliques. La plupart de ces voies sont très complexes impliquant un grand nombre de protéines et d'enzymes. Une représentation logique de ces réseaux contribue au raisonnement à propos de ces voies en général, allant du fait de répondre à certaines questions, compléter des arcs et nœuds manquant, et trouver des incohérences. Dans ce contexte on propose un nouveau model logique basé sur un fragment de logique de premier ordre capable de décrire les réactions apparaissant dans des Molecular Interaction Maps. On propose aussi une méthode de déduction automatique efficace capable de répondre aux questions par déduction pour prédire les résultats des réactions et par abduction pour trouver les états des protéines et de leurs réactions. Cette méthode automatique est basée sur une procédure de traduction qui élimine les quantificateurs des formules de logique premier ordreThe series of biochemical reactions that occur within a cell form what we call Metabolic Pathways. Most of them can be quite intricate and involve many proteins and enzymes. Logical representations of such networks can help reason about them in general, where the reasoning can range from answering some queries, to completing missing nodes and arcs, and finding inconsistencies. This work proposes a new logical model based on a fragment of first-order logic capable of describing reactions that appear in a Molecular Interaction Maps. We also propose an efficient automated deduction method that can answer queries by deduction to predict reaction results or by abductive reasoning to find reactions and protein states. This automated deduction method is based on a translation procedure that transforms first-order formulas into quantifier free formulas
2
Raza, Mohammad. "Resource Reasoning and Labelled Separation Logic." Thesis, Imperial College London, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.523755.
Full text
3
Klinov, Pavel. "Practical reasoning in probabilistic description logic." Thesis, University of Manchester, 2011. https://www.research.manchester.ac.uk/portal/en/theses/practical-reasoning-in-probabilistic-description-logic(6aff2ad0-dc76-44cf-909b-2134f580f29b).html.
Full textAbstract:
Description Logics (DLs) form a family of languages which correspond to decidable fragments of First-Order Logic (FOL). They have been overwhelmingly successful for constructing ontologies - conceptual structures describing domain knowledge. Ontologies proved to be valuable in a range of areas, most notably, bioinformatics, chemistry, Health Care and Life Sciences, and the Semantic Web.One limitation of DLs, as fragments of FOL, is their restricted ability to cope with various forms of uncertainty. For example, medical knowledge often includes statistical relationships, e.g., findings or results of clinical trials. Currently it is maintained separately, e.g., in Bayesian networks or statistical models. This often hinders knowledge integration and reuse, leads to duplication and, consequently, inconsistencies.One answer to this issue is probabilistic logics which allow for smooth integration of classical, i.e., expressible in standard FOL or its sub-languages, and uncertain knowledge. However, probabilistic logics have long been considered impractical because of discouraging computational properties. Those are mostly due to the lack of simplifying assumptions, e.g., independence assumptions which are central to Bayesian networks.In this thesis we demonstrate that deductive reasoning in a particular probabilistic DL, called P-SROIQ, can be computationally practical. We present a range of novel algorithms, in particular, the probabilistic satisfiability procedure (PSAT) which is, to our knowledge, the first scalable PSAT algorithm for a non-propositional probabilistic logic. We perform an extensive performance and scalability evaluation on different synthetic and natural data sets to justify practicality.In addition, we study theoretical properties of P-SROIQ by formally translating it into a fragment of first-order logic of probability. That allows us to gain a better insight into certain important limitations of P-SROIQ. Finally, we investigate its applicability from the practical perspective, for instance, use it to extract all inconsistencies from a real rule-based medical expert system.We believe the thesis will be of interest to developers of probabilistic reasoners. Some of the algorithms, e.g., PSAT, could also be valuable to the Operations Research community since they are heavily based on mathematical programming. Finally, the theoretical analysis could be helpful for designers of future probabilistic logics.
4
Hill, Alexandra. "Reasoning by analogy in inductive logic." Thesis, University of Manchester, 2013. https://www.research.manchester.ac.uk/portal/en/theses/reasoning-by-analogy-in-inductive-logic(039622d8-ab3f-418f-b46c-4d4e7a9eb6c1).html.
Full textAbstract:
This thesis investigates ways of incorporating reasoning by analogy into Pure (Unary) Inductive Logic. We start with an analysis of similarity as distance, noting that this is the conception that has received most attention in the literature so far. Chapter 4 looks in some detail at the consequences of adopting Hamming Distance as our measure of similarity, which proves to be a strong requirement. Chapter 5 then examines various adaptations of Hamming Distance and proposes a subtle modification, further-away-ness, that generates a much larger class of solutions.
5
Papacchini, Fabio. "Minimal model reasoning for modal logic." Thesis, University of Manchester, 2015. https://www.research.manchester.ac.uk/portal/en/theses/minimal-model-reasoning-for-modal-logic(dbfeb158-f719-4640-9cc9-92abd26bd83e).html.
Full textAbstract:
Model generation and minimal model generation are useful for tasks such as model checking, query answering and for debugging of logical specifications. Due to this variety of applications, several minimality criteria and model generation methods for classical logics have been studied. Minimal model generation for modal logics how ever did not receive the same attention from the research community. This thesis aims to fill this gap by investigating minimality criteria and designing minimal model generation procedures for all the sublogics of the multi-modal logic S5(m) and their extensions with universal modalities. All the procedures are minimal model sound and complete, in the sense that they generate all and only minimal models. The starting point of the investigation is the definition of a Herbrand semantics for modal logics on which a syntactic minimality criterion is devised. The syntactic nature of the minimality criterion allows for an efficient minimal model generation procedure, but, on the other hand, the resulting minimal models can be redundant or semantically non minimal with respect to each other. To overcome the syntactic limitations of the first minimality criterion, the thesis moves from minimal modal Herbrand models to semantic minimality criteria based on subset-simulation. At first, theoretical procedures for the generation of models minimal modulo subset-simulation are presented. These procedures for the generation of models minimal modulo subset-simulation are minimal model sound and complete, but they might not terminate. The minimality criterion and the procedures are then refined in such a way that termination can be ensured while preserving minimal model soundness and completeness.
6
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 textAbstract:
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 Logic Programming approach and considers the least model of the weak completion of logic programs under the three-valued Łukasiewicz logic.
As the Weak Completion Semantics is relatively new and has not yet been extensively investigated, we first motivate why this approach is interesting for modeling human reasoning. After that, we show the formal correspondence to the already established Stable Model Semantics and Well-founded Semantics. Next, we present an extension with an additional context operator, that allows us to express negation as failure. Finally, we propose a contextual abductive reasoning approach, in which the context of observations is relevant. Some properties do not hold anymore under this extension. Besides discussing the well-known psychological experiments Byrne’s suppression task and Wason’s selection task, we investigate an experiment in spatial reasoning, an experiment in syllogistic reasoning and an experiment that examines the belief-bias effect. We show that the results of these experiments can be adequately modeled under the Weak Completion Semantics. A result which stands out here, is the outcome of modeling the syllogistic reasoning experiment, as we have a higher prediction match with the participants’ answers than any of twelve current cognitive theories.
We present an abstract evaluation system for conditionals and discuss well-known examples from the literature. We show that in this system, conditionals can be evaluated in various ways and we put up the hypothesis that humans use a particular evaluation strategy, namely that they prefer abduction to revision. We also discuss how relevance plays a role in the evaluation process of conditionals. For this purpose we propose a semantic definition of relevance and justify why this is preferable to a exclusively syntactic definition. Finally, we show that our system is more general than another system, which has recently been presented in the literature.
Altogether, this thesis shows one possible path on bridging the gap between Cognitive Science and Computational Logic. We investigated findings from psychological experiments and modeled their results within one formal approach, the Weak Completion Semantics. Furthermore, we proposed a general evaluation system for conditionals, for which we suggest a specific evaluation strategy. Yet, the outcome cannot be seen as the ultimate solution but delivers a starting point for new open questions in both areas.
7
Wong, Paul, and paul wong@anu edu au. "Reasoning with Inconsistent Information." The Australian National University. Research School of Information Sciences and Engineering, 2004. http://thesis.anu.edu.au./public/adt-ANU20090611.152017.
Full textAbstract:
In this thesis we are concerned with developing formal and representational mechanisms for reasoning with inconsistent information. Strictly speaking there are two conceptually distinct senses in which we are interested in reasoning with inconsistent information. In one sense, we are interested in using logical deduction to draw inferences in a symbolic system. More specifically, we are interested in mechanisms that can continue to perform deduction in a reasonable manner despite the threat of inconsistencies as a direct result of errors or misrepresentations. So in this sense we are interested in inconsistency-tolerant or paraconsistent deduction.
¶
However, not every case of inconsistent description is a case of misrepresentation. In many practical situations, logically inconsistent descriptions may be deployed as representations for problems that are inherently conflicting. The issue of error or misrepresentation is irrelevant in these cases. Rather the main concern in these cases is to provide meaningful analyses of the underlying structure and properties of our logical representation which in turn informs us about the salient features of the problem under consideration. So in this second sense, we are interested in deploying logic as a representation to model situations involving conflict.
¶
In this thesis we adopt a novel framework to unify both logic-as-deduction and logic-as-representation approaches to reasoning with inconsistent information. From a preservational view point, we take deduction as a process by which metalogical properties are preserved from premises to conclusions. Thus methodologically we may begin by identifying inconsistency-tolerant deduction mechanisms and then investigate what additional properties of inconsistent premises are preserved by these mechanisms; or alternatively we may begin by identifying properties of inconsistent logical descriptions and investigate which deductive mechanisms can preserve these properties. We view these as two aspects of the same investigation. A key assumption in this work is that adequate analyses of inconsistencies require provisions to quantitatively measure and compare inconsistent logical representations. While paraconsistent logics have enjoyed considerable success in recent years, proper quantitative analysis of inconsistencies seems to have lapsed behind to some extent. In this thesis well explore different ways in which we can compare and measure inconsistencies. We hope to show that both inference and analysis can fruitfully be brought to bear on the issue of inconsistency handling under the same methodological scheme.
8
Horng, Wen-Bing. "Using Extended Logic Programs to Formalize Commonsense Reasoning." Thesis, University of North Texas, 1992. https://digital.library.unt.edu/ark:/67531/metadc278054/.
Full textAbstract:
In this dissertation, we investigate how commonsense reasoning can be formalized by using extended logic programs. In this investigation, we first use extended logic programs to formalize inheritance hierarchies with exceptions by adopting McCarthy's simple abnormality formalism to express uncertain knowledge. In our representation, not only credulous reasoning can be performed but also the ambiguity-blocking inheritance and the ambiguity-propagating inheritance in skeptical reasoning are simulated. In response to the anomalous extension problem, we explore and discover that the intuition underlying commonsense reasoning is a kind of forward reasoning. The unidirectional nature of this reasoning is applied by many reformulations of the Yale shooting problem to exclude the undesired conclusion. We then identify defeasible conclusions in our representation based on the syntax of extended logic programs. A similar idea is also applied to other formalizations of commonsense reasoning to achieve such a purpose.
9
Reul, Quentin H. "Role of description logic reasoning in ontology matching." Thesis, University of Aberdeen, 2012. http://digitool.abdn.ac.uk:80/webclient/DeliveryManager?pid=186278.
Full textAbstract:
Semantic interoperability is essential on the Semantic Web to enable different information systems to exchange data. Ontology matching has been recognised as a means to achieve semantic interoperability on the Web by identifying similar information in heterogeneous ontologies. Existing ontology matching approaches have two major limitations. The first limitation relates to similarity metrics, which provide a pessimistic value when considering complex objects such as strings and conceptual entities. The second limitation relates to the role of description logic reasoning. In particular, most approaches disregard implicit information about entities as a source of background knowledge. In this thesis, we first present a new similarity function, called the degree of commonality coefficient, to compute the overlap between two sets based on the similarity between their elements. The results of our evaluations show that the degree of commonality performs better than traditional set similarity metrics in the ontology matching task. Secondly, we have developed the Knowledge Organisation System Implicit Mapping (KOSIMap) framework, which differs from existing approaches by using description logic reasoning (i) to extract implicit information as background knowledge for every entity, and (ii) to remove inappropriate correspondences from an alignment. The results of our evaluation show that the use of Description Logic in the ontology matching task can increase coverage. We identify people interested in ontology matching and reasoning techniques as the target audience of this work
10
VASCONCELOS, DAVI ROMERO DE. "FIRST-ORDER MODAL LOGIC FOR REASONING ABOUT GAMES." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2007. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=10082@1.
Full textAbstract:
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIORCONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO
O termo jogo tem sido utilizado como uma metáfora, em várias áreas do conhecimento, para modelar e analisar situações onde agentes(jogadores) interagem em ambientes compartilhados para a realização de seus objetivos sejam eles individuais ou coletivos. Existem diversos modelos propostos para jogos por diferentes áreas do conhecimento, tais como matemática, ciência da computação, ciência política e social, entre outras. Dentre as diversas formas de modelar jogos examinamos a Teoria dos Jogos e as lógicas para jogos. Neste trabalho apresentamos uma lógica modal de primeira-ordem baseada na lógica CTL, chamada de Game Analysis nalysis Logic, para raciocinar sobre jogos. Relacionamos os principais modelos da Teoria dos Jogos (jogo estratégico, extensivo, e de coalizão) e seus principais conceitos de soluções(equilíbrio de Nash, equilíbrio de subjogo perfeito,e core) aos modelos de GAL e às fórmulas de GAL, respectivamente. Além disso, estudamos as alternativas de quantificação De Re e De Dicto no contexto dos jogos extensivos, caracterizando o conceito de equilíbrio de Nash e equilíbrio de subjogo perfeito de acordo com as alternativas de quantificação. Relacionamos as lógicas Alternating-time lternating-Tempomporal Logic (A ATL) TL) e Coalitional Game Logic (CGL) com a lógica GAL, demonstrando que ambas as lógicas são fragmentos da lógica GAL. Outro resultado deste trabalho é caracterizar uma classe de sistemas multi- agentes,que é baseada na arquitetura de agentes Belief-Desir Desire- Intention(BDI), para a qual existem jogos extensivos e vice-v versa. Como conseqüência, os critérios de racionalidade da Teoria dos Jogos podem ser aplicados diretamente para agentes BDI e vice-versa. Assim, a abordagem deste trabalho pode ser utilizada para analisar sistemas multi-agentes. Do ponto de vista prático, apresentamos um verificador de modelos para a lógica GAL. Diversos estudos de casos são realizados utilizando o verificador de modelos.
Games are abstract models of decision-making in which decision-makers(players)interact in a shared environment to accomplish their goals. Several models have been proposed to analyze a wide variety of applications in many disciplines such as mathematics, computer science and even political and social sciences among others. In this work, we focus on Game Theory and Game Logics. We present a first-order modal logic based on CTL, namely Game Analysis Logic (GAL), to model and reason about out games. The standard models of Game Theory (strategic games, extensiv games and coalition games) as well as their solution concepts (Nash equilibrium, subgame perfect equilibrium and co re),respectively, are express as models dels of GAL and formulas of GAL. Moreover, we study the alternatives of De Re and De Dicto quantification in the context of extensive games. We also show that two of the most representative game logics, namely Alternating-time lternating-Temp empor oral Logic (A ATL) TL) and Coalitional Game Logic (CGL), are fragments of GAL. We also characterize haracterize a class of multi-agent systems, which is based on the architecture Belief-Desire- Intention (BDI), for which there is a somehow equivalent class of games and vice-versa. As a consequence, criteria of rationality for agents can be directly applied to players and vice-versa. Game analysis formal tools can be applied to MAS as well. From a practical poin of view, we provide and develop a model-checker for GAL. In addition, we perform case studies using our prototype.
11
Gilbert, David Roger. "Specifying and reasoning about concurrent systems in logic." Thesis, Imperial College London, 1990. http://hdl.handle.net/10044/1/46313.
Full text
12
Li, Bai. "Constraint-based reasoning in artificial intelligence." Thesis, University of Nottingham, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.282033.
Full text
13
Toninho, Bernardo Parente Coutinho Fernandes. "A Logic and tool for local reasoning about security protocols." Master's thesis, FCT - UNL, 2009. http://hdl.handle.net/10362/2307.
Full textAbstract:
Trabalho apresentado no âmbito do Mestrado em Engenharia Informática, como requisito parcial para obtenção do grau de Mestre em Engenharia InformáticaThis thesis tackles the problem of developing a formal logic and associated model-checking techniques to verify security properties, and its integration in the Spatial Logic Model Checker(SLMC) tool. In the areas of distributed system design and analysis, there exists a substantial amount of work related to the verification of correctness properties of systems, in which the work aimed at the verification of security properties mostly relies on precise yet informal methods of reasoning. This work follows a line of research that applies formal methodologies to the verification of security properties in distributed systems, using formal tools originally developed for the study of concurrent and distributed systems in general. Over the years, several authors have proposed spatial logics for local and compositional reasoning about algebraic models of distributed systems known as process calculi. In this work, we present a simplification of a process calculus known as the Applied - calculus, introduced by Abadi and Fournet, designed for the study of security protocols. We then develop a spatial logic for this calculus, extended with knowledge modalities, aimed at reasoning about security protocols using the concept of local knowledge of processes. Furthermore, we conclude that the extensions are sound and complete regarding their intended semantics and that they preserve decidability, under reasonable assumptions. We also present a model-checking algorithm and the proof of its completeness for a large class of processes. Finally, we present an OCaml implementation of the algorithm, integrated in the Spatial Logic Model Checker tool, developed by Hugo Vieira and Luis Caires, thus producing the first tool for security protocol analysis that employs spatial logics.
14
Jauregui, Victor Computer Science & Engineering Faculty of Engineering UNSW. "Modalities, conditionals and nonmonotonic reasoning." Publisher:University of New South Wales. Computer Science & Engineering, 2008. http://handle.unsw.edu.au/1959.4/43641.
Full textAbstract:
This dissertation conducts an investigation into nonmonotonic reasoning---forms of reasoning which allow defeasible inferences arrived at in the absence of complete information, and which, when additional information is acquired, may need to be revoked. In contrast to the mathematical notion of consequence which is based on proof---mathematical proofs, once established, are beyond reproach, no matter what additional information is acquired---nonmonotonic forms of reasoning are often employed in Artificial Intelligence, where generally only incomplete information is available, and often 'working' inferences need to be made; e.g. default inferences. The platform on which this analysis of nonmonotonic reasoning is carried out is conditional logic; a relative of modal logic. This thesis explores notions of consequence formulated in conditional logic, and explores its possible-worlds semantics, and its connection to nonmonotonic consequence relations. In particular, the notion of default consequence is explored, receiving the interpretation that something is inferred to be true by default if it holds in a `majority' of possible worlds. A number of accounts of majority-based reasoning appear in the literature. However, it is argued that some of the more well known accounts have counter-intuitive properties. An alternative definition of `majorities' is furnished, and both modal and conditional formulations of this form of inference are given and compared---favourably---with similar approaches in the literature. A second, traditional problem of reasoning in Artificial Intelligence is tackled in this thesis: reasoning about action. The treatment presented is again based on conditional logic, but also incorporates an account of dynamic logic. The semantics proposed approaches the frame problem from a different perspective; the familiar `minimal change' approach is generalised to an account based on the principle known as Occam's Razor. The conditional introduced proves to be a valuable contribution to the account given---which again is compared, and contrasted with other approaches in the literature---accommodating a causal approach to the problem of correctly determining the indirect effects of an action.
15
Schoter, Andreas. "The computational application of bilattice logic to natural reasoning." Thesis, University of Edinburgh, 1996. http://hdl.handle.net/1842/434.
Full textAbstract:
Chapter 1 looks at natural reasoning. It begins by considering the inferences that people make, particularly in terms of how those inferences differ from what is sanctioned by classical logic. I then consider the role of logic in relation to psychology and compare this relationship with the competence/performance distinction from syntax. I discuss four properties of natural reasoning that I believe are key to any theory: specifically partially, paraconsistancy, relevance and defeasibility. I then discuss whether these are semantic properties or pragmatic ones, and conclude by describing a new view of logic and inference prevalent in some contemporary writings. Chapter 2 looks at some of the existing formal approaches to the four properties. For each property I present the basic idea in formal terms, and then discuss a number of systems from the literature. Each section concludes with a brief discussion of the importance of the given property in the field of computation. Chapter 3 develops the formal system used in this thesis. this is an evidential, bilattice-based logic (EBL). I begin by presenting the mathematical preliminaries, and then show how the four properties of natural reasoning can be captured. The details of the logic itself are presented, beginning with the syntax and then moving on to the semantics. The role of pragmatic inferences in the logic is considered and a formal solution is advanced. I conclude by comparing EBL to some of the logics discussed in Chapter 2. Chapter 4 rounds off Part 1 by considering the implementation of the logic and some of it's computational properties. It begins by considering the application of evidential bilattice logic to logic programming; it extends Fitting's work in this area to construct a programming language, QLOG2. I give some examples of this language in use. The QLOG2 language is then used as a part of the implementation of the EBL system itself: I describe the details of this Implementation and then give some examples of the system in use. The chapter concludes by giving an informal presentation of some basic complexity results for logical closure in EBL, based on the given implementation. Chapter 5 presents some interesting data from linguistics that reflects some of the principles of natural reasoning; in particular I concentrate on implicatures and presupposition. I begin by describing the data and then consider a number of approaches from both the logical and the linguistic literature. Chapter 6 uses the logic developed in Chapter 3 to analyse the data presented in Chapter 5. I consider the basic inference cases, and then move on to more complex examples involving contextual interactions. The results are quite successful, and add weight to Mercer's quest for a common logical semantics for entailment and presupposition. All of the examples considered in this chapter can be handled by the implemented system described in Chapter 4. Finally, Chapter 7 rounds off by presenting some further areas of research that have been raised by this investigation. In particular, the issues of quantification and modality are discussed.
16
Hatzilygeroudis, Ioannis. "Integrating logic and objects for knowledge representation and reasoning." Thesis, University of Nottingham, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.334808.
Full text
17
Herre, Heinrich, and Gerd Wagner. "Solving Practical Reasoning Poblems with Extended Disjunctive Logic Programming." Universität Leipzig, 1996. https://ul.qucosa.de/id/qucosa%3A34505.
Full textAbstract:
We present a definition of stable generated models for extended generalized
logic programs (EGLP) which a) subsumes the definition of the answer set semantics for
extended normal logic programs [GL91]; and b) does not refer to negation-as-failure by
allowing for arbitrary quantifier free formulas in the body and in the head of as rule (i.e.
does not depend on the presence of any specific connective, nor any specific syntax of rules).
We show how to solve classical ATP problems in the framework of extended disjunctive
logic programming (EDLP) where neither Contraposition nor the Law of the Excluded Middle
are admitted principles of inference. Besides being able to solve classical ATP problems in
a monotonic reasoning mode, EDLP can as well treat commonsense reasoning problems
by employing its intrinsic nonmonotonic inference capabilities based on stable generated
models. EDLP thus proves itself as a general-purpose AI reasoning system.
18
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 textAbstract:
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.
19
Yule, Peter. "Logic implementation in human reasoning : the psychology of syllogisms." Thesis, University of Edinburgh, 1996. http://hdl.handle.net/1842/26068.
Full textAbstract:
This thesis presents a novel account of syllogistic reasoning, based on data from a non-standard reasoning task called the Individuals Task. An abstract logical treatment of the system, based on a modalised Euler Circles system (Stenning & Oberlander 1994, 1995) is presented, and it is shown that this can be implemented in a diverse range of notationally distinct ways. The Individual Identification Algorithm, as this method is called, makes use of a logical distinction between the premisses of the syllogism; one has an existential, assertive role, and is called the source premiss, whereas the function of the other is to license inference, and so it is called the conditional premiss. This distinction is central to the way the IIA employs modal information to make the use of Euler Circles tractable. The empirical parts of the thesis are concerned with relating the distinction between source and conditional premisses to the Figural Effect (Johnson-Laird & Steedman 1978). It is argued that the Figural Effect is reducible to a tendency for the terms from the source premiss to occur before the terms from the conditional premiss in Individual Conclusions. Sine these are comprised of all three terms in the syllogism, it is possible to test new hypotheses concerning the role of the middle term in inference, and the results are shown to be incompatible with all existing theories of the Figural Effect. Since the Individuals Task is non-standard, it is necessary to compare performance profiles on this task with those on the Standard Task; one result of this comparison is that a primary cause of error in the Standard Task is selection of an appropriate quantifier for the conclusion, a result which concurs with the conclusions of Ford (1994) and Wetherick & Gilhooly (1990), but contradicts those of Mental Models theory (Johnson-Laird 1983). Certain anomalies in the prediction of term order by the source/conditional distinction lead to the postulation of a second process for conclusion generation, called Minimal Linking. This logically unsound strategy has effects similar to the illicit conversion of A premisses (Chapman & Chapman 1959, Revlis 1975).
20
Knorr, Matthias. "Combining open and closed world reasoning for the semantic web." Doctoral thesis, Faculdade de Ciências e Tecnologia, 2011. http://hdl.handle.net/10362/6702.
Full textAbstract:
Dissertação para obtenção do Grau de Doutor
em InformáticaOne important problem in the ongoing standardization of knowledge representation languages for the Semantic Web is combining open world ontology languages, such as the OWL-based ones, and closed world rule-based languages. The main difficulty of such a combination is that both formalisms are quite orthogonal w.r.t. expressiveness and how decidability is achieved. Combining non-monotonic rules and ontologies is thus a challenging task that requires careful balancing between expressiveness of the knowledge representation language and the computational complexity of reasoning. In this thesis, we will argue in favor of a combination of ontologies and nonmonotonic rules that tightly integrates the two formalisms involved, that has a computational complexity that is as low as possible, and that allows us to query for information instead of calculating the whole model. As our starting point we choose the mature approach of hybrid MKNF knowledge bases, which is based on an adaptation of the Stable Model Semantics to knowledge bases consisting of ontology axioms and rules. We extend the two-valued framework of MKNF logics to a three-valued logics, and we propose a well-founded semantics for non-disjunctive hybrid MKNF knowledge bases. This new semantics promises to provide better efficiency of reasoning,and it is faithful w.r.t. the original two-valued MKNF semantics and compatible with both the OWL-based semantics and the traditional Well- Founded Semantics for logic programs. We provide an algorithm based on operators to compute the unique model, and we extend SLG resolution with tabling to a general framework that allows us to query a combination of non-monotonic rules and any given ontology language. Finally, we investigate concrete instances of that procedure w.r.t. three tractable ontology languages, namely the three description logics underlying the OWL 2 pro les.
Fundação para a Ciência e Tecnologia - grant contract SFRH/BD/28745/2006
21
Shearer, Robert D. C. "Scalable reasoning for description logics." Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:d7c4fbf6-4258-4db4-a451-476dcebe68ca.
Full textAbstract:
Description logics (DLs) are knowledge representation formalisms with well-understood model-theoretic semantics and computational properties. The DL SROIQ provides the logical underpinning for the semantic web language OWL 2, which is quickly becoming the standard for knowledge representation on the web. A central component of most DL applications is an efficient and scalable reasoner, which provides services such as consistency testing and classification. Despite major advances in DL reasoning algorithms over the last decade, however, ontologies are still encountered in practice that cannot be handled by existing DL reasoners. We present a novel reasoning calculus for the description logic SROIQ which addresses two of the major sources of inefficiency present in the tableau-based reasoning calculi used in state-of-the-art reasoners: unnecessary nondeterminism and unnecessarily large model sizes. Further, we describe a new approach to classification which exploits partial information about the subsumption relation between concept names to reduce both the number of individual subsumption tests performed and the cost of working with large ontologies; our algorithm is applicable to the general problem of deducing a quasi-ordering from a sequence of binary comparisons. We also present techniques for extracting partial information about the subsumption relation from the models generated by constructive DL reasoning methods, such as our hypertableau calculus. Empirical results from a prototypical implementation demonstrate substantial performance improvements compared to existing algorithms and implementations.
22
Evans, David Hugh. "An investigation of persistence in temporal reasoning." Thesis, Imperial College London, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.267814.
Full text
23
Amini, Majid. "Going native in logic : a psychophilosophical approach to deduction." Thesis, Birkbeck (University of London), 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.312473.
Full textAbstract:
This work is concerned generally with the relationship between logic and psychology, and in particular with the psychophilosophical foundations of deductive reasoning. This is against the recurrent background of logicians and psychologists knowing of the existence of each other but ignoring each others' work. However, cognitive psychology needs logic, not only as all sciences do to ensure coherence and consistency, but as an essential element of a general theory of cognition. This is a substantive claim, yet in its narrower form it highlights the need to study the precise way in which logic enters the theory of cognition. The contention here is that a theory of mental logic may satisfy both requirements: namely, to be the best explanation for everyday deductive reasoning and to offer an insight into the cognitive architecture. The theory maintains that deductive, reasoning consists of operations on internal representations in accordance with logical rules implemented in procedures activated by the forms of mental representation. Thus, the foundations of the logic(s) at which logicians aim, viz. the logical precepts and ideals, must be psychologically real in the sense of being instantiated in some form in the mind. The discussion is organised into three parts. The first part deals with several issues: arguments for and against the centrality of deduction, desiderata for a theory of deductive competence, and taxonomy of reasoning theories and topics. The second part considers the mental logic hypothesis from its inception to its latest formations. It reconstructs the mental logic paradigm and its transition from a general philosophical commonplace to a psychological hypothesis. The third part looks at the philosophical connections and consequences of the mental logic theory. The first connection is with the language of thought: the hypothesis seems naturally to commit itself to a language of thought on whose formulas abstract rules apply. Another connection is with the syntactic theory of mind and the question is whether mental logic is committed to it or not. Among the consequences, the notion of rationality and the significance of deduction for discovery and justification in science are examined
24
Straß, Hannes. "Default Reasoning about Actions." Doctoral thesis, Universitätsbibliothek Leipzig, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-89316.
Full textAbstract:
Action Theories are versatile and well-studied knowledge representation formalisms for modelling dynamic domains. However, traditional action theories allow only the specification of definite world knowledge, that is, universal rules for which there are no exceptions. When modelling a complex domain for which no complete knowledge can be obtained, axiomatisers face an unpleasant choice: either they cautiously restrict themselves to the available definite knowledge and live with a limited usefulness of the axiomatisation, or they bravely model some general, defeasible rules as definite knowledge and risk inconsistency in the case of an exception for such a rule.
This thesis presents a framework for default reasoning in action theories that overcomes these problems and offers useful default assumptions while retaining a correct treatment of default violations. The framework allows to extend action theories with defeasible statements that express how the domain usually behaves. Normality of the world is then assumed by default and can be used to conclude what holds in the domain under normal circumstances. In the case of an exception, the default assumption is retracted, whereby consistency of the domain axiomatisation is preserved.
25
Townsend, Brian E. "Examining secondary students algebraic reasoning flexibility and strategy use /." Diss., Columbia, Mo. : University of Missouri-Columbia, 2005. http://hdl.handle.net/10355/4131.
Full textAbstract:
Thesis (Ph. D.)--University of Missouri-Columbia, 2005.The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file viewed on (November 14, 2006) Vita. Includes bibliographical references.
26
Coghill, George MacLeod. "Mycroft : a framework for constraint based fuzzy qualitative reasoning." Thesis, Heriot-Watt University, 1996. http://hdl.handle.net/10399/1235.
Full text
27
Shi, Shengli. "On reasoning with uncertainty and belief change." Thesis, University of Ulster, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.339316.
Full text
28
Ronel, Tahel. "Symmetry principles in polyadic inductive logic." Thesis, University of Manchester, 2016. https://www.research.manchester.ac.uk/portal/en/theses/symmetry-principles-in-polyadic-inductive-logic(6bd9665b-b236-435c-9aad-7edb3cfc399e).html.
Full textAbstract:
We investigate principles of rationality based on symmetry in Polyadic Pure Inductive Logic. The aim of Pure Inductive Logic (PIL) is to determine how to assign probabilities to sentences of a language being true in some structure on the basis of rational considerations. This thesis centres on principles arising from instances of symmetry for sentences of first-order polyadic languages. We begin with the recently introduced Permutation Invariance Principle (PIP), and find that it is determined by a finite number of permutations on a finite set of formulae. We test the consistency of PIP with established principles of the subject and show, in particular, that it is consistent with Super Regularity. We then investigate the relationship between PIP and the two main polyadic principles thus far, Spectrum Exchangeability and Language Invariance, and discover there are close connections. In addition, we define the key notion of polyadic atoms as the building blocks of polyadic languages. We explore polyadic generalisations of the unary principle of Atom Exchangeability and prove that PIP is a natural extension of Atom Exchangeability to polyadic languages. In the second half of the thesis we investigate polyadic approaches to the unary version of Constant Exchangeability as invariance under signatures. We first provide a theory built on polyadic atoms (for binary and then general languages). We introduce the notion of a signature for non-unary languages, and principles of invariance under signatures, independence, and instantial relevance for this context, as well as a binary representation theorem. We then develop a second approach to these concepts using elements as alternative building blocks for polyadic languages. Finally, we introduce the concepts of homomorphisms and degenerate probability functions in Pure Inductive Logic. We examine which of the established principles of PIL are preserved by these notions, and present a method for reducing probability functions on general polyadic languages to functions on binary languages.
29
Wagner, Gerd. "Vivid logic : knowledge-based reasoning with two kinds of negation /." Berlin [u.a.] : Springer, 1994. http://www.loc.gov/catdir/enhancements/fy0815/93046747-d.html.
Full text
30
Maciel, Adeline Marinho. "Spatiotemporal interval logic for reasoning about land use change dynamics." Instituto Nacional de Pesquisas Espaciais (INPE), 2017. http://urlib.net/sid.inpe.br/mtc-m21b/2017/11.23.13.04.
Full textAbstract:
With the global population growth, the food production will need to rise, potentially causing extensive environmental damage. In Brazil, the demand for farmland is the key immediate driver of land use change, which has influence in public policies. For example, the soy and beef moratorium, that aim at reducing the advance of soybean cropping and pasture areas expansion over the Amazon biome. Currently, Earth observation satellites form part of a comprehensive Earth observation system due to their higher spatial, temporal and spectral resolutions, providing continuous and consistent information about Earths surface. It is the era of big Earth observation data. It has been creating new perspectives in remote sensing data analysis that enable the development of land use and land cover maps at higher spatial resolution and with high temporal frequency. Given this scenery, this thesis introduces a spatiotemporal interval logic mechanism that can be used for reasoning about land use change dynamics, from big Earth observation data systems. The main contribution of this mechanism is to use the concept of events to reason about land use change. Building on this view this thesis extends Allens interval temporal logic to the spatial context, resulting in a formal calculus that allows users to express queries about the land use dynamics. The calculus allows scientists to manipulate large sets of land use data in a flexible way, to understand the environmental and economic effects of land use change. The formalism was applied in three cases studies to identify and quantifying land use transitions in Mato Grosso state in Brazil.Com o crescimento da população mundial, a produção de alimentos precisará aumentar potencialmente causando grandes danos ambientais. No Brasil, a demanda por terras agrícolas é o principal condutor imediato da mudança de uso da terra, que influência políticas públicas. Por exemplo, a moratória da soja e da carne que visam reduzir o avanço da expansão de áreas de cultivo de soja e pastagem sobre o bioma Amazônia. Atualmente, satélites de observação da Terra fazem parte de um sistema abrangente de observação da Terra devido às suas maiores resoluções espaciais, temporais e espectrais, fornecendo informações contínuas e consistentes sobre a superfície terrestre. É a era dos grandes conjuntos de dados de observação da Terra. Isso tem criado novas perspectivas na análise de dados de sensoriamento remoto que permitem o desenvolvimento de mapas de uso e cobertura da terra com maior resolução espacial e com alta frequência temporal. Dado este cenário, esta tese introduz um mecanismo de lógica de intervalo espaço-temporal que pode ser usado para raciocinar sobre as dinâmicas de mudança de uso da terra, a partir de sistemas de grandes conjuntos de dados de observação da Terra. A principal contribuição deste mecanismo é usar o conceito de eventos para raciocinar sobre mudança de uso da terra. Com base nesta perspectiva, essa tese estende a lógica temporal de intervalos de Allen para o contexto espacial, resultando em um cálculo formal que permite usuários expressar consultas sobre a dinâmica de uso da terra. O cálculo permite aos cientistas manipular grandes conjuntos de dados de uso da terra de uma maneira flexível para entender os efeitos ambientais e econômicos da mudança de uso da terra. O formalismo foi aplicado em três estudos de casos para identificar e quantificar transições de uso da terra no estado de Mato Grosso, Brasil.
31
Forti, Maicol. "Logic Reasoning in BDI Agents: Current Trends and Spatial Integrations." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/23426/.
Full textAbstract:
This thesis finds its place in the context of BDI agents and aims to enable a form of situated spatial reasoning.
A survey is proposed in which the possible techniques and technologies that can be integrated into the BDI model to provide a form of spatial reasoning are analyzed.
This review highlights a technological gap that we have therefore decided to fill, with the goal of providing a way to locate logical information in certain spatial areas and to be able to constrain reasoning on them.
In this thesis we propose Geo2p, a technological prototype based on 2P-Kt that allows you to query situated information in tuProlog, enabling a form of spatial reasoning: given a region of space where certain Clauses are valid, a Theory can be defined, constraining the knowledge on what is true in the selected area.
32
Reker, Hilverd Geert. "Tableau-based reasoning for decidable fragments of first-order logic." Thesis, University of Manchester, 2012. https://www.research.manchester.ac.uk/portal/en/theses/tableaubased-reasoning-for-decidable-fragments-of-firstorder-logic(f47e0c7d-399d-48c9-8745-a907c5475f7d).html.
Full textAbstract:
Automated deduction procedures for modal logics, and related decidable fragments of first-order logic, are used in many real-world applications. A popular way of obtaining decision procedures for these logics is to base them on semantic tableau calculi. We focus on calculi that use unification, instead of the more widely employed approach of generating ground instantiations over the course of a derivation. The most common type of tableaux with unification are so-called free-variable tableaux, where variables are treated as global to the entire tableau. A long-standing open problem for procedures based on free-variable tableaux is how to ensure fairness, in the sense that "equivalent" applications of the closure rule are prevented from being done over and over again. Some solutions such as using depth-first iterative deepening are known, but those are unnecessary in theory, and not very efficient in practice. This is a main reason why there are hardly any decision procedures for modal logics based on free-variable tableaux. In this thesis, we review existing work on incorporating unification into first-order and modal tableau procedures, show how the closure fairness problem arises, and discuss existing solutions to it. For the first-order case, we outline a calculus which addresses the closure fairness problem. As opposed to free-variable tableaux, closure fairness is much easier to achieve in disconnection tableaux and similar clausal calculi. We therefore focus on using clausal first-order tableau calculi for decidable classes, in particular the two-variable fragment. Using the so-called unrestricted blocking mechanism for enforcing termination, we present the first ground tableau decision procedure for this fragment. Even for such a ground calculus, guaranteeing that depth-first terminations terminate is highly non-trivial. We parametrise our procedure by a so-called lookahead amount, and prove that this parameter is crucial for determining whether depth-first derivations terminate or not. Extending these ideas to tableaux with unification, we specify a preliminary disconnection tableau procedure which uses a non-grounding version of the unrestricted blocking rule.
33
Chan, Adrian Baihui. "Logic with a literary twist : essays in common law reasoning." Thesis, King's College London (University of London), 2016. http://kclpure.kcl.ac.uk/portal/en/theses/logic-with-a-literary-twist(82ecb4c5-b015-40b8-abdd-7b235283ebe5).html.
Full textAbstract:
What makes a good common law argument? Ronald Dworkin’s answer commands much respect within legal practice. To him, the correctness of a legal conclusion rests upon its capacity to fit within a narrative of normative progress that judges deliberately impose for the sake of (i) rendering overt the shared membership of discretely decided cases within a single determinate category (ii) depictive of moral attractiveness at its best. Yet, the inherent plausibility of Dworkin’s presentation of judicial reasoning has ironically resulted in the erosion of respect for the common law. If judicial narratives are imposed for aesthetic considerations, then legal conclusions must – per Kant – be mere idiosyncratic judicial desires that have the added quality of being objectively intelligible to other individuals who could nonetheless – owing to the absence of any criteria of norm correctness – justifiably disagree. If accurate, this characterization of legal decision-making would be anemic with modernity’s conviction that law is an entity inherently distinguishable from power because of the rationality – and therefore non-dogmatic nature – of its dictates. This thesis demonstrates – contra Dworkin – that judicial narratives go hand-in-hand with rationality. Judicial reasoning is thus of great importance to the aspirational goal of governance through law. As will be seen, only a constructed narrative renders possible the objective demonstrability (i) of the membership of discrete judicial decisions within the classificatory ambit of a specific norm and (ii) the legitimacy of that specific norm’s selection – from a set of countless other possibilities - via its evidential capacity to order those same discrete decisions tentatively asserted to be under its ambit into a coherent whole. Thus, because (i) the narrative is the methodological process by which a norm comes into agreement with its observed applications and (ii) truth is exactly this just-mentioned correspondence between intellect and reality, narrative construction is – quite properly – logic.
34
Gat, Erann. "Reasoning about knowledge using extensional logics." Thesis, Virginia Polytechnic Institute and State University, 1987. http://hdl.handle.net/10919/90971.
Full textAbstract:
When representing statements about knowledge in an extensional logic, it occasionally happens that undesired conclusions arise. Such extraneous conclusions are often the result of substitution of equals for equals or existential instantiation within intensional operators such as Know. In the past, efforts at solving this problem have centered on modifications to the logic. In this thesis, I propose a solution that leaves the logic intact and changes the representation of the statements instead.
The solution presented here has four main points: 1) Only propositions can be known. 2) Relations rather than functions should be used to describe objects. 3) Temporal reasoning is often necessary to represent many real world problems. 4) In cases where more than one label can apply to the same object, an agent's knowledge about labels must be explicitly represented.
When these guidelines are followed, statements about knowledge can be represented in standard first-order predicate logic in such a way that extraneous conclusions cannot be drawn. Standard first-order theorem provers (like Prolog) can then be used to solve problems which involve reasoning about knowledgeM.S.
35
Lee, John Richard. "Metalogic and the psychology of reasoning." Thesis, University of Edinburgh, 1988. http://hdl.handle.net/1842/6625.
Full textAbstract:
The central topic of the thesis is the relationship between logic and the cognitive psychology of reasoning. This topic is treated in large part through a detailed examination of the recent work of P. N. Johnson-Laird, who has elaborated a widely-read and influential theory in the field. The thesis is divided into two parts, of which the first is a more general and philosophical coverage of some of the most central issues to be faced in relating psychology to logic, while the second draws upon this as introductory material for a critique of Johnson-Laird's `Mental Model' theory, particularly as it applies to syllogistic reasoning. An approach similar to Johnson-Laird's is taken to cognitive psychology, which centrally involves the notion of computation. On this view, a cognitive model presupposes an algorithm which can be seen as specifying the behaviour of a system in ideal conditions. Such behaviour is closely related to the notion of `competence' in reasoning, and this in turn is often described in terms of logic. Insofar as a logic is taken to specify the competence of reasoners in some domain, it forms a set of conditions on the 'input-output' behaviour of the system, to be accounted for by the algorithm. Cognitive models, however, must also be subjected to empirical test, and indeed are commonly built in a highly empirical manner. A strain can therefore develop between the empirical and the logical pressures on a theory of reasoning. Cognitive theories thus become entangled in a web of recently much-discussed issues concerning the rationality of human reasoners and the justification of a logic as a normative system. There has been an increased interest in the view that logic is subject to revision and development, in which there is a recognised place for the influence of psychological investigation. It is held, in this thesis, that logic and psychology are revealed by these considerations to be interdetermining in interesting ways, under the general a priori requirement that people are in an important and particular sense rational. Johnson-Laird's theory is a paradigm case of the sort of cognitive theory dealt with here. It is especially significant in view of the strong claims he makes about its relation to logic, and the role the latter plays in its justification and in its interpretation. The theory is claimed to be revealing about fundamental issues in semantics, and the nature of rationality. These claims are examined in detail, and several crucial ones refuted. Johnson- Laird's models are found to be wanting in the level of empirical support provided, and in their ability to found the considerable structure of explanation they are required to bear. They fail, most importantly, to be distinguishable from certain other kinds of models, at a level of theory where the putative differences are critical. The conclusion to be drawn is that the difficulties in this field are not yet properly appreciated. Psychological explantion requires a complexity which is hard to reconcile with the clarity and simplicity required for logical insights.
36
Morris, M. Frances G. "The psychology of information selection and reasoning." Thesis, Bangor University, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.361192.
Full text
37
Joshi, Rejeev. "Immediacy : a technique for reasoning about asynchrony /." Digital version accessible at:, 1999. http://wwwlib.umi.com/cr/utexas/main.
Full text
38
Bell, J. "Predictive conditionals, nonmonotonicity and reasoning about the future." Thesis, University of Essex, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.235132.
Full text
39
Fernández, Gil Oliver. "Adding Threshold Concepts to the Description Logic EL." Doctoral thesis, Universitätsbibliothek Leipzig, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-204523.
Full textAbstract:
We introduce a family of logics extending the lightweight Description Logic EL, that allows us to define concepts in an approximate way. The main idea is to use a graded membership function m, which for each individual and concept yields a number in the interval [0,1] expressing the degree to which the individual belongs to the concept. Threshold concepts C~t for ~ in {<,<=,>,>=} then collect all the individuals that belong to C with degree ~t. We further study this framework in two particular directions. First, we define a specific graded membership function deg and investigate the complexity of reasoning in the resulting Description Logic tEL(deg) w.r.t. both the empty terminology and acyclic TBoxes. Second, we show how to turn concept similarity measures into membership degree functions. It turns out that under certain conditions such functions are well-defined, and therefore induce a wide range of threshold logics. Last, we present preliminary results on the computational complexity landscape of reasoning in such a big family of threshold logics.
40
Martiny, Karsten [Verfasser]. "PDT logic : a probabilistic doxastic temporal logic for reasoning about beliefs in multi-agent systems / Karsten Martiny." Lübeck : Zentrale Hochschulbibliothek Lübeck, 2018. http://d-nb.info/1152030132/34.
Full text
41
Quick, David Arthur. "!-Logic : first order reasoning for families of non-commutative string diagrams." Thesis, University of Oxford, 2015. https://ora.ox.ac.uk/objects/uuid:baf2d50d-8c5f-419d-9b3d-f2f700f8acbd.
Full textAbstract:
Equational reasoning with string diagrams provides an intuitive method for proving equations between morphisms in various forms of monoidal category. !-Graphs were introduced with the intention of reasoning with infinite families of string diagrams by allowing repetition of sub-diagrams. However, their combinatoric nature only allows commutative nodes. The aim of this thesis is to extend the !-graph formalism to remove the restriction of commutativity and replace the notion of equational reasoning with a natural deduction system based on first order logic. The first major contribution is the syntactic !-tensor formalism, which enriches Penrose's abstract tensor notation to allow repeated structure via !-boxes. This will allow us to work with many noncommutative theories such as bialgebras, Frobenius algebras, and Hopf algebras, which have applications in quantum information theory. A more subtle consequence of switching to !-tensors is the ability to definitionally extend a theory. We will demonstrate how noncommutativity allows us to define nodes which encapsulate entire diagrams, without inherently assuming the diagram is commutative. This is particularly useful for recursively defining arbitrary arity nodes from fixed arity nodes. For example, we can construct a !-tensor node representing the family of left associated trees of multiplications in a monoid. The ability to recursively define nodes goes hand in hand with proof by induction. This leads to the second major contribution of this thesis, which is !-Logic (!L). We extend previous attempts at equational reasoning to a fully fledged natural deduction system based on positive intuitionistic first order logic, with conjunction, implication, and universal quantification over !-boxes. The key component of !L is the principle of !-box induction. We demonstrate its application by proving how we can transition from fixed to arbitrary arity theories for monoids, antihomomorphisms, bialgebras, and various forms of Frobenius algebras. We also define a semantics for !L, which we use to prove its soundness. Finally, we reintroduce commutativity as an optional property of a morphism, along with another property called symmetry, which describes morphisms which are not affected by cyclic permutations of their edges. Implementing these notions in the !-tensor language allows us to more easily describe theories involving symmetric or commutative morphisms, which we then demonstrate for recursively defined Frobenius algebra nodes.
42
Ball, Richard A. J. "Consequences and priority in default reasoning : a procedural approach." Thesis, University of Essex, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.361033.
Full text
43
Legge, Gaynor W. "A Mechanism for Facilitating Temporal Reasoning in Discrete Event Simulation." Thesis, University of North Texas, 1992. https://digital.library.unt.edu/ark:/67531/metadc278352/.
Full textAbstract:
This research establishes the feasibility and potential utility of a software mechanism which employs artificial intelligence techniques to enhance the capabilities of standard discrete event simulators. As background, current methods of integrating artificial intelligence with simulation and relevant research are briefly reviewed.
44
Chittleborough, Philip. "Psychological perspectives on the perception, appraisal, and production of everyday arguments /." Title page, table of contents and abstract only, 1999. http://web4.library.adelaide.edu.au/theses/09PH/09phc5441.pdf.
Full text
45
Barnes, Valerie Elizabeth. "The quality of human judgment : an alternative perspective /." Thesis, Connect to this title online; UW restricted, 1985. http://hdl.handle.net/1773/9139.
Full text
46
Percival, P. R. "Infinity, knowability and understanding." Thesis, University of Cambridge, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.384322.
Full text
47
Hogan, Joanne. "Deductive reasoning in Euclidean geometry : an intermediate level unit /." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0008/MQ42396.pdf.
Full text
48
Pandya, Rashmibala. "A multi-layered framework for higher order probabilistic reasoning." Thesis, University of Exeter, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.364432.
Full text
49
Papalaskari, Mary-Angela. "Minimal consequence : a semantic approach to reasoning with incomplete information." Thesis, University of Edinburgh, 1988. http://hdl.handle.net/1842/19214.
Full text
50
Castellini, Claudio. "Automated reasoning in quantified modal and temporal logics." Thesis, University of Edinburgh, 2005. http://hdl.handle.net/1842/753.
Full textAbstract:
This thesis is about automated reasoning in quantified modal and temporal logics, with an application to formal methods. Quantified modal and temporal logics are extensions of classical first-order logic in which the notion of truth is extended to take into account its necessity or equivalently, in the temporal setting, its persistence through time. Due to their high complexity, these logics are less widely known and studied than their propositional counterparts. Moreover, little so far is known about their mechanisability and usefulness for formal methods. The relevant contributions of this thesis are threefold: firstly, we devise a sound and complete set of sequent calculi for quantified modal logics; secondly, we extend the approach to the quantified temporal logic of linear, discrete time and develop a framework for doing automated reasoning via Proof Planning in it; thirdly, we show a set of experimental results obtained by applying the framework to the problem of Feature Interactions in telecommunication systems. These results indicate that (a) the problem can be concisely and effectively modeled in the aforementioned logic, (b) proof planning actually captures common structures in the related proofs, and (c) the approach is viable also from the point of view of efficiency.