default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHans de Nivelle
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c24]Hans de Nivelle, Dina Muktubayeva:
Generating Tokenizers with Flat Automata. GandALF 2022: 66-80
2010 – 2019
- 2018
- [j13]Hans de Nivelle:
Subsumption Algorithms for Three-Valued Geometric Resolution. Log. Methods Comput. Sci. 14(4) (2018) - 2017
- [j12]Hans de Nivelle:
Theorem proving for classical logic with partial functions by reduction to Kleene logic. J. Log. Comput. 27(2): 509-548 (2017) - [i2]Hans de Nivelle:
Subsumption Algorithms for Three-Valued Geometric Resolution. CoRR abs/1703.02830 (2017) - 2016
- [c23]Hans de Nivelle:
Subsumption Algorithms for Three-Valued Geometric Resolution. IJCAR 2016: 257-272 - 2015
- [e2]Hans de Nivelle:
Automated Reasoning with Analytic Tableaux and Related Methods - 24th International Conference, TABLEAUX 2015, Wrocław, Poland, September 21-24, 2015. Proceedings. Lecture Notes in Computer Science 9323, Springer 2015, ISBN 978-3-319-24311-5 [contents] - 2014
- [c22]Hans de Nivelle:
Theorem Proving for Logic with Partial Functions Using Kleene Logic and Geometric Logic. ARQNL@IJCAR 2014: 71-86 - 2011
- [j11]Hans de Nivelle:
Classical Logic with Partial Functions. J. Autom. Reason. 47(4): 399-425 (2011) - 2010
- [c21]Hans de Nivelle:
Classical Logic with Partial Functions. IJCAR 2010: 203-217
2000 – 2009
- 2009
- [j10]Peter Baumgartner, Alexander Fuchs, Hans de Nivelle, Cesare Tinelli
:
Computing finite models by reduction to function-free clause logic. J. Appl. Log. 7(1): 58-74 (2009) - 2008
- [c20]Hans de Nivelle, Piotr Witkowski:
A Small Framework for Proof Checking. PAAR/ESHOL 2008 - 2006
- [c19]Hans de Nivelle, Jia Meng:
Geometric Resolution: A Proof Procedure Based on Finite Model Search. IJCAR 2006: 303-317 - 2005
- [j9]Hans de Nivelle:
Translation of resolution proofs into short first-order proofs without choice axioms. Inf. Comput. 199(1-2): 24-54 (2005) - [j8]Stéphane Demri, Hans de Nivelle:
Deciding Regular Grammar Logics with Converse Through First-Order Logic. J. Log. Lang. Inf. 14(3): 289-329 (2005) - [c18]Hans de Nivelle, Ruzica Piskac:
Verification of an Off-Line Checker for Priority Queues. SEFM 2005: 210-219 - [e1]Wolfgang Ahrendt, Peter Baumgartner, Hans de Nivelle, Silvio Ranise, Cesare Tinelli:
Selected Papers from the Workshops on Disproving, D@IJCAR 2004, and the Second International Workshop on Pragmatics of Decision Procedures, PDPAR@IJCAR 2004, Cork, Ireland, July 2004. Electronic Notes in Theoretical Computer Science 125(3), Elsevier 2005 [contents] - 2004
- [c17]Yevgeny Kazakov, Hans de Nivelle:
A Resolution Decision Procedure for the Guarded Fragment with Transitive Guards. IJCAR 2004: 122-136 - [c16]Wolfgang Ahrendt, Peter Baumgartner, Hans de Nivelle, Silvio Ranise, Cesare Tinelli:
Preface. D/PDPAR@IJCAR 2004: 1-2 - 2003
- [j7]Hans de Nivelle, Maarten de Rijke:
Deciding the guarded fragments by resolution. J. Symb. Comput. 35(1): 21-58 (2003) - [c15]Hans de Nivelle:
Translation of Resolution Proofs into Short First-Order Proofs without Choice Axioms. CADE 2003: 365-379 - [c14]Yevgeny Kazakov, Hans de Nivelle:
Subsumption of Concepts in FL0y for (Cyclic) Terminologies with Respect to Descriptive Semantics is PSPACE-complete. Description Logics 2003 - [i1]Stéphane Demri, Hans de Nivelle:
Deciding regular grammar logics with converse through first-order logic. CoRR cs.LO/0306117 (2003) - 2002
- [j6]Marc Bezem, Dimitri Hendriks, Hans de Nivelle:
Automated Proof Construction in Type Theory Using Resolution. J. Autom. Reason. 29(3-4): 253-275 (2002) - [c13]Hans de Nivelle:
Extraction of Proofs from the Clausal Normal Form Transformation. CSL 2002: 584-598 - 2001
- [j5]Carlos Areces, Maarten de Rijke, Hans de Nivelle:
Resolution in Modal, Description and Hybrid Logic. J. Log. Comput. 11(5): 717-736 (2001) - [c12]Hans de Nivelle, Ian Pratt-Hartmann:
A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality. IJCAR 2001: 211-225 - [c11]Hans de Nivelle:
Splitting Through New Proposition Symbols. LPAR 2001: 172-185 - 2000
- [j4]Hans de Nivelle:
Deciding the E+ - class by an a posteriori, liftable order. Ann. Pure Appl. Log. 104(1-3): 219-232 (2000) - [j3]Ullrich Hustadt, Hans de Nivelle, Renate A. Schmidt:
Resolution-Based Methods for Modal Logics. Log. J. IGPL 8(3): 265-292 (2000) - [c10]Marc Bezem, Dimitri Hendriks, Hans de Nivelle:
Automated Proof Construction in Type Theory Using Resolution. CADE 2000: 148-163
1990 – 1999
- 1999
- [c9]Carlos Areces, Hans de Nivelle, Maarten de Rijke:
Prefixed Resolution: A Resolution Method for Modal and Description Logics. CADE 1999: 187-201 - [c8]Harald Ganzinger, Hans de Nivelle:
A Superposition Decision Procedure for the Guarded Fragment with Equality. LICS 1999: 295-303 - 1998
- [j2]Hans de Nivelle:
An Algorithm for the Retrieval of Unifiers from Discrimination Trees. J. Autom. Reason. 20(1): 5-25 (1998) - [j1]Hans de Nivelle:
The Resolution Calculus, Alexander Leitsch. J. Log. Lang. Inf. 7(4): 499-502 (1998) - [c7]Hans de Nivelle:
A Resolution Decision Procedure for the Guarded Fragment. CADE 1998: 191-204 - 1997
- [c6]Hans de Nivelle:
A Classification of Non-liftable Orders for Resolution. CADE 1997: 336-350 - 1996
- [c5]Hans de Nivelle:
An Algorithm for the Retrieval of Unifiers from Discrimination Trees. JELIA 1996: 18-33 - 1994
- [c4]Hans de Nivelle:
Resolution Games and Non-Liftable Resolution Orderings. CSL 1994: 279-293 - [c3]Cees Witteveen, Wiebe van der Hoek, Hans de Nivelle:
Revision of Non-Monotonic Theories. JELIA 1994: 137-151 - [c2]Hans de Nivelle:
A Unification of Ordering Refinements of Resolution in Classical Logic. JELIA 1994: 217-230 - 1993
- [c1]Hans de Nivelle:
Generic Resolution in Propositional Modal Systems. LPAR 1993: 241-252
Coauthor Index
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 2024-10-07 22:16 CEST 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:
