Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 756 matches
- 2023
- Jesús Aransay, Laureano Lambán, Julio Rubio:
Evasiveness Through Binary Decision Diagrams. CICM 2023: 37-52 - Mauricio Ayala-Rincón, Maribel Fernández, Gabriel Ferreira Silva, Temur Kutsia, Daniele Nantes-Sobrinho:
Nominal AC-Matching. CICM 2023: 53-68 - Jonas Bayer, Alexey Gonus, Christoph Benzmüller, Dana S. Scott:
Category Theory in Isabelle/HOL as a Basis for Meta-logical Investigation. CICM 2023: 69-83 - Marc Berges, Jonas Betzendahl, Abhishek Chugh, Michael Kohlhase, Dominic Lohr, Dennis Müller:
Learning Support Systems Based on Mathematical Knowledge Management. CICM 2023: 84-97 - Marco B. Caminati:
Isabelle Formalisation of Original Representation Theorems. CICM 2023: 98-112 - Robert M. Corless, David J. Jeffrey, Azar Shakoori:
Teaching Linear Algebra in a Mechanized Mathematical Environment. CICM 2023: 113-129 - James Harold Davenport:
Proving an Execution of an Algorithm Correct? CICM 2023: 255-269 - Neeraj Gangwar, Nickvash Kani:
Highlighting Named Entities in Input for Auto-formulation of Optimization Problems. CICM 2023: 130-141 - Henry Hammer, Nanako Noda, Christopher A. Stone:
ProofLang: The Language of arXiv Proofs. CICM 2023: 285-290 - Simone Heisinger, Martina Seidl:
True Crafted Formula Families for Benchmarking Quantified Satisfiability Solvers. CICM 2023: 291-296 - John Hester, Briland Hitaj, Grant O. Passmore, Sam Owre, Natarajan Shankar, Eric Yeh:
An Augmented MetiTarski Dataset for Real Quantifier Elimination Using Machine Learning. CICM 2023: 297-302 - Fabian Huch, Yiannos Stathopoulos:
Formalization Quality in Isabelle. CICM 2023: 142-157 - Jan Jakubuv, Cezary Kaliszyk:
VizAR: Visualization of Automated Reasoning Proofs (System Description). CICM 2023: 303-308 - Aabid Seeyal Abdul Kharim, T. V. H. Prathamesh, Shweta Rajiv, Rishi Vyas:
Formalizing Free Groups in Isabelle/HOL: The Nielsen-Schreier Theorem and the Conjugacy Problem. CICM 2023: 158-173 - Adam Naumowicz:
Extending Numeric Automation for Number Theory Formalizations in Mizar. CICM 2023: 309-314 - Lawrence C. Paulson:
Large-Scale Formal Proof for the Working Mathematician - Lessons Learnt from the ALEXANDRIA Project. CICM 2023: 3-15 - Florian Rabe, Franziska Weber:
Morphism Equality in Theory Graphs. CICM 2023: 174-189 - Florian Rabe, Stephen M. Watt:
Extracting Theory Graphs from Aldor Libraries. CICM 2023: 315-320 - Jan Frederik Schaefer, Michael Kohlhase:
Towards an Annotation Standard for STEM Documents - Datasets, Benchmarks, and Spotters. CICM 2023: 190-205 - Martina Seidl:
Never Trust Your Solver: Certification for SAT and QBF. CICM 2023: 16-33 - Jeffrey O. Shallit:
Proving Results About OEIS Sequences with Walnut. CICM 2023: 270-282 - Mohit Tekriwal, Andrew W. Appel, Ariel E. Kellison, David Bindel, Jean-Baptiste Jeannin:
Verified Correctness, Accuracy, and Convergence of a Stationary Iterative Linear Solver: Jacobi Method. CICM 2023: 206-221 - Eric Wieser:
Multiple-Inheritance Hazards in Dependently-Typed Algebraic Hierarchies. CICM 2023: 222-236 - Eric Yeh, Briland Hitaj, Sam Owre, Maena Quemener, Natarajan Shankar:
CoProver: A Recommender System for Proof Construction. CICM 2023: 237-251 - Jasmin Blanchette, James H. Davenport, Peter Koepke, Michael Kohlhase, Andrea Kohlhase, Adam Naumowicz, Dennis Müller, Yasmine Sharoda, Claudio Sacerdoti Coen:
Joint Proceedings of the FMM, FVPS, MathUI,NatFoM, and OpenMath Workshops, Doctoral Program, and Work in Progress at the Conference on Intelligent Computer Mathematics 2021 co-located with the 14th Conference on Intelligent Computer Mathematics (CICM 2021), Virtual Event, Timisoara, Romania, July 26 - 31, 2021. CEUR Workshop Proceedings 3377, CEUR-WS.org 2023 [contents] - Catherine Dubois, Manfred Kerber:
Intelligent Computer Mathematics - 16th International Conference, CICM 2023, Cambridge, UK, September 5-8, 2023, Proceedings. Lecture Notes in Computer Science 14101, Springer 2023, ISBN 978-3-031-42752-7 [contents] - 2022
- Katja Bercic, Filip Koprivec:
Making the Census of Cubic Vertex Transitive Graphs Searchable and FAIR. CICM 2022: 323-328 - Ahmed Bhayat, Pamina Georgiou, Clemens Eisenhofer, Laura Kovács, Giles Reger:
Lemmaless Induction in Trace Logic. CICM 2022: 191-208 - Alan Bundy, Kwabena Nuamah:
Unified Decomposition-Aggregation (UDA) Rules: Dynamic, Schematic, Novel Axioms. CICM 2022: 209-221 - Elif Deniz, Adnan Rashid, Osman Hasan, Sofiène Tahar:
On the Formalization of the Heat Conduction Problem in HOL. CICM 2022: 21-37
skipping 726 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-08-14 23:29 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint