Log in

Relevant bibliographies by topics / Automatic proving / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Automatic proving.

Dissertations / Theses on the topic 'Automatic proving'

Author: Grafiati

Published: 4 June 2021

Last updated: 3 February 2022

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 'Automatic proving.'

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

Gill, David Michael. "Automatic theorem proving programs and group presentations." Thesis, University of St Andrews, 1995. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.268121.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Ghazizadeh, Behrad. "Hyperresolution for resolution logics." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/MQ39193.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Lundberg, Didrik. "Provably Sound and Secure Automatic Proving and Generation of Verification Conditions." Thesis, KTH, Teoretisk datalogi, TCS, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-239441.

Full text

Abstract:

Formal verification of programs can be done with the aid of an interactive theorem prover. The program to be verified is represented in an intermediate language representation inside the interactive theorem prover, after which statements and their proofs can be constructed. This is a process that can be automated to a high degree. This thesis presents a proof procedure to efficiently generate a theorem stating the weakest precondition for a program to terminate successfully in a state upon which a certain postcondition is placed. Specifically, the Poly/ML implementation of the SML metalanguage

APA, Harvard, Vancouver, ISO, and other styles

4

Lerner, Sorin. "Automatically proving the correctness of program analyses and transformations /." Thesis, Connect to this title online; UW restricted, 2006. http://hdl.handle.net/1773/7001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Urbas, Matej. "Mechanising heterogeneous reasoning in theorem provers." Thesis, University of Cambridge, 2014. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.708290.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Duncan, Hazel. "The use of data-mining for the automatic formation of tactics." Thesis, University of Edinburgh, 2007. http://hdl.handle.net/1842/1768.

Full text

Abstract:

As functions which further the state of a proof in automated theorem proving, tactics are an important development in automated deduction. This thesis describes a method to tackle the problem of tactic formation. Tactics must currently be developed by hand, which can be a complicated and time-consuming process. A method is presented for the automatic production of useful tactics. The method presented works on the principle that commonly occurring patterns within proof corpora may have some significance and could therefore be exploited to provide novel tactics. These tactics are discovered usin

APA, Harvard, Vancouver, ISO, and other styles

7

DeCloss, Daniel P. "An analysis of Specware and its usefulness in the verification of high assurance systems." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2006. http://library.nps.navy.mil/uhtbin/hyperion/06Jun%5FDeCloss.pdf.

Full text

Abstract:

Thesis (M.S. in Computer Science)--Naval Postgraduate School, June 2006.<br>Thesis Advisor(s): Timothy Levin and Cynthia Irvine. "June 2006." Includes bibliographical references (p. 87-89). Also available in print.

APA, Harvard, Vancouver, ISO, and other styles

8

Sabharwal, Ashish. "Algorithmic applications of propositional proof complexity /." Thesis, Connect to this title online; UW restricted, 2005. http://hdl.handle.net/1773/6938.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Petschulat, Cap. "Transparency in formal proof." [Boise, Idaho] : Boise State University, 2009. http://scholarworks.boisestate.edu/td/54/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Meng, Jia. "The integration of higher order interactive proof with first order automatic theorem proving." Thesis, University of Cambridge, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.615216.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Hunter, Christopher. "Agent-based proof support for interactive theorem proving /." [St. Lucia, Qld.], 2005. http://www.library.uq.edu.au/pdfserve.php?image=thesisabs/absthe19390.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Fuchs, Alexander Tinelli C. "Evolving model evolution." [Iowa City, Iowa] : University of Iowa, 2009. http://ir.uiowa.edu/etd/361.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Kanso, Karim. "Agda as a platform for the development of verified railway interlocking systems." Thesis, Swansea University, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.678306.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Roberts, Brian Glenn. "Modular Detection of Feature Interactions Through Theorem Proving: A Case Study." Link to electronic thesis, 2003. http://www.wpi.edu/Pubs/ETD/Available/etd-0821103-122029.

Full text

Abstract:

Thesis (M.S.)--Worcester Polytechnic Institute.<br>Keywords: theorem proving; modular verification; software verification; feature-oriented programming; feature interaction. Includes bibliographical references (p. 131-136).

APA, Harvard, Vancouver, ISO, and other styles

15

