English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  A Note on Assumptions about Skolem Functions

Ohlbach, H. J., & Weidenbach, C. (1995). A Note on Assumptions about Skolem Functions. Journal of Automated Reasoning, 15(2), 267-275.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Ohlbach, Hans Jürgen1, Author           
Weidenbach, Christoph1, 2, Author           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              
2Automation of Logic, MPI for Informatics, Max Planck Society, ou_1116545              

Content

show
hide
Free keywords: -
 Abstract: Skolemization is not an equivalence preserving transformation. For the purposes of refutational theorem proving it is sufficient that Skolemization preserves satisfiability and unsatisfiability. Therefore there is sometimes some freedom in interpreting Skolem functions in a particular way. We show that in certain cases it is possible to exploit this freedom for simplifying formulae considerably. Examples for cases where this occurs systematically are the relational translation from modal logics to predicate logic and the relativization of first-order logics with sorts.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-121995
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 519889
Other: Local-ID: C1256104005ECAFC-ACEBB86486F4D5B2C125615B005D0C7B-OhlbachWeidenbach95
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Journal of Automated Reasoning
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 15 (2) Sequence Number: - Start / End Page: 267 - 275 Identifier: ISSN: 0168-7433