@inproceedings{d41bdcdb12ab496cb2f3f0fea4ecf2d8,
title = "Resolution games and non-liftable resolution orderings",
abstract = "We prove the completeness of the combination of ordered resolution and factoring for a large class of non-liftable orderings, without the need for any additional rules like saturation. This is possible because of a new proof method wich avoids making use of the standard ordered lifting theorem. This proof method is based on resolution games.",
author = "\{De Nivelle\}, Hans",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin FIeidelberg 1995.; 8th Workshop on Computer Science Logic, CSL 1994 ; Conference date: 25-09-1994 Through 30-09-1994",
year = "1995",
doi = "10.1007/bfb0022263",
language = "English",
isbn = "9783540600176",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "279--293",
editor = "Leszek Pacholski and Jerzy Tiuryn",
booktitle = "Computer Science Logic - 8th Workshop, CSL 1994, Selected Papers",
address = "Germany",
}