Resolution games and non-liftable resolution orderings

descriptionPublicationkeyboard_double_arrow_right Part of book or chapter of book , Conference object , Article 01 Jan 1995Publisher:Springer Berlin Heidelberg

Authors: Hans de Nivelle;

doi: 10.1007/bfb0022263 , 10.1007/978-3-7091-9461-4_1

Resolution games and non-liftable resolution orderings

- Summary
- Metrics

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, as for example saturation. This is possible because of a new proof method which avoids making use of the standard ordered lifting theorem. This new proof method is based on a new technique, which we call the resolution game.

Related Organizations

Delft University of Technology
Netherlands

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	7
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

7

Average

Top 10%

Average

Related to Research communities

Netherlands Research Portal

Upload OA version

Are you the author of this publication? Upload your Open Access version to Zenodo!

It’s fast and easy, just two clicks!

uploadUpload now