Relevant bibliographies by topics / Automated Theorem Prover

Contents

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

Academic literature on the topic 'Automated Theorem Prover'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 2025

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 'Automated Theorem Prover.'

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 "Automated Theorem Prover"

1

Ophelders, W. M. J., and H. C. M. De Swart. "Tableaux Versus Resolution a Comparison." Fundamenta Informaticae 18, no. 2-4 (1993): 109–27. http://dx.doi.org/10.3233/fi-1993-182-403.

Full text
Abstract:
In [13] we have presented the ideas underlying an automated theorem prover based on tableaux extended with unification under restrictions. In [6] a full description of an implementation of this theorem prover in PROLOG is given. In this paper we first shortly repeat the main ideas, referring to [13] for more details. Next we present the test results of our theorem prover mainly with respect to Pelletier’s 75 problems for testing automatic theorem provers ([7]). We also give a comparison of our results with the results obtained by the resolution-based theorem provers PCPROVE and OTTER and by th
APA, Harvard, Vancouver, ISO, and other styles
2

Crouse, Maxwell, Ibrahim Abdelaziz, Bassem Makni, et al. "A Deep Reinforcement Learning Approach to First-Order Logic Theorem Proving." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 7 (2021): 6279–87. http://dx.doi.org/10.1609/aaai.v35i7.16780.

Full text
Abstract:
Automated theorem provers have traditionally relied on manually tuned heuristics to guide how they perform proof search. Deep reinforcement learning has been proposed as a way to obviate the need for such heuristics, however, its deployment in automated theorem proving remains a challenge. In this paper we introduce TRAIL, a system that applies deep reinforcement learning to saturation-based theorem proving. TRAIL leverages (a) a novel neural representation of the state of a theorem prover and (b) a novel characterization of the inference selection process in terms of an attention-based action
APA, Harvard, Vancouver, ISO, and other styles
3

WANG, Zhen-Ming, Yi-Yun CHEN, and Zhi-Fang WANG. "Automated Theorem Prover for Pointer Logic." Journal of Software 20, no. 8 (2009): 2037–50. http://dx.doi.org/10.3724/sp.j.1001.2009.00572.

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

Vor der Brück, Tim, and Hermann Helbig. "Meronymy Extraction Using An Automated Theorem Prover." Journal for Language Technology and Computational Linguistics 25, no. 1 (2010): 57–81. http://dx.doi.org/10.21248/jlcl.25.2010.129.

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

WOLF, ANDREAS, and REINHOLD LETZ. "STRATEGY PARALLELISM IN AUTOMATED THEOREM PROVING." International Journal of Pattern Recognition and Artificial Intelligence 13, no. 02 (1999): 219–45. http://dx.doi.org/10.1142/s0218001499000136.

Full text
Abstract:
Automated theorem provers use search strategies. Unfortunately, there is no unique strategy which is uniformly successful on all problems. This motivates us to apply different strategies in parallel, in a competitive manner. In this paper, we discuss properties, problems, and perspectives of strategy parallelism in theorem proving. We develop basic concepts like the complementarity and the overlap value of strategy sets. Some of the problems such as initial strategy selection and run-time strategy exchange are discussed in more detail. The paper also contains the description of an implementati
APA, Harvard, Vancouver, ISO, and other styles
6

Jan, Jakubuv, and Kaliszyk Cezary. "Relaxed Weighted Path Order in Theorem Proving." Mathematics in Computer Science 14, no. 3 (2020): 657——670. https://doi.org/10.1007/s11786-020-00474-0.

Full text
Abstract:
We propose an extension of the automated theorem prover E by the weighted path order- ing (WPO). Weighted path ordering is theoretically stronger than all the orderings used in E Prover, however its parametrization is more involved than those normally used in automated reasoning. In particular, it depends on a term algebra. We integrate the ordering in E Prover and perform an eval- uation on the standard theorem proving benchmarks. The ordering is complementary to the ones used in E prover so far. Furthermore, first-time presented here, we propose a relaxed variant of the weighted path order a
APA, Harvard, Vancouver, ISO, and other styles
7

Elnadi, Tarek Mohamed, and Albert Hoogewijs. "KARNAK {$\star$}: an automated theorem prover for PPC {$\star$}." Bulletin of the Belgian Mathematical Society - Simon Stevin 2, no. 5 (1995): 541–71. http://dx.doi.org/10.36045/bbms/1103408677.

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

KANSO, KARIM, and ANTON SETZER. "A light-weight integration of automated and interactive theorem proving." Mathematical Structures in Computer Science 26, no. 1 (2014): 129–53. http://dx.doi.org/10.1017/s0960129514000140.

Full text
Abstract:
In this paper, aimed at dependently typed programmers, we present a novel connection between automated and interactive theorem proving paradigms. The novelty is that the connection offers a better trade-off between usability, efficiency and soundness when compared to existing techniques. This technique allows for a powerful interactive proof framework that facilitates efficient verification of finite domain theorems and guided construction of the proof of infinite domain theorems. Such situations typically occur with industrial verification. As a case study, an embedding of SAT and CTL model c
APA, Harvard, Vancouver, ISO, and other styles
9

Cao, Feng, Yang Xu, Jun Liu, Shuwei Chen, and Xinran Ning. "CSE_E 1.0: An Integrated Automated Theorem Prover for First-Order Logic." Symmetry 11, no. 9 (2019): 1142. http://dx.doi.org/10.3390/sym11091142.

Full text
Abstract:
First-order logic is an important part of mathematical logic, and automated theorem proving is an interdisciplinary field of mathematics and computer science. The paper presents an automated theorem prover for first-order logic, called C S E _ E 1.0, which is a combination of two provers contradiction separation extension (CSE) and E, where CSE is based on the recently-introduced multi-clause standard contradiction separation (S-CS) calculus for first-order logic and E is the well-known equational theorem prover for first-order logic based on superposition and rewriting. The motivation of the
APA, Harvard, Vancouver, ISO, and other styles
10

Baghdasaryan, Ashot, and Hovhannes Bolibekyan. "On Recurrent Neural Network Based Theorem Prover For First Order Minimal Logic." JUCS - Journal of Universal Computer Science 27, no. (11) (2021): 1193–202. https://doi.org/10.3897/jucs.76563.

Full text
Abstract:
There are three main problems for theorem proving with a standard cut-free system for the first order minimal logic. The first problem is the possibility of looping. Secondly, it might generate proofs which are permutations of each other. Finally, during the proof some choice should be made to decide which rules to apply and where to use them. New systems with history mechanisms were introduced for solving the looping problems of automated theorem provers in the first order minimal logic. In order to solve the rule selection problem, recurrent neural networks are deployed and they are used to
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Automated Theorem Prover"

1

Ridge, Thomas. "Enhancing the expressivity and automation of an interactive theorem prover in order to verify multicast protocols." Thesis, University of Edinburgh, 2006. http://hdl.handle.net/1842/1461.

Full text
Abstract:
This thesis was motivated by a case study involving the formalisation of arguments that simplify the verification of tree-oriented multicast protocols. As well as covering the case study itself, it discusses our solution to problems we encountered concerning expressivity and automation. The expressivity problems related to the need for theory interpretation. We found the existing Locale and axiomatic type class mechanisms provided by the Isabelle theorem prover we were using to be inadequate. This led us to develop a new prototype implementation of theory interpretation. To support this implem
APA, Harvard, Vancouver, ISO, and other styles
2

Kirschenbaum, Jason P. "Investigations in Automating Software Verification." The Ohio State University, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=osu1306862918.

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

Mukhopadhyay, Trisha. "A Flexible, Natural Deduction, Automated Reasoner for Quick Deployment of Non-Classical Logic." Scholar Commons, 2019. https://scholarcommons.usf.edu/etd/7862.

Full text
Abstract:
Automated Theorem Provers (ATP) are software programs which carry out inferences over logico-mathematical systems, often with the goal of finding proofs to some given theorem. ATP systems are enormously powerful computer programs, capable of solving immensely difficult problems. Currently, many automated theorem provers exist like E, vampire, SPASS, ACL2, Coq etc. However, all the available theorem provers have some common problems: (1) Current ATP systems tend not to try to find proofs entirely on their own. They need help from human experts to supply lemmas, guide the proof, etc. (2) There i
APA, Harvard, Vancouver, ISO, and other styles
4

