default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Färber 0002
Person information
- affiliation: Universität Innsbruck, Austria
- affiliation: University Paris-Saclay, Gif-sur-Yvette, France
Other persons with the same name
- Michael Färber 0001
![[0000-0001-5458-8645]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-5458-8645")
(aka: Michael Faerber 0001, Michael Farber 0001) — Technical University (TU) Dresden, Germany (and 2 more) - Michael Faerber 0003 (aka: Michael Färber 0003) — Intel Mobile Communications GmbH, Munich, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j1]Michael Färber, Cezary Kaliszyk, Josef Urban:
Machine Learning Guidance for Connection Tableaux. J. Autom. Reason. 65(2): 287-320 (2021)
Conference and Workshop Papers
- 2023
- [c9]Michael Färber:
A Curiously Effective Backtracking Strategy for Connection Tableaux. AReCCa@TABLEAUX 2023: 23-40 - [c8]Michael Färber:
Terms for Efficient Proof Checking and Parsing. CPP 2023: 135-147 - 2022
- [c7]Michael Färber:
Safe, fast, concurrent proof checking for the lambda-pi calculus modulo rewriting. CPP 2022: 225-238 - 2019
- [c6]Michael Färber, Cezary Kaliszyk:
Certification of Nonclausal Connection Tableaux Proofs. TABLEAUX 2019: 21-38 - 2017
- [c5]Michael Färber, Cezary Kaliszyk, Josef Urban:
Monte Carlo Tableau Proof Search. CADE 2017: 563-579 - 2016
- [c4]Michael Färber, Cezary Kaliszyk:
No Choice: Reconstruction of First-order ATP Proofs without Skolem Functions. PAAR@IJCAR 2016: 24-31 - [c3]Michael Färber, Chad E. Brown:
Internal Guidance for Satallax. IJCAR 2016: 349-361 - 2015
- [c2]Michael Färber, Cezary Kaliszyk:
Random Forests for Premise Selection. FroCos 2015: 325-340 - [c1]Michael Färber, Cezary Kaliszyk:
Metis-based Paramodulation Tactic for HOL Light. GCAI 2015: 127-136
Informal and Other Publications
- 2024
- [i7]Michael Färber:
A formal specification of the jq language. CoRR abs/2403.20132 (2024) - 2023
- [i6]Michael Färber:
Denotational Semantics and a Fast Interpreter for jq. CoRR abs/2302.10576 (2023) - 2021
- [i5]Michael Färber:
Small, Fast, Concurrent Proof Checking for the lambda-Pi Calculus Modulo Rewriting. CoRR abs/2102.08766 (2021) - [i4]Michael Färber:
A Curiously Effective Backtracking Strategy for Connection Tableaux. CoRR abs/2106.13722 (2021) - 2018
- [i3]Michael Färber, Cezary Kaliszyk, Josef Urban:
Machine Learning Guidance and Proof Certification for Connection Tableaux. CoRR abs/1805.03107 (2018) - 2016
- [i2]Michael Färber, Chad E. Brown:
Internal Guidance for Satallax. CoRR abs/1605.09293 (2016) - [i1]Michael Färber, Cezary Kaliszyk, Josef Urban:
Monte Carlo Connection Prover. CoRR abs/1611.05990 (2016)
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.
last updated on 2025-03-08 01:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
