Hans de Nivelle

发表

Resolution-Based Methods for Modal Logics

Ullrich Hustadt, Hans de Nivelle, Renate A. Schmidt, 2000, Log. J. IGPL.

Translation of resolution proofs into short first-order proofs without choice axioms

Hans de Nivelle, H. D. Nivelle, 2005, Inf. Comput..

Subsumption of Concepts in FL0y for (Cyclic) Terminologies with Respect to Descriptive Semantics is PSPACE-complete

Yevgeny Kazakov, Hans de Nivelle, 2003, Description Logics.

Prefixed Resolution: A Resolution Method for Modal and Description Logics

Maarten de Rijke, Hans de Nivelle, Carlos Areces, 1999, CADE.

Resolution Games and Non-Liftable Resolution Orderings

Hans de Nivelle, 1994, CSL.

Selected Papers from the Workshop on Disproving and the Second International Workshop on Pragmatics of Decision Procedures 2004

Cesare Tinelli, Hans de Nivelle, Wolfgang Ahrendt, 2005 .

Deciding the E+ - class by an a posteriori, liftable order

Hans de Nivelle, 2000, Ann. Pure Appl. Log..

Verification of an off-line checker for priority queues

Ruzica Piskac, Hans de Nivelle, H. D. Nivelle, 2005, Third IEEE International Conference on Software Engineering and Formal Methods (SEFM'05).

A Small Framework for Proof Checking

Hans de Nivelle, Piotr Witkowski, 2008, PAAR/ESHOL.

Classical Logic with Partial Functions

Hans de Nivelle, 2011, Journal of Automated Reasoning.

Using resolution as a decision procedure

Hans de Nivelle, H. D. Nivelle, 2005 .

A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality

Hans de Nivelle, Ian Pratt-Hartmann, H. D. Nivelle, 2001, IJCAR.

Deciding the guarded fragments by resolution

Maarten de Rijke, Hans de Nivelle, 2003, J. Symb. Comput..

An Algorithm for the Retrieval of Unifiers from Discrimination Trees

Hans de Nivelle, 2004, Journal of Automated Reasoning.

Subsumption Algorithms for Three-Valued Geometric Resolution

Hans de Nivelle, 2016, IJCAR.

Generic Resolution in Propositional Modal Systems

Hans de Nivelle, 1993, LPAR.

Computing finite models by reduction to function-free clause logic

Peter Baumgartner, Cesare Tinelli, Alexander Fuchs, 2009, J. Appl. Log..

Proceedings of the 2nd International Workshop on the Implementation of Logics

Hans de Nivelle, Stephan A. Schulz, S. Schulz, 2001 .

Extraction of Proofs from the Clausal Normal Form Transformation

Hans de Nivelle, 2002, CSL.

Automated Proof Construction in Type Theory Using Resolution

Hans de Nivelle, Marc Bezem, Dimitri Hendriks, 2000, CADE.

Revision of Non-Monotonic Theories

Cees Witteveen, Wiebe van der Hoek, Hans de Nivelle, 1994, JELIA.

Geometric Resolution: A Proof Procedure Based on Finite Model Search

Hans de Nivelle, Jia Meng, 2006, IJCAR.

Deciding Modal Logics through Relational Translations into GF2

Stéphane Demri, Hans de Nivelle, Patrick Blackburn, 2003 .

A superposition decision procedure for the guarded fragment with equality

Harald Ganzinger, Hans de Nivelle, H. Ganzinger, 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

Splitting Through New Proposition Symbols

Hans de Nivelle, 2001, LPAR.

A Unification of Ordering Refinements of Resolution in Classical Logic

Hans de Nivelle, H. D. Nivelle, 1994, JELIA.

An Overview of Resolution Decision Procedures

Hans de Nivelle, 2000 .

Automated Proof Construction in Type Theory Using Resolution

Hans de Nivelle, Marc Bezem, Dimitri Hendriks, 2000, Journal of Automated Reasoning.

Translation of Resolution Proofs into Short First-Order Proofs without Choice Axioms

Hans de Nivelle, 2003, CADE.

A Classification of Non-liftable Orders for Resolution

Hans de Nivelle, 1997, CADE.

Classical Logic with Partial Functions

Hans de Nivelle, 2010, IJCAR.

An Algorithm for the Retrieval of Unifiers from Discrimination Trees

Hans de Nivelle, 1996, JELIA.

Preface

Peter Baumgartner, Cesare Tinelli, Hans de Nivelle, 2005, Electron. Notes Theor. Comput. Sci..

Resolution in Modal, Description and Hybrid Logic

Maarten de Rijke, Hans de Nivelle, Carlos Areces, 2001, J. Log. Comput..

Resolution Decides the Guarded Fragment

Hans de Nivelle, 1998 .

Theorem Proving for Logic with Partial Functions Using Kleene Logic and Geometric Logic

Hans de Nivelle, 2014, ARQNL@IJCAR.

Theorem proving for classical logic with partial functions by reduction to Kleene logic

Hans de Nivelle, H. D. Nivelle, 2017, J. Log. Comput..

A Resolution Decision Procedure for the Guarded Fragment

Hans de Nivelle, H. D. Nivelle, 1998, CADE.

Deciding Regular Grammar Logics with Converse Through First-Order Logic

Stéphane Demri, Hans de Nivelle, H. D. Nivelle, 2003, J. Log. Lang. Inf..

The Resolution Calculus, Alexander Leitsch

Hans de Nivelle, 1998, J. Log. Lang. Inf..

Subsumption of concepts in $DL$ ${\cal FL}_0$ for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete

Yevgeny Kazakov, Hans de Nivelle, H. D. Nivelle, 2003 .

Automated Theorem Proving for Natural Language Understanding

Johan Bos, Hans de Nivelle, Michael Kohlhase, 1998 .