Miki Hermann, Gernot Salzer  Home/Search
Context
Related
| loria.fr/~hermann/p...fullredelim.ps.gz 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: loria.fr/~hermann/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We investigate the word and the subsumption problems for recurrent term schematizations, which are a special type of constraints based on iteration. By means of uni cation, we reduce these problems to the 2 -fragment of linear Diophantine equations over non-negative integers. Our approach is applicable to all recurrent term schematizations having a nitary uni cation algorithm. Furthermore, we study a particular form of the complement problem. Given a nite set of terms, we ask whether its... (Update)
Similar documents (at the sentence level):
30.6%: On the Word, Subsumption, and Complement Problem for.. - Hermann, Salzer (Correct)
Active bibliography (related documents): More All
1.6: Using Term Schematizations in Automated Deduction - Peltier (Correct)
0.3: Weakly Regular Relations and Applications - Limet, Réty, Seidl (2001) (Correct)
0.3: Implementing Anti-Unification Modulo Equational Theory - Burghardt, Heinz (Correct)
Similar documents based on text: More All
0.7: Term Schematizations and Their Applications - Hermann, Salzer (1995) (Correct)
0.6: Structural Complexity of Term Schematizations (Abstract) - Salzer (Correct)
0.5: Overview of Existing Recurrent Schematizations - Hermann (1996) (Correct)
BibTeX entry: (Update)
@article{ hermann98word,
author = "Miki Hermann and Gernot Salzer",
title = "On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations",
journal = "Lecture Notes in Computer Science",
volume = "1450",
pages = "257--??",
year = "1998",
url = "citeseer.ist.psu.edu/hermann98word.html" }
Citations (may not include all citations):4212 Computers and intractability: A guide to the theory of NP-co.. (context) - Garey, Johnson - 1979
951 Computational complexity (context) - Papadimitriou - 1994
309 Symbolic logic and mechanical theorem proving (context) - Chang, Lee - 1973
129 Theoretical Computer Science (context) - Stockmeyer, hierarchy - 1976
43 Complete sets and the polynomial-time hierarchy (context) - Wrathall - 1976
31 the complexity of integer programming (context) - Papadimitriou - 1981
27 The complexity of satisability problems (context) - Schaefer - 1978
8 EATCS Texts in Theoretical Computer Science (context) - Leitsch, calculus - 1997
7 Explicit representation of terms dened by counter examples (context) - Lassez, Marriott - 1987
6 Increasing model building capabilities by constraint solving.. - Peltier - 1997
4 or how to formalize Genesis (context) - Salzer, meta-reasoning - 1991
3 Unication of innite sets of terms schematized by primal gram.. (context) - Hermann, Galbav - 1997
3 On unication of terms with integer exponents (context) - Comon - 1995
2 Primal grammars and unication modulo a binary clause (context) - Salzer - 1994
2 The unication of innite sets of terms and its applications (context) - Salzer - 1992
1 Recurrence domains: Their unication and application to logic.. (context) - Chen, Hsiang - 1995
1 Meta-reasoning and its applications in rst-order logic (context) - Rettig - 1999
Documents on the same site (http://www.loria.fr/~hermann/publications.html): More
On the Word, Subsumption, and Complement Problem for.. - Hermann, Salzer (Correct)
Unification Algorithms Cannot be Combined in Polynomial Time - Hermann, Kolaitis (1996) (Correct)
On the Complexity of Counting the Hilbert Basis of a.. - Hermann, Juban, Kolaitis (1999) (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