English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  A Superposition Decision Procedure for the Guarded Fragment with Equality

Ganzinger, H., & de Nivelle, H. (1999). A Superposition Decision Procedure for the Guarded Fragment with Equality. In G. Longo (Ed.), Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science (LICS-99) (pp. 295-303). Los Alamitos, USA: IEEE.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-362C-2 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-362D-F
Genre: Conference Paper

Files

show Files
hide Files
:
99LICS_2_ps.gz (Any fulltext), 56KB
 
File Permalink:
-
Name:
99LICS_2_ps.gz
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/gzip
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-
:
99LICS_2.pdf (Any fulltext), 128KB
 
File Permalink:
-
Name:
99LICS_2.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Ganzinger, Harald1, Author           
de Nivelle, Hans1, Author           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 Abstract: We give a decision procedure for the guarded fragment with equality. The procedure is based on resolution with superposition. The relevance of the guarded fragment lies in the fact that many modal logics can be translated into it. In this way the guarded fragment acts as a framework explaining some of the nice properties of these modal logics. By constructing an implementable decision procedure for the guarded fragments we define an effective procedure for deciding these modal logics. It is surprising to see that one does not need any sophisticated simplification and redundancy elimination method to make superposition terminate on the class of clauses that is obtained from the clausification of guarded formulas. Yet the decision procedure obtained is optimal with regard to time complexity.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-121999
 Publication Status: Issued
 Pages: -
 Publishing info: Los Alamitos, USA : IEEE
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 519693
Other: Local-ID: C1256104005ECAFC-B613AAD4404037B3C1256744002BF554-GanzingerNivelle-99-lics
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Trento, Italy
Start-/End Date: 2003-07-08 - 2003-07-12

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science (LICS-99)
Source Genre: Proceedings
 Creator(s):
Longo, Giuseppe, Editor
Affiliations:
-
Publ. Info: Los Alamitos, USA : IEEE
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 295 - 303 Identifier: ISBN: 0-7695-0158-3