BibTeX cite key | Author/Editor | Year | | Title | Type |
deNivelle2001lpar | de Nivelle, Hans | 2001 | | Splitting through New Proposition Symbols
In: Proceedings of the 8th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-2001), 172-185 | Proceedings Article |
deNivelle2001slp | de Nivelle, Hans
Blackburn, Patrick
Bos, Johan
Kohlhase, Michael | 2001 | | Inference and Computational Semantics
In: Studies in Linguistics and Philosophy, Computing Meaning [77], 11-28 | Journal Article |
deNivelle2002a | de Nivelle, Hans | 2002 | | Extraction of Proofs from the Clausal Normal Form Transformation
In: Computer Science Logic : 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, 584-598 | Proceedings Article |
deNivelle2002b | Bezem, Marc
Hendriks, Dimitri
de Nivelle, Hans | 2002 | | Automated Proof Construction in Type Theory using Resolution
In: Journal of Automated Reasoning [29], 253-275 | Journal Article |
deNivelle2003a | de Nivelle, Hans
de Rijke, Maarten | 2003 | | Deciding the Guarded Fragments by Resolution
In: Journal of Symbolic Computation [35], 21-58 | Journal Article |
deNivelle2003b | de Nivelle, Hans | 2003 | | Translation of Resolution Proofs into Short First-Order Proofs without Choice Axioms
In: Automated deduction, CADE-19 : 19th International Conference on Automated Deduction, 365-379 | Proceedings Article |
deNivelle2003c | de Nivelle, Hans | 2003 | | Implementing the clausal normal form transformation with proof generation
In: Fourth Workshop on the Implementation of Logics, 69-83 | Proceedings Article |
deNivelle2005a | de Nivelle, Hans | 2005 | | Translation of Resolution Proofs into Short First-Order Proofs without Choice Axioms
In: Information and Computation [199], 24-54 | Journal Article |
deNivelle2006a | Ahrendt, Baumgartner, de Nivelle (ed.) | 2006 | | IJCAR'06 Workshop : Disproving'06: Non-Theorems, Non-Validity, Non-Provability | Electronic Proceedings |
deNivelle2006b | de Nivelle, Hans
Baumgartner, Peter
Fuchs, Alexander
Tinelli, Cesare | 2006 | | Computing Finite Models by Reduction to Function-Free Clause Logic
In: IJCAR'06 Workshop : Disproving'06: Non-Theorems, Non-Validity, Non-Provability, 82-95 | Electronic Proceedings Article |
deNivelleDemri2003a | de Nivelle, Hans
Demri, Stéphane | 2003 | | Deciding regular grammar logics with converse through first-order logic | Report |
deNivelleDemri2003c | de Nivelle, Hans
Demri, Stéphane | 2003 | | Deciding Modal Logics through Relational Translations into GF2
In: Proceedings of the 3rd Methods for Modalities Workshop, 15-30 | Proceedings Article |
deNivelleDemri2005 | de Nivelle, Hans
Demri, Stéphane | 2005 | | Deciding Regular Grammar Logics with Converse through First-Order Logic
In: Journal of Logic, Language and Information [14], 289-329 | Journal Article |
deNivelleMeng2006a | de Nivelle, Hans
Meng, Jia | 2006 | | Geometric Resolution: A Proof Procedure Based on Finite Model Search
In: Automated reasoning : Third International Joint Conference, IJCAR 2006, 303-317 | Proceedings Article |
deNivelleMeng2006b | de Nivelle, Hans
Meng, Jia | 2006 | | Geo 2006j | Miscellaneous |
DeNivellePiskac2005a | de Nivelle, Hans
Piskac, Ruzica | 2005 | | Verification of an Off-Line Checker for Priority Queues
In: Third IEEE International Conference on Software Engineering and Formal Methods (SEFM 2005), 210-219 | Proceedings Article |
deNivelleSchulz2001 | de Nivelle, Schulz (ed.) | 2001 | | Proceedings of the 2nd International Workshop on the Implementation of Logics | Proceedings |
deRJaeLeeMan02 | de Raedt, Luc
Jaeger, Manfred
Lee, Sau Dan
Mannila, Heikki | 2002 | | A Theory of Inductive Query Answering
In: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM'02), 123-130 | Proceedings Article |
DGNVV98a | Degtyarev, Anatoli
Gurevich, Yuri
Narendran, Paliath
Veanes, Margus
Voronkov, Andrei | 1998 | | The Decidability of Simultaneous Rigid E-Unification with One Variable
In: Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA-98), 181-195 | Proceedings Article |
DGNVV99 | Degtyarev, Anatoli
Gurevich, Yuri
Narendran, Paliath
Veanes, Margus
Voronkov, Andrei | 2000 | | Decidability and Complexity of Simultaneous Rigid E-unification with One Variable and Related Results
In: Theoretical Computer Science [243], 167-184 | Journal Article |
dim92 | Dimopoulos, Yannis
Magirou, Vangelis | 1994 | | A Graph Theoretic Approach to Default Logic
In: Information and Computation [112], 239-256 | Journal Article |
dim94a | Dimopoulos, Yannis | 1994 | | Classical Methods in Nonmonotonic Reasoning
In: Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems (ISMIS'94), 500-510 | Proceedings Article |
dim94c | Dimopoulos, Yannis | 1994 | | The Computational Value of Joint Consistency
In: Logics in Artificial Intelligence: Proceedings of the JELIA'94, 50-65 | Proceedings Article |
Dimitrova2006 | Dimitrova, Rayna | 2006 | | Model Checking with Abstraction Refinement for Well-Structured Systems
Universität des Saarlandes | Thesis - Masters thesis |
Dimopoulos-93-mpii226-2- | Dimopoulos, Yannis
Magirou, Vangelis
Papadimitriou, Christos | 1993 | | On Kernels, Defaults and Even Graphs
In: Annals of Mathematics and Artificial Intelligence, | Journal Article |
DMSSISAMC2005 | Daum, Matthias
Maus, Stefan
Schirmer, Norbert
Seghir, Mohammed Nassim | 2005 | | Integration of a Software Model Checker into Isabelle
In: Logic for Programming, Artificial Intelligence, and Reasoning: 12th International Conference, LPAR 2005, 381-395 | Proceedings Article |
Domopoulos96 | Dimopoulos, Yannis | 1996 | | On Computing Logic Programs
In: Journal of Automated Reasoning [17], 259-289 | Journal Article |
DomshlakHoffmann2006 | Domshlak, Carmel
Hoffmann, Jörg | 2006 | | Fast Probabilistic Planning Through Weighted Model Counting
In: Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling (ICAPS 2006), 243-252 | Proceedings Article |
DP-STTT01 | Delzanno, Giorgio
Podelski, Andreas | 2001 | | Constraint-based Deductive Model Checking
In: International Journal on Software Tools for Technology Transfer (STTT) [3], 250-270 | Journal Article |
Eisenbrand1999 | Eisenbrand, Friedrich | 1999 | | On the Membership Problem for the Elementary Closure of a Polyhedron
In: Combinatorica [19], 297-300 | Journal Article |