Gotowa bibliografia na temat „Theorem proving”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Theorem proving”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Theorem proving"
Gan, Wenbin, Xinguo Yu, Ting Zhang i Mingshu Wang. "Automatically Proving Plane Geometry Theorems Stated by Text and Diagram". International Journal of Pattern Recognition and Artificial Intelligence 33, nr 07 (7.06.2019): 1940003. http://dx.doi.org/10.1142/s0218001419400032.
Pełny tekst źródłaCrouse, Maxwell, Ibrahim Abdelaziz, Bassem Makni, Spencer Whitehead, Cristina Cornelio, Pavan Kapanipathi, Kavitha Srinivas, Veronika Thost, Michael Witbrock i Achille Fokoue. "A Deep Reinforcement Learning Approach to First-Order Logic Theorem Proving". Proceedings of the AAAI Conference on Artificial Intelligence 35, nr 7 (18.05.2021): 6279–87. http://dx.doi.org/10.1609/aaai.v35i7.16780.
Pełny tekst źródłaXiao, Da, Yue Fei Zhu, Sheng Li Liu, Dong Xia Wang i You Qiang Luo. "Digital Hardware Design Formal Verification Based on HOL System". Applied Mechanics and Materials 716-717 (grudzień 2014): 1382–86. http://dx.doi.org/10.4028/www.scientific.net/amm.716-717.1382.
Pełny tekst źródłaBahodirovich, Hojiyev Dilmurodjon, Muhammadjonov Akbarshoh Akramjon Og`Li Og`Li, Muzaffarova Dilshoda Botirjon Qizi, Ibrohimjonov Islombek Ilhomjon O`G`Li i Ahmadjonova Musharrafxon Dilmurod Qizi. "About One Theorem Of 2x2 Jordan Blocks Matrix". American Journal of Applied sciences 03, nr 06 (12.06.2021): 28–33. http://dx.doi.org/10.37547/tajas/volume03issue06-05.
Pełny tekst źródłaPerron, Steven. "Examining Fragments of the Quantified Propositional Calculus". Journal of Symbolic Logic 73, nr 3 (wrzesień 2008): 1051–80. http://dx.doi.org/10.2178/jsl/1230396765.
Pełny tekst źródłaJupri, Al, Siti Fatimah i Dian Usdiyana. "Dampak Perkuliahan Geometri Pada Penalaran Deduktif Mahasiswa: Kasus Pembelajaran Teorema Ceva". AKSIOMA : Jurnal Matematika dan Pendidikan Matematika 11, nr 1 (15.07.2020): 93–104. http://dx.doi.org/10.26877/aks.v11i1.6011.
Pełny tekst źródłaStickel, M. E. "Resolution Theorem Proving". Annual Review of Computer Science 3, nr 1 (czerwiec 1988): 285–316. http://dx.doi.org/10.1146/annurev.cs.03.060188.001441.
Pełny tekst źródłaGogate, Vibhav, i Pedro Domingos. "Probabilistic theorem proving". Communications of the ACM 59, nr 7 (24.06.2016): 107–15. http://dx.doi.org/10.1145/2936726.
Pełny tekst źródłaKlein, Gerwin, i Ruben Gamboa. "Interactive Theorem Proving". Journal of Automated Reasoning 56, nr 3 (20.02.2016): 201–3. http://dx.doi.org/10.1007/s10817-016-9363-7.
Pełny tekst źródłaPlaisted, David A. "Automated theorem proving". Wiley Interdisciplinary Reviews: Cognitive Science 5, nr 2 (17.01.2014): 115–28. http://dx.doi.org/10.1002/wcs.1269.
Pełny tekst źródłaRozprawy doktorskie na temat "Theorem proving"
Ballarin, Clemens Michael. "Computer algebra and theorem proving". Thesis, University of Cambridge, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.624429.
Pełny tekst źródłaJi, Kailiang. "Model checking and theorem proving". Sorbonne Paris Cité, 2015. http://www.theses.fr/2015USPCC250.
Pełny tekst źródłaModel checking is a technique for automatically verifying correctness properties of finite systems. Normally, model checking tools enjoy two remarkable features: they are fully automatic and a counterexample will be produced if the system fails to satisfy the property. . Deduction Modulo is a reformulation of Predicate Logic where some axioms- - - possibly ail---are replaced by rewrite rules. The focus of this dissertation is to give an encoding of temporal properties expressed in CTL as first -order formulas, by translating the logical equivalence between temporal operators into rewrite rules. This way, proof -search algorithms designed for Deduction Modulo, such as Resolution Modulo or Tableaux Modulo, can be used to verify temporal properties of finite transition systems. To achieve the aim of solving model checking problems with an off-the-shelf automated theorem proyer, three works are included in this dissertation. First, we address the graph traversai problems in model checking with automated theorem provers. As a preparation work, we propose a way of encoding a graph as a formula such that the traversal of the graph corresponds to resolution steps. Then we present the way of translating model checking problems as proving first-order formulas in Deduction Modulo. The soundness and completeness of our method shows that solving CTL model checking problems with automated theorem provers is feasible. At last, based on the theoretical basis in the second work, we propose a symbolic model checking method. This method is implemented in iProver Modulo, which is a first-order theorem proyer uses Polarized Resolution Modulo
Kakkad, Aman. "Machine Learning for Automated Theorem Proving". Scholarly Repository, 2009. http://scholarlyrepository.miami.edu/oa_theses/223.
Pełny tekst źródłaFolkler, 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.
Pełny tekst źródłaSyftet med detta magisterarbete var att undersöka vilken av de två metoderna, resolution och tablå, som är mest lämpad för automatisk teorembevisning. Detta gjordes genom att implementera en automatisk teorembevisare, jämföra och dokumentera problem, samt att mäta prestanda för bevisning. I detta arbete drar jag slutsatsen att resolutionsmetoden förmodligen är mer lämpad än tablåmetoden för en automatisk teorembevisare, med avseende på hur svår den är att implementera. När det gäller prestanda indikerar utförda tester att resolutionsmetoden är det bästa valet.
Amjad, Hasan. "Combining model checking and theorem proving". Thesis, University of Cambridge, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.616074.
Pełny tekst źródłaBridge, J. P. "Machine learning and automated theorem proving". Thesis, University of Cambridge, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.596901.
Pełny tekst źródłaHou, Tie. "Interactive theorem proving and program extraction". Thesis, Swansea University, 2014. https://cronfa.swan.ac.uk/Record/cronfa42845.
Pełny tekst źródłaSyme, Donald Robert. "Declarative theorem proving for operational semantics". Thesis, University of Cambridge, 1999. https://www.repository.cam.ac.uk/handle/1810/252967.
Pełny tekst źródłaHarrison, John Robert. "Theorem proving with the real numbers". Thesis, University of Cambridge, 1996. https://www.repository.cam.ac.uk/handle/1810/265488.
Pełny tekst źródłaHaufe, 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.
Pełny tekst źródłaKsiążki na temat "Theorem proving"
Beringer, Lennart, i Amy Felty, red. Interactive Theorem Proving. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32347-8.
Pełny tekst źródłaBibel, Wolfgang. Automated Theorem Proving. Wiesbaden: Vieweg+Teubner Verlag, 1987. http://dx.doi.org/10.1007/978-3-322-90102-6.
Pełny tekst źródłaAyala-Rincón, Mauricio, i César A. Muñoz, red. Interactive Theorem Proving. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-66107-0.
Pełny tekst źródłaNewborn, Monty. Automated Theorem Proving. New York, NY: Springer New York, 2001. http://dx.doi.org/10.1007/978-1-4613-0089-2.
Pełny tekst źródłaKlein, Gerwin, i Ruben Gamboa, red. Interactive Theorem Proving. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08970-6.
Pełny tekst źródłaBlazy, Sandrine, Christine Paulin-Mohring i David Pichardie, red. Interactive Theorem Proving. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39634-2.
Pełny tekst źródłaKaufmann, Matt, i Lawrence C. Paulson, red. Interactive Theorem Proving. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14052-5.
Pełny tekst źródłavan Eekelen, Marko, Herman Geuvers, Julien Schmaltz i Freek Wiedijk, red. Interactive Theorem Proving. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22863-6.
Pełny tekst źródłaUrban, Christian, i Xingyuan Zhang, red. Interactive Theorem Proving. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-22102-1.
Pełny tekst źródłaAvigad, Jeremy, i Assia Mahboubi, red. Interactive Theorem Proving. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94821-8.
Pełny tekst źródłaCzęści książek na temat "Theorem proving"
Abadi, Martín, i Zohar Manna. "Modal theorem proving". W 8th International Conference on Automated Deduction, 172–89. Berlin, Heidelberg: Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/3-540-16780-3_89.
Pełny tekst źródłaLi, Hongbo. "Automated Theorem Proving". W Geometric Algebra with Applications in Science and Engineering, 110–19. Boston, MA: Birkhäuser Boston, 2001. http://dx.doi.org/10.1007/978-1-4612-0159-5_6.
Pełny tekst źródłaStachniak, Zbigniew. "Theorem Proving Strategies". W Automated Reasoning Series, 103–31. Dordrecht: Springer Netherlands, 1996. http://dx.doi.org/10.1007/978-94-009-1677-7_5.
Pełny tekst źródłaLynch, Christopher. "Unsound Theorem Proving". W Computer Science Logic, 473–87. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30124-0_36.
Pełny tekst źródłaDowek, Gilles. "Automated Theorem Proving". W Proofs and Algorithms, 117–38. London: Springer London, 2011. http://dx.doi.org/10.1007/978-0-85729-121-9_6.
Pełny tekst źródłaBonacina, Maria Paola. "Parallel Theorem Proving". W Handbook of Parallel Constraint Reasoning, 179–235. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-63516-3_6.
Pełny tekst źródłaFleuriot, Jacques. "Geometry Theorem Proving". W A Combination of Geometry Theorem Proving and Nonstandard Analysis with Application to Newton’s Principia, 11–30. London: Springer London, 2001. http://dx.doi.org/10.1007/978-0-85729-329-9_2.
Pełny tekst źródłaAhmed, Asad, Osman Hasan, Falah Awwad i Nabil Bastaki. "Interactive Theorem Proving". W Formal Analysis of Future Energy Systems Using Interactive Theorem Proving, 23–29. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-78409-6_2.
Pełny tekst źródłaReif, Wolfgang, i Gerhard Schellhorn. "Theorem Proving in Large Theories". W Applied Logic Series, 225–41. Dordrecht: Springer Netherlands, 1998. http://dx.doi.org/10.1007/978-94-017-0437-3_9.
Pełny tekst źródłaAspinall, David, i Cezary Kaliszyk. "What’s in a Theorem Name?" W Interactive Theorem Proving, 459–65. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-43144-4_28.
Pełny tekst źródłaStreszczenia konferencji na temat "Theorem proving"
Niknafs-Kermani, Amir, Boris Konev i Michael Fisher. "Symmetric Temporal Theorem Proving". W 2012 19th International Symposium on Temporal Representation and Reasoning (TIME). IEEE, 2012. http://dx.doi.org/10.1109/time.2012.20.
Pełny tekst źródłaGonthier, Georges. "Combinatorics for theorem proving". W the 1st Workshop. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1735813.1735814.
Pełny tekst źródłaYorsh, Greta, Thomas Ball i Mooly Sagiv. "Testing, abstraction, theorem proving". W the 2006 international symposium. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1146238.1146255.
Pełny tekst źródłaChen, Chiyan, i Hongwei Xi. "Combining programming with theorem proving". W the tenth ACM SIGPLAN international conference. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1086365.1086375.
Pełny tekst źródłaWeirich, Stephanie. "Session details: Automated theorem proving". W ICFP'12: ACM SIGPLAN International Conference on Functional Programming. New York, NY, USA: ACM, 2012. http://dx.doi.org/10.1145/3249893.
Pełny tekst źródła"THEOREM PROVING IN THE ONTOLOGY LIFECYCLE". W International Conference on Knowledge Engineering and Ontology Development. SciTePress - Science and and Technology Publications, 2010. http://dx.doi.org/10.5220/0003076400370049.
Pełny tekst źródłaOtten, Jens. "nanoCoP: Natural Non-clausal Theorem Proving". W Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/695.
Pełny tekst źródłaPaulson, Lawrence C. "Automated theorem proving for special functions". W the 2014 Symposium. New York, New York, USA: ACM Press, 2014. http://dx.doi.org/10.1145/2631948.2631950.
Pełny tekst źródłaMunoz Toriz, Juan Pablo, Ivan Martinez Ruiz i Jose Arrazola Ramirez. "On Automatic Theorem Proving with ML". W 2014 13th Mexican International Conference on Artificial Intelligence (MICAI). IEEE, 2014. http://dx.doi.org/10.1109/micai.2014.42.
Pełny tekst źródłaBonacina, Maria Paola. "On theorem proving for program checking". W the 12th international ACM SIGPLAN symposium. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1836089.1836090.
Pełny tekst źródłaRaporty organizacyjne na temat "Theorem proving"
Abadi, Martin, i Zohar Manna. Modal Theorem Proving,. Fort Belvoir, VA: Defense Technical Information Center, maj 1986. http://dx.doi.org/10.21236/ada325959.
Pełny tekst źródłaShankar, Natarajan. PVS Theorem Proving Enhancements. Fort Belvoir, VA: Defense Technical Information Center, czerwiec 1997. http://dx.doi.org/10.21236/ada326917.
Pełny tekst źródłaAvigad, Jeremy, i Robert Harper. Type Theory, Computation and Interactive Theorem Proving. Fort Belvoir, VA: Defense Technical Information Center, wrzesień 2015. http://dx.doi.org/10.21236/ad1003773.
Pełny tekst źródłaBellin, Gianluigi, i Jussi Ketonen. Experiments in Automatic Theorem Proving. Fort Belvoir, VA: Defense Technical Information Center, grudzień 1986. http://dx.doi.org/10.21236/ada327449.
Pełny tekst źródłaArcher, Myla, i Constance Heitmeyer. Human-Style Theorem Proving Using PVS. Fort Belvoir, VA: Defense Technical Information Center, sierpień 1997. http://dx.doi.org/10.21236/ada464276.
Pełny tekst źródłaLusk, E., i W. McCune. An entry in the 1992 Overbeek theorem-proving contest. Office of Scientific and Technical Information (OSTI), listopad 1992. http://dx.doi.org/10.2172/6940861.
Pełny tekst źródłaLusk, E. L., i W. W. McCune. An entry in the 1992 Overbeek theorem-proving contest. Office of Scientific and Technical Information (OSTI), listopad 1992. http://dx.doi.org/10.2172/10114594.
Pełny tekst źródłaClarke, Edmund, i Xudong Zhao. Analytica - An Experiment in Combining Theorem Proving and Symbolic Computation. Fort Belvoir, VA: Defense Technical Information Center, październik 1992. http://dx.doi.org/10.21236/ada258656.
Pełny tekst źródłaMcCune, W. A case study in automated theorem proving: A difficult problem about commutators. Office of Scientific and Technical Information (OSTI), luty 1995. http://dx.doi.org/10.2172/27057.
Pełny tekst źródłaWos, L., i W. McCune. Searching for fixed point combinators by using automated theorem proving: A preliminary report. Office of Scientific and Technical Information (OSTI), wrzesień 1988. http://dx.doi.org/10.2172/6852789.
Pełny tekst źródła