MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Proceedings Article, Paper


@InProceedings
Beitrag in Tagungsband, Workshop
Author, Editor
Author(s):
Basin, David A.
Ganzinger, Harald		dblp
dblp
Editor(s):
BibTeX cite key*:
BasinGanzinger96a
Title, Booktitle
Title*:
Complexity Analysis Based on Ordered Resolution
Booktitle*:
Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science (LICS'96)
Event, URLs
Conference URL::
Downloading URL:
Event Address*:
New Brunswick, New Jersey, USA
Language:
English
Event Date*
(no longer used):
July 27-30, 1996
Organization:
IEEE Comput. Soc. Tech. Committee on Math. Found. Comput.; ACM Special Interest Group on Automata & Comput. Theory; Assoc. Symbolic Logic; Eur. Assoc. Theoret. Comput. Sci
Event Start Date:
8 July 2003
Event End Date:
12 July 2003
Publisher
Name*:
IEEE
URL:
Address*:
Los Alamitos, USA
Type:
Vol, No, Year, pp.
Series:
Volume:
Number:
Month:
Pages:
456-465
Year*:
1996
VG Wort Pages:
ISBN/ISSN:
0818674636
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) 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.
Keywords:
complexity analysis, ordered resolution, order locality, clauses, term ordering, subformula property, ground entailment, Horn clauses, standard resolution theorem provers, non-local clause sets, Saturate system, nontrivial entailment problems, co-NP, exponential time, polynomial time
HyperLinks / References / URLs:
http://www.mpi-sb.mpg.de/\~{}hg/papers/conferences/abstracts.html\#LICS96
5381107 INSPEC Abstract No: C9611-4240C-010
Download
Access Level:
Public

Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Programming Logics Group
Audience:
Expert
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, CCL bibliography



BibTeX Entry:
@INPROCEEDINGS{BasinGanzinger96a,
AUTHOR = {Basin, David A. and Ganzinger, Harald},
 TITLE = {Complexity Analysis Based on Ordered Resolution},
 BOOKTITLE = {Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science (LICS'96)},
 PUBLISHER = {IEEE},
 YEAR = {1996},
 ORGANIZATION = {IEEE Comput. Soc. Tech. Committee on Math. Found. Comput.; ACM Special Interest Group on Automata & Comput. Theory; Assoc. Symbolic Logic; Eur. Assoc. Theoret. Comput. Sci},
 PAGES = {456--465},
 ADDRESS = {New Brunswick, New Jersey, USA},
 ISBN = {0818674636},
}

Entry last modified by Christine Kiesel, 03/12/2010
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
David A. Basin		Created
02/22/1996 03:40:43 PM
Revisions
10.
9.
8.
7.
6.		Editor(s)
Christine Kiesel
Christine Kiesel
Christine Kiesel
Christine Kiesel
Christine Kiesel		Edit Dates
08.07.2003 15:30:10
28.08.2001 16:33:46
27/01/98 13:51:27
26/03/97 13:46:51
24.03.97 17:49:03