Relevant bibliographies by topics / Automatic proving

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Automatic proving"

1

Voronkov, A. A., and A. I. Degtyarev. "Automatic theorem proving. II." Cybernetics 23, no. 4 (1988): 547–56. http://dx.doi.org/10.1007/bf01078915.

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

Hsiang, Jieh, and Mandayam Srivas. "Automatic inductive theorem proving using prolog." Theoretical Computer Science 54, no. 1 (1987): 3–28. http://dx.doi.org/10.1016/0304-3975(87)90016-8.

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

GOČ, DANIEL, DANE HENSHALL, and JEFFREY SHALLIT. "AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS." International Journal of Foundations of Computer Science 24, no. 06 (2013): 781–98. http://dx.doi.org/10.1142/s0129054113400182.

Full text
Abstract:
We describe a technique for mechanically proving certain kinds of theorems in combinatorics on words, using finite automata and a software package for manipulating them. We illustrate our technique by applying it to (a) solve an open problem of Currie and Saari on the lengths of unbordered factors in the Thue-Morse sequence; (b) verify an old result of Prodinger and Urbanek on the regular paperfolding sequence; (c) find an explicit expression for the recurrence function for the Rudin-Shapiro sequence; and (d) improve the avoidance bound in Leech's squarefree sequence. We also introduce a new m
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Yongjian, Kaiqiang Duan, David N. Jansen, et al. "An Automatic Proving Approach to Parameterized Verification." ACM Transactions on Computational Logic 19, no. 4 (2018): 1–25. http://dx.doi.org/10.1145/3232164.

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

Sutcliffe, Geoff. "The 10th IJCAR automated theorem proving system competition – CASC-J10." AI Communications 34, no. 2 (2021): 163–77. http://dx.doi.org/10.3233/aic-201566.

Full text
Abstract:
The CADE ATP System Competition (CASC) is the annual evaluation of fully automatic, classical logic Automated Theorem Proving (ATP) systems. CASC-J10 was the twenty-fifth competition in the CASC series. Twenty-four ATP systems and system variants competed in the various competition divisions. This paper presents an outline of the competition design, and a commentated summary of the results.
APA, Harvard, Vancouver, ISO, and other styles
6

Dailler, Sylvain, Claude Marché, and Yannick Moy. "Lightweight Interactive Proving inside an Automatic Program Verifier." Electronic Proceedings in Theoretical Computer Science 284 (November 27, 2018): 1–15. http://dx.doi.org/10.4204/eptcs.284.1.

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

Sands, David. "Proving the correctness of recursion-based automatic program transformations." Theoretical Computer Science 167, no. 1-2 (1996): 193–233. http://dx.doi.org/10.1016/0304-3975(96)00074-6.

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

Mantsivoda, A. V. "M-calculus ? a sequent method for automatic theorem proving." Cybernetics and Systems Analysis 29, no. 1 (1993): 130–36. http://dx.doi.org/10.1007/bf01130096.

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

Urdang, EG. "AI and expertise: heuristic search, inference engines, automatic proving." Information and Software Technology 32, no. 9 (1990): 638. http://dx.doi.org/10.1016/0950-5849(90)90212-a.

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

Baranovskii, A. I. "Using the VIRT programming language for automatic theorem proving." Cybernetics and Systems Analysis 35, no. 6 (1999): 918–29. http://dx.doi.org/10.1007/bf02742284.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Automatic proving"

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
More sources

Books on the topic "Automatic proving"

1

Bibel, W. Automated theorem proving. 2nd ed. F. Vieweg, 1987.

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

Principles of automated theorem proving. Wiley, 1991.

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

Shang-Ching, Chou. Mechanical geometry theorem proving. D. Reidel Pub. Co., 1988.

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

Schaub, Torsten. The automation of reasoning with incomplete information: From semantic foundations to efficient computation. Springer, 1997.

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

Smith, A. Which theorem prover?: A survey of four theorem provers. HMSO, 1990.

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

Plaisted, David A. The efficiency of theorem proving strategies: A comparative and asymptotic analysis. Vieweg, 1997.

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

Slotosch, Oscar. Analogieschlüsse beim automatischen Beweisen. Kovač, 1992.

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

Patricia, Johann, ed. Deduction systems. Springer, 1997.

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

Snyder, Wayne. A proof theory for general unification. Birkhäuser, 1991.

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

The automation of reasoning with incomplete information: From semantic foundations to efficient computation. Springer, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Automatic proving"

1

Lammich, Peter. "Automatic Data Refinement." In Interactive Theorem Proving. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39634-2_9.

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

Reid, Peter, and Ruben Gamboa. "Automatic Differentiation in ACL2." In Interactive Theorem Proving. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22863-6_23.

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

Recio, Tomas, Hans Sterk, and M. Pilar Vélez. "Automatic Geometry Theorem Proving." In Some Tapas of Computer Algebra. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-662-03891-8_12.

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

Greenaway, David, June Andronick, and Gerwin Klein. "Bridging the Gap: Automatic Verified Abstraction of C." In Interactive Theorem Proving. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32347-8_8.

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

Nipkow, Tobias. "Automatic Functional Correctness Proofs for Functional Search Trees." In Interactive Theorem Proving. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-43144-4_19.

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

Crapo, Henry, and Jürgen Richter-Gebert. "Automatic Proving of Geometric Theorems." In Invariant Methods in Discrete and Computational Geometry. Springer Netherlands, 1995. http://dx.doi.org/10.1007/978-94-015-8402-9_8.

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

Rizkallah, Christine, Japheth Lim, Yutaka Nagashima, et al. "A Framework for the Automatic Formal Verification of Refinement from Cogent to C." In Interactive Theorem Proving. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-43144-4_20.

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

Cox, David, John Little, and Donal O’Shea. "Robotics and Automatic Geometric Theorem Proving." In Undergraduate Texts in Mathematics. Springer New York, 2007. http://dx.doi.org/10.1007/978-0-387-35651-8_6.

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

Cox, David, John Little, and Donal O’Shea. "Robotics and Automatic Geometric Theorem Proving." In Undergraduate Texts in Mathematics. Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4757-2693-0_6.

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

Cox, David A., John Little, and Donal O’Shea. "Robotics and Automatic Geometric Theorem Proving." In Undergraduate Texts in Mathematics. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-16721-3_6.

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

Conference papers on the topic "Automatic proving"

1

Munoz Toriz, Juan Pablo, Ivan Martinez Ruiz, and Jose Arrazola Ramirez. "On Automatic Theorem Proving with ML." In 2014 13th Mexican International Conference on Artificial Intelligence (MICAI). IEEE, 2014. http://dx.doi.org/10.1109/micai.2014.42.

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

Guergueb, Ahmed, Jean Mainguené, and Marie-Françoise Roy. "Examples of automatic theorem proving a real geometry." In the international symposium. ACM Press, 1994. http://dx.doi.org/10.1145/190347.190354.

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

Guo, Siwen. "Numerical Approach for Automatic Theorem Proving in Plane Geometry." In 2013 International Conference on Intelligent Networking and Collaborative Systems (INCoS). IEEE, 2013. http://dx.doi.org/10.1109/incos.2013.38.

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

Li, Bing, Li Liu, and Lian Li. "Automatic Assessment of Proving Problems in Middle School Algebra." In 2011 International Conference on Intelligent Human-Machine Systems and Cybernetics (IHMSC). IEEE, 2011. http://dx.doi.org/10.1109/ihmsc.2011.121.

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

Mendis, Chamupathi, Dhanushka Lahiru, Naduni Pamudika, Supun Madushanka, Surangika Ranathunga, and Gihan Dias. "Automatic assessment of student answers for geometric theorem proving questions." In 2017 Moratuwa Engineering Research Conference (MERCon). IEEE, 2017. http://dx.doi.org/10.1109/mercon.2017.7980520.

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

