Entry Jouannaud:1992:TCM from tcs1990.bib

Last update: Wed Sep 26 02:11:46 MDT 2018                Valid HTML 4.0!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Jouannaud:1992:TCM,
  author =       "Jean-Pierre Jouannaud and Claude March{\'e}",
  title =        "Termination and completion modulo associativity,
                 commutativity and identity",
  journal =      j-THEOR-COMP-SCI,
  volume =       "104",
  number =       "1",
  pages =        "29--51",
  day =          "05",
  month =        oct,
  year =         "1992",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:16:43 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1992&volume=104&issue=1;
                 http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1992&volume=104&issue=1&aid=1166",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Lab. de Recherche en Inf., Univ. Paris-Sud, Orsay,
                 France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "commutativity; completion modulo associativity;
                 identity; nontermination; orderings; proving
                 termination; rewriting; rewriting systems;
                 termination",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries