HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

The complexity of linear and stratified context matching problems

Manfred Schmidt-Schauss Jürgen Stuber 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We give algorithms for linear and for general context matching and discuss how the performance in the general case can be improved through the use of information derived from approximations that can be computed in polynomial time. We investigate the complexity of context matching with respect to the stratification of variable occurrences, where our main results are that stratified context matching is NP-complete, but that stratified simultaneous monadic context matching is in P. SSMCM is equivalent to stratified simultaneous word matching. We also show that the linear and the shared-linear case are in P and of time complexity O(n³), and that varity 2 context matching, where variables occur at most twice, is NP-complete. || Nous présentons des algorithmes pour le filtrage de contextes linéaires et généraux et nous montrons comment les performances dans le cas général peuvent être améliorées en utilisant l'information dérivée d'approximations calculables en temps polynomial.
Document type :
Journal articles
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 10:13:52 AM
Last modification on : Friday, February 4, 2022 - 3:30:26 AM


  • HAL Id : inria-00100071, version 1



Manfred Schmidt-Schauss, Jürgen Stuber. The complexity of linear and stratified context matching problems. Theory of Computing Systems, Springer Verlag, 2004, 37 (6), pp.717-740. ⟨inria-00100071⟩



Record views