Davydov, A., A. Larionov, and N. Nagul. "PCF-based formalization of the parallel composition of automata." In The International Workshop on Information, Computation, and Control Systems for Distributed Environments 2019. Crossref, 2019. http://dx.doi.org/10.47350/iccs-de.2019.03.

Full text
Abstract:
The paper demonstrates how the automatic theorem proving technique of the PCF calculus is applied to construct parallel composition of automata. Parallel composition plays an essential role in the supervisory control theory at different stages of systems and supervisors design. Improved formalization of discrete event systems as positively-constructed formulas along with auxiliary predicates, serving for accessibility of the automaton checking, simplify parallel composition construction.
APA, Harvard, Vancouver, ISO, and other styles
7

Caines, P. E., T. Mackling, and Y. J. Wei. "Logic Control via Automatic Theorem Proving: COCOLOG Fragments Implemented in Blitzensturm 5.0." In 1993 American Control Conference. IEEE, 1993. http://dx.doi.org/10.23919/acc.1993.4793060.

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

Wang, Shuaiqiang, Jiancheng Wan, and Jinkui Hou. "OR-ATP: An Operation Refinement Approach As a Process of Automatic Theorem Proving." In Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007). IEEE, 2007. http://dx.doi.org/10.1109/snpd.2007.253.

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

Staroletov, Sergey. "Automatic Proving of Stability of the Cyber-Physical Systems in the Sense of Lyapunov with KeYmaera." In 2021 28th Conference of Open Innovations Association (FRUCT). IEEE, 2021. http://dx.doi.org/10.23919/fruct50888.2021.9347586.

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

Gerbet, Daniel, and Klaus Robenack. "Proving Asymptotic Stability with LaSalle’s Invariance Principle: On the Automatic Computation of Invariant Sets Using Quantifier Elimination*." In 2020 7th International Conference on Control, Decision and Information Technologies (CoDIT). IEEE, 2020. http://dx.doi.org/10.1109/codit49905.2020.9263958.

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

Reports on the topic "Automatic proving"

1

Bellin, Gianluigi, and Jussi Ketonen. Experiments in Automatic Theorem Proving. Defense Technical Information Center, 1986. http://dx.doi.org/10.21236/ada327449.

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

McCune, W. A case study in automated theorem proving: A difficult problem about commutators. Office of Scientific and Technical Information (OSTI), 1995. http://dx.doi.org/10.2172/27057.

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

Wos, L., and W. McCune. Searching for fixed point combinators by using automated theorem proving: A preliminary report. Office of Scientific and Technical Information (OSTI), 1988. http://dx.doi.org/10.2172/6852789.

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

Herbert, George. How Can Middle-income Countries Improve Their Skills Systems Post- COVID-19? Institute of Development Studies (IDS), 2021. http://dx.doi.org/10.19088/k4d.2021.082.

Full text
Abstract:
Vocational training systems in middle-income countries are going to face multiple challenges in the post-COVID era, notably, challenges related to (1) automation; (2) the transition to a green economy, and (3) demographic pressures. Of these, automation - linked to the burgeoning ‘fourth industrial revolution’ that is set to transform the global economy - represents the most serious challenge and is the only one of the three challenges discussed in any depth in this paper. Whilst estimates of the likely scale of automation in the coming years and decades vary widely, it appears likely that wav
APA, Harvard, Vancouver, ISO, and other styles
5

Cai, Hubo, JungHo Jeon, Xin Xu, Yuxi Zhang, and Liu Yang. Automating the Generation of Construction Checklists. Purdue University, 2020. http://dx.doi.org/10.5703/1288284317273.

Full text
Abstract:
Construction inspection is a critical component of INDOT’s quality assurance (QA) program. Upon receiving an inspection notice/assignment, INDOT inspectors review the plans and specifications to identify the construction quality requirements and conduct their inspections accordingly. This manual approach to gathering inspection requirements from textual documents is time-consuming, subjective, and error-prone. This project addresses this critical issue by developing an inspection requirements database along with a set of tools to automatically gather the inspection requirements and provide fie
APA, Harvard, Vancouver, ISO, and other styles
6

