Ting Zhang, Henny B. Sipma, Zohar Manna  Home/Search
Context
Related
| stanford.edu/~tingz/paper...tphols04.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: stanford.edu/~tingz/papers/tph... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Term algebras have wide applicability in computer science. Unfortunately, the decision problem for term algebras has a nonelementary lower bound, which makes the theory and any extension of it intractable in practice. However, it is often more appropriate to consider the bounded class, in which formulae can have arbitrarily long sequences of quantifiers but the quantifier alternation depth is bounded. In this paper we present new quantifier elimination procedures for the first-order... (Update)
Active bibliography (related documents): More All
2.0: Term Algebras with Length Function and Bounded Quantifier.. - Zhang, Sipma, Manna (Correct)
0.8: On Relational Analysis of Algebraic Datatypes - Kuncak, Jackson (Correct)
0.5: Decision Procedures for Recursive Data Structures with.. - Zhang, Sipma, Manna (2004) (Correct)
Similar documents based on text: More All
0.6: Deductive Modelchecking - Sipma (1999) (Correct)
0.5: Deductive Verification of Modular Systems - Finkbeiner, Manna, Sipma (1998) (Correct)
0.5: Deductive Model Checking - Sipma, Uribe, Manna (1996) (Correct)
BibTeX entry: (Update)
@misc{ zhang-term,
author = "Ting Zhang and Henny B. Sipma and Zohar Manna",
title = "Term Algebras with Length Function and Bounded Quantifier Alternation",
url = "citeseer.ist.psu.edu/zhang04term.html" }
Citations (may not include all citations):370 A Mathematical Introduction to Logic (context) - Enderton - 2001
186 Negation in logic programming (context) - Kunen - 1987
170 ACM Transactions on Programming Languages and Systems (context) - Martelli, Montanari et al. - 1982
133 Cambridge University Press (context) - Hodges - 1993
118 Complete axiomatizations of the algebras of finite (context) - Maher - 1988
43 The Computational Complexity of Logical Theories (context) - Ferrante, Racko - 1979
43 Theorem proving in arithmetic without multiplication (context) - Cooper - 1972
41 Combinatorial Problems and Exercises (context) - Lovasz - 1993
34 Equational formulae with membership constraints - Comon, Delor - 1994
26 A uniform method for proving lower bounds on the computation.. (context) - Compton, Henson - 1990
23 A complete axiomatization of a theory with feature and arity.. - Backofen - 1995
21 An improved lower bound for the elementary theories of trees - Vorobyov - 1996
19 Massachusetts Institute of Technology (context) - Kuncak, Rinard et al. - 2003
15 A decision procedure for term algebras with queues - Rybina, Voronkov - 2001
14 Axiomatizable classes of locally free algebras of various ty.. (context) - Mal'cev - 1971
14 Reasoning about recursively defined data structures (context) - Oppen - 1980
10 The structural subtyping of non-recursive types is decidable - Kuncak, Rinard - 2003
10 Presburger arithmetic with bounded quantifier alternation (context) - Reddy, Loveland - 1978
8 A decision procedure for the existential theory of term alge.. - Korovin, Voronkov - 2000
6 Knuth-Bendix constraint solving is NPcomplete (context) - Korovin, Voronkov - 2076
2 Equational problemsand disunification (context) - Comon, Lescanne - 1989
2 The complexity of Presburger arithmetic with bounded quantif.. (context) - urer - 1982
2 Decision procedures for recursive data structures with integ.. - Zhang, Sipma et al. - 2004
1 The decidability of the first-order theory of term algebras .. (context) - Zhang, Sipma et al. - 2004
Documents on the same site (http://theory.stanford.edu/~tingz/papers/tphols04/):
Term Algebras with Length Function and Bounded Quantifier.. - Zhang, Sipma, Manna (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC