English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Complexity Analysis Based on Ordered Resolution

Basin, D. A., & Ganzinger, H. (1996). Complexity Analysis Based on Ordered Resolution. In Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science (LICS'96) (pp. 456-465). Los Alamitos, USA: IEEE.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-ABCB-3 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-ABCC-1
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Basin, David A.1, Author           
Ganzinger, Harald1, Author           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 Abstract: We define \emph{order locality} to be a property of clauses relative to a term ordering. This property is a kind of generalization of the subformula property for proofs where terms arising in proofs are bounded, under the given ordering, by terms appearing in the goal clause. We show that when a clause set is order local, then the complexity of its ground entailment problem is a function of its structure (e.g., full versus Horn clauses), and the ordering used. We prove that, in many cases, order locality is equivalent to a clause set being saturated under ordered resolution. This provides a means of using standard resolution theorem provers for testing order locality and transforming non-local clause sets into local ones. We have used the Saturate system to automatically establish complexity bounds for a number of nontrivial entailment problems relative to complexity classes which include polynomial and exponential time and co-NP.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-121996
 Publication Status: Issued
 Pages: -
 Publishing info: Los Alamitos, USA : IEEE
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 519598
Other: Local-ID: C1256104005ECAFC-B830EE59D3CA5518C12562D80050A20C-BasinGanzinger96a
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: New Brunswick, New Jersey, USA
Start-/End Date: 2003-07-08 - 2003-07-12

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science (LICS'96)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Los Alamitos, USA : IEEE
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 456 - 465 Identifier: ISBN: 0818674636