Adcock, Bruce M. "Working Towards the Verified Software Process." The Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1293463269.

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

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
6

El, haddad Yacine. "Integrating Automated Theorem Provers in Proof Assistants." Electronic Thesis or Diss., université Paris-Saclay, 2021. http://www.theses.fr/2021UPASG052.

Full text
Abstract:
Lambdapi est un assistant de preuve qui permet à l’utilisateur la construction d’une preuve d’un théorème donné dans un langage universel basé sur le lambda-pi-calcul. Le but de cette thèse est de rajouter de l’automatisation à Lambdapi pour faire gagner du temps à l’utilisateur. Cette thèse présente trois contributions liées à l’intégration des démonstrateurs automatiques dans les assistants de preuve. La première contribution consiste en l’implémentation d’une tactique qui fait appel au démonstrateurs automatiques depuis Lambdapi à travers une plateforme tiers appelé Why3. Généralement, les
APA, Harvard, Vancouver, ISO, and other styles
7

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
8

Zhang, Xueying. "Rough set theory based automatic text categorization and the handling of semantic heterogeneity." Bonn Informationszentrum Sozialwiss, 2006. http://deposit.ddb.de/cgi-bin/dokserv?id=2704442&prov=M&dokv̲ar=1&doke̲xt=htm.

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

Braun, David. "Approche combinatoire pour l'automatisation en Coq des preuves formelles en géométrie d'incidence projective." Thesis, Strasbourg, 2019. http://www.theses.fr/2019STRAD020.

Full text
Abstract:
Ce travail de thèse s’inscrit dans le domaine de la preuve assistée par ordinateur et se place d'un point de vue méthodologique. L’objectif premier des assistants de preuves est de vérifier qu’une preuve écrite à la main est correcte; la question ici est de savoir comment à l’intérieur d’un tel système, il est possible d'aider un utilisateur à fabriquer une preuve formelle du résultat auquel il s'intéresse. Ces questions autour de la vérification de preuves, en particulier en certification du logiciel, et au delà de leur traçabilité et de leur lisibilité sont en effet devenues prégnantes avec
APA, Harvard, Vancouver, ISO, and other styles
10

Stein, Shiromoto Humberto. "Stabilisation sous contraintes locales et globales." Phd thesis, Université de Grenoble, 2014. http://tel.archives-ouvertes.fr/tel-01023554.

Full text
Abstract:
Dans ce travail, deux problèmes issus de la théorie de la stabilité ont été étudiés: la synthèse de loi de commandes stabilisantes et l'analyse de la stabilité des systèmes interconnectés sous contraintes locales et globales. En ce qui concerne la synthèse, la problématique a été de concevoir une loi de commande pour les systèmes où la technique de Backstepping ne peut pas être appliquée pour stabiliser globalement l'origine mais s'avère utile pour stabiliser le système autour d'un ensemble désiré. Ensuite, il a été considéré le problème de concevoir une loi de commande qui stabilise localemen
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Automated Theorem Prover"

1

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

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

Paulson, Lawrence C. Isabelle: A generic theorem prover. Springer-Verlag, 1994.

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

Zohar, Manna, ed. STeP, the Stanford Temporal Prover. Dept. of Computer Science, Stanford University, 1994.

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

Laboratory, Argonne National, ed. Reference manual for the environmental theorem prover: An incarnation of AURA. Mathematics and Computer Science Division, Argonne National Laboratory, 1988.

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

Neĭman, V. S. Sistema PROVE--realizat͡s︡ii͡a︡ metoda vydelenii͡a︡ podt͡s︡eleĭ. In-t teoret. astronomii Akademii nauk SSSR, 1986.

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

1953-, Martin Ursula, and Wing Jeannette Marie, eds. First International Workshop on Larch: Proceedings of the First International Workshop on Larch, Dedham, Massachusetts, USA, 13-15 July 1992. Springer-Verlag, 1993.

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

IFIP, TC10/WG10 2. International Conference on Theorem Provers in Circuit Design: Theory Practice and Experience (1992 Nijmegen Netherlands). Theorem provers in circuit design: Proceedings of the IFIP TC10/WG10.2 International Conference on Theorem Provers in Circuit Design--Theory, Practice, and Experience, Nijmegen, The Netherlands, 22-24 June 1992. North-Holland, 1992.

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

Fuchs, Dirk. Cooperation in Heterogeneous Theorem Prover Networks. Ios Pr Inc, 2000.

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

Paulson, Lawrence C. Isabelle: A Generic Theorem Prover (Lecture Notes in Computer Science). Springer, 1994.

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

Paulson, Lawrence C. Isabelle: A Generic Theorem Prover (Lecture Notes in Computer Science). Springer, 1994.

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

Book chapters on the topic "Automated Theorem Prover"

1

Happe, Jens. "The modprof Theorem Prover." In Automated Reasoning. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45744-5_39.

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

Piepenbrock, Jelle, Tom Heskes, Mikoláš Janota, and Josef Urban. "Guiding an Automated Theorem Prover with Neural Rewriting." In Automated Reasoning. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-10769-6_35.

Full text
Abstract:
AbstractAutomated theorem provers (ATPs) are today used to attack open problems in several areas of mathematics. An ongoing project by Kinyon and Veroff uses Prover9 to search for the proof of the Abelian Inner Mapping (AIM) Conjecture, one of the top open conjectures in quasigroup theory. In this work, we improve Prover9 on a benchmark of AIM problems by neural synthesis of useful alternative formulations of the goal. In particular, we design the 3SIL (stratified shortest solution imitation learning) method. 3SIL trains a neural predictor through a reinforcement learning (RL) loop to propose
APA, Harvard, Vancouver, ISO, and other styles
3

Winterstein, Daniel, Alan Bundy, and Corin Gurr. "Dr.Doodle: A Diagrammatic Theorem Prover." In Automated Reasoning. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-25984-8_24.

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

Barker-Plummer, Dave, and Alex Rothenberg. "The GAZER theorem prover." In Automated Deduction—CADE-11. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-55602-8_212.

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

Newborn, Monty. "Theo:A Resolution—Refutation Theorem Prover." In Automated Theorem Proving. Springer New York, 2001. http://dx.doi.org/10.1007/978-1-4613-0089-2_9.

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

Newborn, Monty. "Herby: A Semantic—Tree Theorem Prover." In Automated Theorem Proving. Springer New York, 2001. http://dx.doi.org/10.1007/978-1-4613-0089-2_7.

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

De Lon, Adrian. "The Naproche-ZF Theorem Prover (Short Paper)." In Automated Reasoning. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-63498-7_7.

Full text
Abstract:
AbstractNaproche-ZF is a new experimental open-source natural theorem prover based on set theory; formalizations in Naproche-ZF are written in a controlled natural language embedded into "Image missing" and proof gaps are filled in with automated theorem provers. Naproche-ZF aims to scale natural theorem proving beyond chapter-sized formalizations. In contrast to the $$\mathbb {N}$$ N aproche system, the new system uses an extensible grammar-based approach, has more efficient proof automation, and enables larger interconnected formalizations based on a standard library.
APA, Harvard, Vancouver, ISO, and other styles
8

Lusk, Ewing L., William W. McCune, and John Slaney. "ROO: A parallel theorem prover." In Automated Deduction—CADE-11. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-55602-8_213.

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

Smallbone, Nicholas. "Twee: An Equational Theorem Prover." In Automated Deduction – CADE 28. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79876-5_35.

Full text
Abstract:
AbstractTwee is an automated theorem prover for equational logic. It implements unfailing Knuth-Bendix completion with ground joinability testing and a connectedness-based redundancy criterion. It came second in the UEQ division of CASC-J10, solving some problems that no other system solved. This paper describes Twee’s design and implementation.
APA, Harvard, Vancouver, ISO, and other styles
10

Wang, Dongming. "GEOTHER: A geometry theorem prover." In Automated Deduction — Cade-13. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61511-3_78.

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

Conference papers on the topic "Automated Theorem Prover"

1

Chen, Yizhou, Zeyu Sun, Guoqing Wang, and Dan Hao. "Gpass: A Goal-Adaptive Neural Theorem Prover Based on Coq for Automated Formal Verification." In 2025 IEEE/ACM 47th International Conference on Software Engineering (ICSE). IEEE, 2025. https://doi.org/10.1109/icse55347.2025.00116.

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