Bell, Jack, Rik Law, Howell Li, Ben Anderson, and Darcy M. Bullock. New Opportunities for Automated Pedestrian Performance Measures. Purdue University, 2021. http://dx.doi.org/10.5703/1288284317351.

Full text
Abstract:
Pedestrian safety is an important concern when evaluating intersections. Previous literature has shown that exclusive pedestrian phases improve safety, but at the expense of imposing greater pedestrian and motorist delay. However, outside of crash data, there are no easily implementable performance measures for pedestrians at traffic signals. This study proposes two performance metrics: (1) a time-to-jaywalk measure, and (2) the Conflict Occupancy Ratio (COR) for evaluating concurrent pedestrian signal phasing with turning vehicles. The COR quantifies conflicts between turning vehicles and ped
APA, Harvard, Vancouver, ISO, and other styles
7

DiJoseph, Patricia, Brian Tetreault, and Marin Kress. AIS data case Study : identifying AIS coverage gaps on the Ohio River in CY2018. Engineer Research and Development Center (U.S.), 2021. http://dx.doi.org/10.21079/11681/40886.

Full text
Abstract:
This Coastal and Hydraulics Engineering Technical Note (CHETN) describes a method for evaluating the received coverage from Automatic Identification System (AIS) shore sites and the availability of historic vessel position reports along the Ohio River. The network of AIS shoreside sites installed and operated by the US Army Corps of Engineers (USACE) and the US Coast Guard (USCG) receive information transmitted from vessels; however, reception of these transmissions is generally line-of-sight between the vessel and the AIS site antenna. Reception may also be affected by factors such as the qua
APA, Harvard, Vancouver, ISO, and other styles
8

Rodier, Caroline, Andrea Broaddus, Miguel Jaller, Jeffery Song, Joschka Bischoff, and Yunwan Zhang. Cost-Benefit Analysis of Novel Access Modes: A Case Study in the San Francisco Bay Area. Mineta Transportation Institute, 2020. http://dx.doi.org/10.31979/mti.2020.1816.

Full text
Abstract:
The first-mile, last-mile problem is a significant deterrent for potential transit riders, especially in suburban neighborhoods with low density. Transit agencies have typically sought to solve this problem by adding parking spaces near transit stations and adding stops to connect riders to fixed-route transit. However, these measures are often only short-term solutions. In the last few years, transit agencies have tested whether new mobility services, such as ridehailing, ridesharing, and microtransit, can offer fast, reliable connections to and from transit stations. However, there is limite
APA, Harvard, Vancouver, ISO, and other styles
9

Cook, Stephen, and Loyd Hook. Developmental Pillars of Increased Autonomy for Aircraft Systems. ASTM International, 2020. http://dx.doi.org/10.1520/tr2-eb.

Full text
Abstract:
Increased automation for aircraft systems holds the promise to increase safety, precision, and availability for manned and unmanned aircraft. Specifically, established aviation segments, such as general aviation and light sport, could utilize increased automation to make significant progress towards solving safety and piloting difficulties that have plagued them for some time. Further, many emerging market segments, such as urban air mobility and small unmanned (e.g., small parcel delivery with drones) have a strong financial incentive to develop increased automation to relieve the pilot workl
APA, Harvard, Vancouver, ISO, and other styles
10

Arhin, Stephen, Babin Manandhar, Hamdiat Baba Adam, and Adam Gatiba. Predicting Bus Travel Times in Washington, DC Using Artificial Neural Networks (ANNs). Mineta Transportation Institute, 2021. http://dx.doi.org/10.31979/mti.2021.1943.

Full text
Abstract:
Washington, DC is ranked second among cities in terms of highest public transit commuters in the United States, with approximately 9% of the working population using the Washington Metropolitan Area Transit Authority (WMATA) Metrobuses to commute. Deducing accurate travel times of these metrobuses is an important task for transit authorities to provide reliable service to its patrons. This study, using Artificial Neural Networks (ANN), developed prediction models for transit buses to assist decision-makers to improve service quality and patronage. For this study, we used six months of Automati
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Automatic proving' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography