scientific article

From MaRDI portal
Publication:3075247

zbMath1211.68369MaRDI QIDQ3075247

Adam Naumowicz, Adam Grabowski, Artur Korniłowicz

Publication date: 10 February 2011

Full work available at URL: http://jfr.cib.unibo.it/article/view/1980

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

The formalization of Vickrey auctions: a comparison of two approaches in Isabelle and TheoremaImproving stateful premise selection with transformersFour decades of {\textsc{Mizar}}. ForewordMechanizing complemented lattices within Mizar type systemMizAR 40 for Mizar 40Definitional expansions in Mizar. In memoriam of Andrzej Trybulec, a pioneer of computerized formalizationAutomating Boolean set operations in Mizar proof checking with the aid of an external SAT solverImproving legibility of formal proofs based on the close reference principle is NP-hardJEFL: joint embedding of formal proof librariesVampire with a brain is a good ITP hammerReadable Formalization of Euler’s Partition Theorem in MizarMizar: State-of-the-art and BeyondDocumentation Generator Focusing on Symbols for the HTML-ized Mizar LibraryTools for MML Environment Analysis\textsf{lazyCoP}: lazy paramodulation meets neurally guided searchThe Proof Certifier CheckersNew Developments in Parsing MizarA learning-based fact selector for Isabelle/HOLThe role of the Mizar mathematical library for interactive proof development in MizarChecking ProofsAutomating formalization by statistical and semantic parsing of mathematicsProofLang: the language of arXiv proofsExtending numeric automation for number theory formalizations in MizarTargeted configuration of an SMT solverEliciting implicit assumptions of Mizar proofs by property omissionMethods of lemma extraction in natural deduction proofsATP and presentation service for Mizar formalizationsThe Mizar Mathematical Library in OMDoc: translation and applicationsOn rewriting rules in MizarCustom automations in MizarRecycling proof patterns in Coq: case studiesLearning-assisted theorem proving with millions of lemmasCan an A.I. win a medal in the mathematical olympiad? – Benchmarking mechanized mathematics on pre-university problems1Hammering Mizar by Learning Clause Guidance (Short Paper).Formalizing Lattice-Theoretical Aspects of Rough and Fuzzy SetsA consistent foundation for Isabelle/HOLFlexary connectives in MizarTheorem Proving in Large Formal Mathematics as an Emerging AI FieldFormalization of the fundamental group in untyped set theory using auto2Calculational relation-algebraic proofs in the teaching tool \textsc{CalcCheck}mizar-items: Exploring Fine-Grained Dependencies in the Mizar Mathematical LibraryInitial Comparison of Formal Approaches to Fuzzy and Rough SetsAccessing the Mizar Library with a Weakly Strict Mizar ParserExtracting Higher-Order Goals from the Mizar Mathematical LibraryRace Against the Teens – Benchmarking Mechanized Math on Pre-university ProblemsMizarFrom Types to Sets by Local Type Definitions in Higher-Order LogicThe Teaching Tool CalcCheck A Proof-Checker for Gries and Schneider’s “Logical Approach to Discrete Math”Semantics of Mizar as an Isabelle object logicAutomated Improving of Proof Legibility in the Mizar SystemSAT-Enhanced Mizar Proof CheckingPremise selection for mathematics by corpus analysis and kernel methods


Uses Software