Zahidul Islam, Md, Ahmed Shah Mashiyat, Kashif Nizam Khan, and S. M. Masud Karim. "Towards a tableau based high performance automated theorem prover." In 2010 13th International Conference on Computer and Information Technology (ICCIT). IEEE, 2010. http://dx.doi.org/10.1109/iccitechn.2010.5723892.

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

Otten, Jens. "nanoCoP: Natural Non-clausal Theorem Proving." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/695.

Full text
Abstract:
Most efficient fully automated theorem provers implement proof search calculi that require the input formula to be in a clausal form, i.e. disjunctive or conjunctive normal form. The translation into clausal form introduces a significant overhead to the proof search and modifies the structure of the original formula. Translating a proof in clausal form back into a more readable non-clausal proof of the original formula is not straightforward. This paper presents a non-clausal automated theorem prover for classical first-order logic. It is based on a non-clausal connection calculus and implemen
APA, Harvard, Vancouver, ISO, and other styles
4

Sawada, Jun, and Erik Reeber. "ACL2SIX: A Hint used to Integrate a Theorem Prover and an Automated Verification Tool." In 2006 Formal Methods in Computer Aided Design. IEEE, 2006. http://dx.doi.org/10.1109/fmcad.2006.3.

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

Stratulat, Sorin. "SPIKE, an automatic theorem prover — revisited." In 2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 2020. http://dx.doi.org/10.1109/synasc51798.2020.00025.

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

Rocktäschel, Tim, and Sebastian Riedel. "Learning Knowledge Base Inference with Neural Theorem Provers." In Proceedings of the 5th Workshop on Automated Knowledge Base Construction. Association for Computational Linguistics, 2016. http://dx.doi.org/10.18653/v1/w16-1309.

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

Bouhoula, Adel, and Miki Hermann. "Primal Grammars Driven Automated Induction." In Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/361.

Full text
Abstract:
Automated induction is a powerful method for the validation of critical systems. However, the inductive proof process faces major challenges: it is undecidable and diverges even with small examples. Previous methods have proposed ad-hoc heuristics to speculate on additional lemmas that hopefully stop the divergence. Although these methods have succeeded in proving interesting theorems, they have significant limitations: in particular, they often fail to find appropriate lemmas, and the lemmas they provide may not be valid. We present a new method that allows us to perform inductive proofs in c
APA, Harvard, Vancouver, ISO, and other styles
8

Lele, Adway, Jayant Kirtane, and Ambuja Salgaonkar. "Siddhataa: Automatic theorem prover based on equational reasoning." In 2011 World Congress on Information and Communication Technologies (WICT). IEEE, 2011. http://dx.doi.org/10.1109/wict.2011.6141445.

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

Ansótegui, C., M. Bofill, F. Manyà, and M. Villaret. "Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers." In 2012 IEEE 42nd International Symposium on Multiple-Valued Logic (ISMVL). IEEE, 2012. http://dx.doi.org/10.1109/ismvl.2012.63.

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

Silvasi, Frantisek, and Martin Tomasek. "Fully automatic modular theorem prover with code generation support." In 2017 IEEE 14th International Scientific Conference on Informatics. IEEE, 2017. http://dx.doi.org/10.1109/informatics.2017.8327270.

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

Reports on the topic "Automated Theorem Prover"

1

Baader, Franz, and Ralf Küsters. Unification in a Description Logic with Transitive Closure of Roles. Aachen University of Technology, 2001. http://dx.doi.org/10.25368/2022.115.

Full text
Abstract:
Unification of concept descriptions was introduced by Baader and Narendran as a tool for detecting redundancies in knowledge bases. It was shown that unification in the small description logic FL₀, which allows for conjunction, value restriction, and the top concept only, is already ExpTime-complete. The present paper shows that the complexity does not increase if one additionally allows for composition, union, and transitive closure of roles. It also shows that matching (which is polynomial in FL₀) is PSpace-complete in the extended description logic. These results are proved via a reduction
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Automated Theorem Prover' for particular source types:
Journal articles Dissertations / Theses
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