Остановите войну!
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 102 matches
- 2024
- Ari Karchmer:
Distributional PAC-Learning from Nisan's Natural Proofs. ITCS 2024: 68:1-68:23 - 2023
- Charles Staats:
Positional Notation for Natural Numbers in an Arbitrary Base. Arch. Formal Proofs 2023 (2023) - Zayne Sprague, Kaj Bostrom, Swarat Chaudhuri, Greg Durrett:
Deductive Additivity for Planning of Natural Language Proofs. CoRR abs/2307.02472 (2023) - Ari Karchmer:
Distributional PAC-Learning from Nisan's Natural Proofs. CoRR abs/2310.03641 (2023) - Lasha Abzianidze:
Formal Proofs as Structured Explanations: Proposing Several Tasks on Explainable Natural Language Inference. CoRR abs/2311.08637 (2023) - Ari Karchmer:
Average-Case PAC-Learning from Nisan's Natural Proofs. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- Igor C. Oliveira, Rahul Santhanam, Roei Tell:
Expander-Based Cryptography Meets Natural Proofs. Comput. Complex. 31(1): 4 (2022) - Edward Hermann Haeusler:
Exponentially huge natural deduction proofs are redundant: Preliminary results on M⊃. FLAP 9(1): 287-326 (2022) - Lijie Chen, Shuichi Hirahara, Igor Carboni Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
Beyond Natural Proofs: Hardness Magnification and Locality. J. ACM 69(4): 25:1-25:49 (2022) - Michael Giancola, Selmer Bringsjord, Naveen Sundar Govindarajulu:
Toward Generating Natural-Language Explanations of Modal-Logic Proofs. AGI 2022: 220-230 - Kaiyu Yang, Jia Deng, Danqi Chen:
Generating Natural Language Proofs with Verifier-Guided Search. EMNLP 2022: 89-105 - Kaiyu Yang, Jia Deng, Danqi Chen:
Generating Natural Language Proofs with Verifier-Guided Search. CoRR abs/2205.12443 (2022) - 2021
- Davide Catta:
Les preuves vues comme des jeux et réciproquement: sémantique dialogique de langages naturel ou logiques. (Proofs as games and games as proofs: dialogical semantics of logical and natural languages). University of Montpellier, France, 2021 - Ben Lee Volk:
Guest Column: Algebraic Natural Proofs Ben Lee Volk. SIGACT News 52(4): 56-73 (2021) - Oyvind Tafjord, Bhavana Dalvi, Peter Clark:
ProofWriter: Generating Implications, Proofs, and Abductive Statements over Natural Language. ACL/IJCNLP (Findings) 2021: 3621-3634 - 2020
- Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
On the Existence of Algebraically Natural Proofs. FOCS 2020: 870-880 - Lijie Chen, Shuichi Hirahara, Igor C. Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
Beyond Natural Proofs: Hardness Magnification and Locality. ITCS 2020: 70:1-70:48 - Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret:
Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative? STOC 2020: 54-67 - Edward Hermann Haeusler:
Exponentially Huge Natural Deduction proofs are Redundant: Preliminary results on M⊃. CoRR abs/2004.10659 (2020) - Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
On the Existence of Algebraically Natural Proofs. CoRR abs/2004.14147 (2020) - Edward Hermann Haeusler:
On the Intrinsic Redundancy in Huge Natural Deduction proofs II: Analysing M⊃ Super-Polynomial Proofs. CoRR abs/2009.09802 (2020) - Oyvind Tafjord, Bhavana Dalvi Mishra, Peter Clark:
ProofWriter: Generating Implications, Proofs, and Abductive Statements over Natural Language. CoRR abs/2012.13048 (2020) - Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
On the Existence of Algebraically Natural Proofs. Electron. Colloquium Comput. Complex. TR20 (2020) - 2019
- Shawn Standefer:
Translations Between Gentzen-Prawitz and Jaśkowski-Fitch Natural Deduction Proofs. Stud Logica 107(6): 1103-1134 (2019) - Igor Carboni Oliveira, Rahul Santhanam, Roei Tell:
Expander-Based Cryptography Meets Natural Proofs. ITCS 2019: 18:1-18:14 - Markus Bläser, Christian Ikenmeyer, Vladimir Lysikov, Anurag Pandey, Frank-Olaf Schreyer:
Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory. CoRR abs/1911.02534 (2019) - Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret:
Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture: Can a Natural Number be Negative? CoRR abs/1911.06738 (2019) - Lijie Chen, Shuichi Hirahara, Igor C. Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
Beyond Natural Proofs: Hardness Magnification and Locality. CoRR abs/1911.08297 (2019) - Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret:
Semi-Algebraic Proofs, IPS Lower Bounds and the $\tau$-Conjecture: Can a Natural Number be Negative? Electron. Colloquium Comput. Complex. TR19 (2019) - Igor Carboni Oliveira, Lijie Chen, Shuichi Hirahara, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
Beyond Natural Proofs: Hardness Magnification and Locality. Electron. Colloquium Comput. Complex. TR19 (2019)
skipping 72 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-04-25 06:56 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