de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Report

Strong skolemization

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45132

Nonnengart,  Andreas
Programming Logics, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)

1996-2-010
(Any fulltext), 10KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Nonnengart, A.(1996). Strong skolemization (MPI-I-1996-2-010). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-9FD9-6
Abstract
Skolemization is a means to eliminate existential quantifiers within predicate logic sentences and that by replacing existentially quantified variables with Skolem function applications. The arguments of these Skolem functions are variables which are quantified outside the sub-formula under consideration. In this paper a Skolemization technique is introduced which abstracts from some of the arguments of the Skolem functions. It shows that the Skolemization result obtained this way is usually more general than what can be achieved from standard (classical) Skolemization. This can be of quite some importance since such generalizations often lead to a reduction of both search space and proof length.