Trefler, Richard Jay. "Expressive and efficient model checking /." Digital version accessible at:, 1999. http://wwwlib.umi.com/cr/utexas/main.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Rode, Benjamin Paul. "Making sense of common sense : learning, fallibilism, and automated reasoning /." Full text (PDF) from UMI/Dissertation Abstracts International, 2000. http://wwwlib.umi.com/cr/utexas/fullcit?p3004366.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Fleuriot, Jacques. "A combination of geometry theorem proving and nonstandard analysis with application to Newton's principia /." London [u.a.] : Springer, 2001. http://www.loc.gov/catdir/enhancements/fy0813/2001031372-d.html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

French, Timothy Noel. "Bisimulation quantifiers for modal logics." University of Western Australia. School of Computer Science and Software Engineering, 2006. http://theses.library.uwa.edu.au/adt-WU2007.0013.

Full text

Abstract:

Modal logics have found applications in many diferent contexts. For example, epistemic modal logics can be used to reason about security protocols, temporal modal logics can be used to reason about the correctness of distributed systems and propositional dynamic logic can reason about the correctness of programs. However, pure modal logic is expressively weak and cannot represent many interesting secondorder properties that are expressible, for example, in the μ-calculus. Here we investigate the extension of modal logics with propositional quantification modulo bisimulation (bisimulation quant

APA, Harvard, Vancouver, ISO, and other styles

19

Raimi, Richard Saul. "Environment modeling and efficient state reachability checking /." Digital version accessible at:, 1999. http://wwwlib.umi.com/cr/utexas/main.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Poernomo, Iman Hafiz 1976. "Variations on a theme of Curry and Howard : the Curry-Howard isomorphism and the proofs-as-programs paradigm adapted to imperative and structured program synthesis." Monash University, School of Computer Science and Software Engineering, 2003. http://arrow.monash.edu.au/hdl/1959.1/9405.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Wallen, Lincoln A. "Automated proof search in non-classical logics : efficient matrix proof methods for modal and intuitionistic logics." Thesis, University of Edinburgh, 1987. http://hdl.handle.net/1842/6600.

Full text

Abstract:

In this thesis we develop efficient methods for automated proof search within an important class of mathematical logics. The logics considered are the varying, cumulative and constant domain versions of the first-order modal logics K, K4, D, D4, T, S4 and S5, and first-order intuitionistic logic. The use of these non-classical logics is commonplace within Computing Science and Artificial Intelligence in applications in which efficient machine assisted proof search is essential. Traditional techniques for the design of efficient proof methods for classical logic prove to be of limited use in th

APA, Harvard, Vancouver, ISO, and other styles

22

Schulz, Stephan. "Leaning search control knowlledge for equational deduction /." Berlin : AKA, 2000. http://www.loc.gov/catdir/toc/fy0804/2007440965.html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Rautenberg, Robson Raulino. "Os teoremas de pappus para os sólidos de revolução." Universidade Tecnológica Federal do Paraná, 2013. http://repositorio.utfpr.edu.br/jspui/handle/1/471.

Full text

Abstract:

Capes<br>A partir dos teoremas encontrados na publicação Geometriae Pars Universalis de 1668 são apresentadas, pela primeira vez em português, as demonstrações dos teoremas de Pappus para os sólidos de revolução. Essa publicação, escrita originalmente em latim, foi feita pelo matemático escocês James Gregory (1638-1675) e é anterior ao desenvolvimento do Cálculo. Além disso, alguns conceitos de Cálculo e de centro de gravidade são revistos a ﬁm de também apresentarumademonstraçãodessesteoremasapartirdessasferramentas. Ainda são feitas algumas aplicações dos teoremas de Pappus para os casos dir

APA, Harvard, Vancouver, ISO, and other styles

24

Delsart, Bertrand. "E-unification en démonstration automatique." Grenoble INPG, 1994. http://tel.archives-ouvertes.fr/tel-00005085.

Full text

Abstract:

Depuis les travaux de Martelli et Montanari en 1982, la resolution de problemes de E-unification s'effectue souvent par transformation de systemes d'equations. L'objectif de cette these est de presenter des nouvelles regles de transformations qui de- crivent de facon unifiee comment appliquer des axiomes a la ra- cine des termes. Les proprietes theoriques de ces regles sont etablies (correction, completude. . . ). Nous prouvons egalement que cette approche, basee sur la notion de presentations strictement resolventes, est plus generale que des algorithmes tres connus (Root-Rewriting [J. Gallie

APA, Harvard, Vancouver, ISO, and other styles

25

Mzali, Jalel. "Méthodes de filtrage équationnel et de preuve automatique de théorèmes." Nancy 1, 1986. http://www.theses.fr/1986NAN10387.

Full text

Abstract:

Implantation de différentes méthodes de démonstration automatique basées sur un algorithme de completion rapide appelé SKB et un algorithme de complétion qui privilégie la règle de simplification par rapport à celle de superposition, nous étudions cet algorithme et son implantation. Étude du filtrage pour la simplification et la réécriture des termes

APA, Harvard, Vancouver, ISO, and other styles

26

Oliveira, Carlos Alberto Maziozeki de. "Os teoremas de Stewart e de Heron e o cálculo da área de um triângulo em função dos lados." Universidade Tecnológica Federal do Paraná, 2014. http://repositorio.utfpr.edu.br/jspui/handle/1/801.

Full text

Abstract:

CAPES<br>Organizou-se esta dissertação a partir da constatação de que teoremas de matemáticos como Matthew Stewart e Heron são pouco empregados nas aulas de matemática do ensino fundamental e médio. As contribuições desses matemáticos no cálculo das cevianas e da área de triângulos podem simplificar a solução de muitos problemas. Como ponto de partida, elaborou-se uma atividade extraclasse contendo quatro questões centradas no Teorema de Stewart e aplicou-se a mesma a três turmas do ensino m´edio do CPM-PR. A partir da análise dos resultados dessa atividade, definiu-se a pesquisa bibliográfic

APA, Harvard, Vancouver, ISO, and other styles

27

Kakkad, Aman. "Machine Learning for Automated Theorem Proving." Scholarly Repository, 2009. http://scholarlyrepository.miami.edu/oa_theses/223.

Full text

Abstract:

Developing logic in machines has always been an area of concern for scientists. Automated Theorem Proving is a field that has implemented the concept of logical consequence to a certain level. However, if the number of available axioms is very large then the probability of getting a proof for a conjecture in a reasonable time limit can be very small. This is where the ability to learn from previously proved theorems comes into play. If we see in our own lives, whenever a new situation S(NEW) is encountered we try to recollect all old scenarios S(OLD) in our neural system similar to the new one

APA, Harvard, Vancouver, ISO, and other styles

28

Bridge, J. P. "Machine learning and automated theorem proving." Thesis, University of Cambridge, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.596901.

Full text

Abstract:

Computer programs to find formal proofs of theorems were originally designed as tools for mathematicians, but modern applications are much more diverse. In particular they are used in formal methods to verify software and hardware designs to prevent errors being introduced into systems. Despite this, the high level of human expertise required in their use means that theorem proving tools are not widely used by non-specialists. The work described in this dissertation addresses one aspect of this problem, that of heuristic selection. In theory theorem provers should be automatic; in practice the

APA, Harvard, Vancouver, ISO, and other styles

29

Folkler, Andreas. "Automated Theorem Proving : Resolution vs. Tableaux." Thesis, Blekinge Tekniska Högskola, Institutionen för programvaruteknik och datavetenskap, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-5531.

Full text

Abstract:

The purpose of this master thesis was to investigate which of the two methods, resolution and tableaux, that is the most appropriate for automated theorem proving. This was done by implementing an automated theorem prover, comparing and documenting implementation problems, and measuring proving efficiency. In this thesis, I conclude that the resolution method might be more suitable for an automated theorem prover than tableaux, in the aspect of ease of implementation. Regarding the efficiency, the test results indicate that resolution is the better choice.<br>Syftet med detta magisterarbete va

APA, Harvard, Vancouver, ISO, and other styles

30

Pereira, Adão Regis. "Teorema de Tales: análise de sua apresentação nos livros didáticos e proposição de atividades." Universidade Tecnológica Federal do Paraná, 2014. http://repositorio.utfpr.edu.br/jspui/handle/1/791.

Full text

Abstract:

CAPES<br>Nesse trabalho identificamos os objetivos e as orientações nos Parâmetros Curriculares Nacionais, do terceiro e quarto ciclos, sobre o estudo da Geometria. Pesquisamos sobre a Biografia de Tales de Mileto, onde fazemos um relato, da região e história, da época em que ele viveu, contamos alguns de seus feitos, e enumeramos os teoremas cujas demonstrações lhe são atribuídas. Analisamos seis livros didáticos do 9º ano do ensino fundamental, que integram o Plano Nacional do Livro Didático 2014, observamos a forma como a Geometria é trabalhada, e quais as demonstrações e atividades apresen

APA, Harvard, Vancouver, ISO, and other styles

31

Comon-Lundh, Hubert. "Unification et disunification : théorie et applications." Grenoble INPG, 1988. http://tel.archives-ouvertes.fr/tel-00331263.

Full text

Abstract:

Les règles de transformation des problèmes equationnels sont donnes permettant, en particulier, de décider de l'existence d'une solution fermée. Comme première application, il est montre comment calculer une grammaire pour le langage des termes fermes irréductibles par un système de réécriture. D'autres applications et extensions sont ensuite envisagées. En particulier, en programmation logique et dans les spécifications algébriques

APA, Harvard, Vancouver, ISO, and other styles

32

Haufe, Sebastian. "Automated Theorem Proving for General Game Playing." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-89998.

Full text

Abstract:

While automated game playing systems like Deep Blue perform excellent within their domain, handling a different game or even a slight change of rules is impossible without intervention of the programmer. Considered a great challenge for Artificial Intelligence, General Game Playing is concerned with the development of techniques that enable computer programs to play arbitrary, possibly unknown n-player games given nothing but the game rules in a tailor-made description language. A key to success in this endeavour is the ability to reliably extract hidden game-specific features from a given gam

APA, Harvard, Vancouver, ISO, and other styles

33

Pierobom, Jean Lima. "Otimização por nuvem de partículas aplicada ao problema de atribuição de tarefas dinâmico." Universidade Tecnológica Federal do Paraná, 2012. http://repositorio.utfpr.edu.br/jspui/handle/1/205.

Full text

Abstract:

A Inteligência de Enxame (Swarm Intelligence) é uma área de estudos que busca soluções para problemas de otimização utilizando-se de técnicas computacionais inspiradas no comportamento social emergente encontrado na biologia. A metaheurística Particle Swarm Optimization (PSO) é relativamente nova e foi inspirada no comportamento social de bandos de pássaros. PSO tem apresentado bons resultados em alguns trabalhos recentes de otimização discreta, apesar de ter sido concebido originalmente para a otimização de problemas contínuos. Este trabalho trata o Problema de Atribuição de Tarefas - Task As

APA, Harvard, Vancouver, ISO, and other styles

34

Schiffel, Stephan. "Knowledge-Based General Game Playing." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-88742.

Full text

Abstract:

The goal of General Game Playing (GGP) is to develop a system, that is able to automatically play previously unseen games well, solely by being given the rules of the game. In contrast to traditional game playing programs, a general game player cannot be given game specific knowledge. Instead, the program has to discover this knowledge and use it for effectively playing the game well without human intervention. In this thesis, we present a such a program and general methods that solve a variety of knowledge discovery problems in GGP. Our main contributions are methods for the automatic constru

APA, Harvard, Vancouver, ISO, and other styles

35

Goble, Tiffany Danielle. "Automate Reasoning: Computer Assisted Proofs in Set Theory Using Godel's Algorithm for Class Formation." Thesis, Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/4767.

Full text

Abstract:

Automated reasoning, and in particular automated theorem proving, has become a very important research field within the world of mathematics. Besides being used to verify proofs of theorems, it has also been used to discover proofs of theorems which were previously open problems. In this thesis, an automated reasoning assistant based on Godel's class theory is used to deduce several theorems.

APA, Harvard, Vancouver, ISO, and other styles

36

Gottliebsen, Hanne. "Automated theorem proving for mathematics : real analysis in PVS." Thesis, University of St Andrews, 2002. http://hdl.handle.net/10023/15046.

Full text

Abstract:

Computer Algebra Systems (CASs), such as Maple and Mathematica, are now widely used in both industry and education. In many areas of mathematics they perform well. However, many well-established methods in mathematics, such as definite integration via the fundamental theorem of calculus, rely on analytic side conditions which CASs in general do not support. This thesis presents our work with automatic, formal mathematics using the theorem prover PVS. Based on an existing real analysis library for PVS, we have implemented transcendental functions such as exp, cos, sin, tan and their inverses, a

APA, Harvard, Vancouver, ISO, and other styles

37

Monteiro, Guilherme Elias Egg. "Contando as simetrias rotacionais dos poliedros regulares." Universidade Tecnológica Federal do Paraná, 2013. http://repositorio.utfpr.edu.br/jspui/handle/1/574.

Full text

Abstract:

CAPES<br>Esta dissertação está dividida em duas partes. A primeira parte é uma introdução da teoria básica de grupos necessária para o desenvolvimento do teorema da órbita-estabilizador, que permite fazer as contagens das simetrias dos poliedros regulares. A segunda parte é a descrição de uma atividade aplicada em sala de aula.<br>This dissertation is divided in two parts. The ﬁrst part is an introduction to basic group theory required for the development of the orbit-stabilizer theorem, that allows the counts of symmetries of the regular polyhedra. The second part is the description of an act

APA, Harvard, Vancouver, ISO, and other styles

38

Rigoti, Marcio Dominicali. "Números primos: os átomos dos números." Universidade Tecnológica Federal do Paraná, 2014. http://repositorio.utfpr.edu.br/jspui/handle/1/1075.

Full text

Abstract:

CAPES<br>Este trabalho apresenta um estudo sobre os Números Primos que passa por resultados básicos, como a infinitude dos números primos e o Teorema Fundamental da Aritmética, e resultados mais sofisticados, como o Teorema de Wilson e a consequente função geradora de primos. Além dos resultados teóricos apresenta-se uma interpretação geométrica para os números primos. Essa interpretação e aplicada na ilustração de alguns dos resultados relacionados a primos abordados no ensino básico. Atividades envolvendo a interpretação geométrica apresentada são sugeridas no capítulo final.<br>This work pr

APA, Harvard, Vancouver, ISO, and other styles

39

Prince, Rawle C. S. "Aspects of the theory of containers within automated theorem proving." Thesis, University of Nottingham, 2011. http://eprints.nottingham.ac.uk/11793/.

Full text

Abstract:

This thesis explores applications of the theory of containers within automated theorem proving. Container theory provides a foundational analysis of data types as containers, specified by a type $S$ of shapes and a function P assigning to each shape its set of positions for data.More importantly, a representation theorem guarantees that polymorphic functions between container data types are given by container morphisms, which are characterised by mappings between shapes and positions. Container theory is interesting, in this context, for the following reasons. A mechanism for representing and

APA, Harvard, Vancouver, ISO, and other styles

40

Araragi, Tadashi. "Applications of automated theorem proving methods to multi-agent systems." 京都大学 (Kyoto University), 2006. http://hdl.handle.net/2433/143884.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Johnson, Robert David. "Parallel analytic tableaux systems." Thesis, Queen Mary, University of London, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.362777.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Rusinowitch, Michaël. "Démonstration automatique par des techniques de réécritures." Nancy 1, 1987. http://www.theses.fr/1987NAN10358.

Full text

Abstract:

Introduction à la logique du premier ordre et aux systèmes de réécriture. Étude de quelques ordres de simplification. Arbres sémantiques transfinis. Stratégies de paramodulation. Complétude en présence de règles de réduction. Stratégies de superposition. Ensembles complets de règles d'inférence pour les axiomes de régularité

APA, Harvard, Vancouver, ISO, and other styles

43

Almulla, Mohammed Ali. "Analysis of the use of semantic trees in automated theorem proving." Thesis, McGill University, 1994. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=28662.

Full text

Abstract:

Semantic trees have served as a theoretical tool for confirming the unsatisfiability of clauses in first-order predicate logic, but it has seemed impractical to use them in practice. In this thesis we experimentally investigated the practicality of generating semantic trees for proofs of unsatisfiability. We considered two ways of generating semantic trees. First, we looked at semantic trees generated using the canonical enumeration of atoms from the Herbrand base of the given clauses. Then, we considered semantic trees generated by selectively choosing the atoms from the Herbrand base using a

APA, Harvard, Vancouver, ISO, and other styles

44

Johansson, Moa. "Automated discovery of inductive lemmas." Thesis, University of Edinburgh, 2009. http://hdl.handle.net/1842/9807.

Full text

Abstract:

The discovery of unknown lemmas, case-splits and other so called eureka steps are challenging problems for automated theorem proving and have generally been assumed to require user intervention. This thesis is mainly concerned with the automated discovery of inductive lemmas. We have explored two approaches based on failure recovery and theory formation, with the aim of improving automation of firstand higher-order inductive proofs in the IsaPlanner system. We have implemented a lemma speculation critic which attempts to find a missing lemma using information from a failed proof-attempt. Howev

APA, Harvard, Vancouver, ISO, and other styles

45

Hoder, Krystof. "Practical aspects of automated first-order reasoning." Thesis, University of Manchester, 2012. https://www.research.manchester.ac.uk/portal/en/theses/practical-aspects-of-automated-firstorder-reasoning(1331ec1f-802c-4aeb-9265-1248d8db2a8e).html.

Full text

Abstract:

Our work focuses on bringing the first-order reasoning closer to practicalapplications, particularly in software and hardware verification. The aim is to develop techniques that make first-order reasoners more scalablefor large problems and suitable for the applications. In pursuit of this goal the work focuses in three main directions. First, wedevelop an algorithm for an efficient pre-selection of axioms. This algorithmis already being widely used by the community and enables off-the-shelf theoremprovers to work with problems having millions of axioms that would otherwisebe overwhelming for

APA, Harvard, Vancouver, ISO, and other styles

46

Savchenko, Sergei. "Resolution based techniques for automated proving of theorems in Tarskian-Euclidian geometry." Thesis, McGill University, 1999. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=30742.

Full text

Abstract:

The discipline of automated theorem proving encompasses techniques which allow us to find a justification of a logical statement expressing an assertion in some domain of knowledge. Beside obvious importance for mathematics, many of the tasks traditionally associated with human intellect can be solved through application of these techniques. Methods based on Robinson's resolution form one of the cornerstones of automated theorem proving. The efficiency of these methods, however, is less than admissible for many interesting domains of mathematics. By studying the underlining axioms of the domai

APA, Harvard, Vancouver, ISO, and other styles

47

Savchenko, Sergei. "Resolution based techniques for automated proving of theorems in Tarskian-Euclidian geometry." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0035/MQ64447.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

De, Waal David Andre. "Analysis and transformation of proof procedures." Thesis, University of Bristol, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.240493.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Schmidt, Elvis. "O ensino de geometria projetiva na educação básica: uma proposta para apreensão do conhecimento do mundo tridimensional." Universidade Tecnológica Federal do Paraná, 2015. http://repositorio.utfpr.edu.br/jspui/handle/1/1371.

Full text

Abstract:

Capes<br>Na busca por uma melhor representação da realidade tridimensional, as Geometrias não- Euclidianas oferecem uma alternativa ao euclidianismo clássico e um dos destaques e a Geometria Projetiva. Assim, o objetivo deste trabalho e, através de ilustrações, contribuir para a assimilação de definições como perspectiva, projeção e o principio da dualidade. E, a partir de resultados importantes como o Teorema de Desargues, o Teorema de Pappus e o Teorema de Pascal, queremos facilitar a compreensão e a visualização de algumas das técnicas de perspectiva que podem ser adaptadas para o uso na sa

APA, Harvard, Vancouver, ISO, and other styles

50

Chatalic, Philippe. "Raisonnement deductif en presence de connaissances imprecises et incertaines : un systeme base sur la theorie de dempster-shafer." Toulouse 3, 1986. http://www.theses.fr/1986TOU30189.

Full text

Abstract:

Ce memoire s'interesse aux approches quantitatives permettant de modeliser les notions d'incertitude et d'imprecision, dans les methodes de raisonnement automatiques. La premiere partie donne une vue d'ensemble des outils actuels, permettant de representer et manipuler des connaissances imprecises ou incertaines. La seconde partie a pour cadre general, celui des fonctions de croyances de shafer qui presente l'avantage d'englober les cadres propabiliste et possibliste comme cas particuliers

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!