131,572 research outputs found
Ad Cap. XXI. Comma 22. D. Johannis Exercitatio Philologica Secunda, Bartoldo Nihusio, Sacerdoti Pontificio Opposita
No full textInq[ue] illustri Academia Wittebergensi publice ad disputandum proposita a M. Johanne Ernesto Gerhardo ... Respondente M. Jacobo Tentzelio Greussensi Thur. Habebitur in Auditorio Philosophorum a. d. XXIII. Ianuarii ...Forts. von: Gerhard, Johann Ernst: ad Comma 22. Capitis XXI. D. Johannis Exercitatio Philologica, Bartoldo Nihusio Sacerdoti Pontificio Opposita, 1649. - Forts. u.d.T.: Gerhard, Johann Ernst: ad Cap. XXI. Comma 22. D. Johannis Exercitatio Philologica Tertia, Bartoldo Nihusio Sacerdoti Pontificio opposita, 1650Vorlageform des Erscheinungsvermerks: Wittebergae, Typis Jobi Wilhelmi Fincelii, Anno MDCL
ad Cap. XXI. Comma 22. D. Johannis Exercitatio Philologica Tertia, Bartoldo Nihusio Sacerdoti Pontificio opposita
No full textinq[ue] illustri Academia Wittebergensi publice ad disputandum proposita a M. Johanne Ernesto Gerhardo Ienensi, Coll. Philosoph. Adiuncto. Respondente Tobia Magen, Greussensi. Habebitur in Auditorio Philosophorum a. d. XXIII. MartiiForts. von: Gerhard, Johann Ernst: Ad Cap. XXI. Comma 22. D. Johannis Exercitatio Philologica Secunda, Bartoldo Nihusio, Sacerdoti pontificio Opposita, 1650Vorlageform des Erscheinungsvermerks: Wittebergae, Typis Johannis Haken, MDCL
Proceedings of the 9th International Workshop On User Interfaces for Theorem Provers (UITP10)
No full textThis volume contains selected papers from the 9th International Workshop On User Interfaces for Theorem Provers (UITP10). UITP10 was held as a one-day satellite workshop of the Federated Logic Conference (FLOC’10) in Edinburgh, UK, on the 15th July 2010
The nature of WTO arbitration on retaliation
No full textThis volume assesses the law, econmics and politics of trade sanctions in the light of more than ten years of operation of the WTO dispute settlement system, thanks to more than 30 contributions from leading academics, trade diplomats and practitioner
The crystal structure of zeolite barrerite dehydrated in air at 400-450°C
No full textThe crystal structure of the zeolite barrerite dehydrated at 400-450 degrees C in air (barrerite D of Alberti and Vezzalini [1]) has been solved by X-ray single crystal determination. The cell parameters are a = 12.969(3) angstrom, b = 16.971(4) angstrom, c = 16.319(3) angstrom, vol = 3592(j) angstrom(3), with a volume contraction of 18.9%. By firing, the crystal loses its symmetry centre and the space group changes from Amma (n. 63) to the new A2(1)ma (n. 36). Perpendicular to the b axis, barrerite D is made up of a sequence of zones dense with T(Si/Al) and O atoms which alternate with zones having a low density of these atoms and corresponding to the symmetry plane. Narrow channels are present in the symmetry plane, while cages characteristics of natural barrerite are absent. This is the first occurrence of a dehydrated Si-zeolite with a structure that differs from the original
Intelligent Computer Mathematics - 14th International Conference, CICM 2021, Timisoara, Romania, July 26–31, 2021, Proceedings
No full textWith the continuing, rapid progress of digital methods in communications, knowledge
representation, processing, and discovery, the unique character and needs of mathematical information require unique approaches. Its specialized representations and
capacity for creation and proof, both automatically and formally as well as manually,
set mathematical knowledge apart.
The Conference on Intelligent Computer Mathematics (CICM) was initially formed
in 2008 as a joint meeting of communities involved in computer algebra systems,
automated theorem provers, and mathematical knowledge management, as well as
those involved in a variety of aspects of scientific document archives. It has offered a
venue for discussing, developing, and integrating the diverse, sometimes eclectic,
approaches and research. Since 2008, CICM has been held annually: Birmingham (UK,
2008), Grand Bend (Canada, 2009), Paris (France, 2010), Bertinoro (Italy, 2011),
Bremen (Germany, 2012), Bath (UK, 2013), Coimbra (Portugal, 2014),
Washington D. C. (USA, 2015), Bialystok (Poland, 202016), Edinburgh (UK, 2017),
Linz (Austria, 2018), Prague (Czech Republic, 2019) and Bertinoro (Italy, 2020). This
latter edition, which was originally scheduled to be held in Bertinoro, Italy, was hosted
online due to the COVID-19 pandemic. This year’s meeting was supposed to be held in
Timisoara, Romania, but again due to the pandemic, it was held online (July 26–31,
2021).
This year’s meeting exposed advances in formalizations, automatic theorem proving, applications of machine learning to mathematical documents and proof search,
search and classifications of mathematical documents, teaching and geometric reasoning, and logic and systems, among other topics. This volume contains the contributions to this conference. From 38 formal submissions, the Program Committee
(PC) accepted 20 papers including 12 full research papers, 7 shorter papers describing
software systems or datasets and 1 paper highlighting development of systems and
tools in the last year. All papers were reviewed by at least three PC members or
external reviewers. The reviews were single-blind and included a response period in
which the authors could respond and clarify points raised by the reviewers. In addition
to the main sessions, the conference included a doctoral program, chaired by Yasmine
Sharoda, which provided a forum for PhD students to present their research and get
advice from senior members of the community. Additionally, the following workshops
were scheduled:
– The 31st OpenMath Workshop, organized by James Davenport and Michael
Kohlhase.
– The 2nd Workshop on Natural Formal Mathematics (NatFoM 2021), organized
by Peter Koepke and Dennis Müller.
– The 5th Workshop on Formal Mathematics for Mathematicians (FMM 2021),
organized by Jasmine Blanchette and Adam Naumowicz.
– The 2nd Workshop on Formal Verification of Physical Systems (FVPS 2021),
organized by Sofiene Tahar, Osman Hasan and Adnan Rashid.
– The 13th Workshop on Mathematical User Interaction (MathUI 2021), organized by
Andrea Kohlhase.
Finally, the conference included four invited talks:
– Alessandro Cimatti (Fondazione Bruno Kessler, Italy): “Logic at work, and some
research challenges for computer mathematics”.
– Michael Kohlhase (FAU Erlangen-Nürnberg, Germany): “Referential Semantics – a
Concept for Bridging between Representations of mathematical/technical Documents and Knowledge”.
– Laura Kovacs (TU Vienna, Austria): “Induction in Saturation-Based Reasoning”.
– Angus McIntyre (Emeritus Professor, Queen Mary University of London, UK):
“Doing classical number theory in weak axiomatic systems”.
A successful conference is due to the efforts of many people. We thank Madalina
Erascu and her colleagues at the West University of Timisoara, Romania, for the
difficult task of organizing a conference with the expectation of it being held face to
face but with the dynamics of COVID-19 making it difficult to accommodate in person
meetings. We are grateful to Serge Autexier for his publicity work. We also thank the
authors of submitted papers, the PC for their reviews, and the organizers of the
workshops, as well as the invited speakers and the participants of the conference.
June 2021 F. Kamareddine
C. Sacerdoti Coe
A Reinforcement Learning-based Control Strategy for Robust Interaction of Robotic Systems with Uncertain Environments
No full textThe Coq Library as a Theory Graph
No full textRepresenting proof assistant libraries in a way that allows further processing in other systems is becoming increasingly important. It is a critical missing link for integrating proof assistants both with each other or with peripheral tools such as IDEs or proof checkers. Such representations cannot be generated from library source files because they lack semantic enrichment (inferred types, etc.) and only the original proof assistant is able to process them. But even when using the proof assistant’s internal data structures, the complexities of logic, implementation, and library still make this very difficult. We describe one such representation, namely for the library of Coq, using OMDoc theory graphs as the target format. Coq is arguably the most formidable of all proof assistant libraries to tackle, and our work makes a significant step forward. On the theoretical side, our main contribution is a translation of the Coq module system into theory graphs. This greatly reduces the complexity of the library as the more arcane module system features are eliminated while preserving most of the structure. On the practical side, our main contribution is an implementation of this translation. It takes the entire Coq library, which is split over hundreds of decentralized repositories, and produces easily-reusable OMDoc files as output
- …
