Entry Kim:1992:NSM 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{Kim:1992:NSM,
  author =       "Byeong Man Kim and Jung Wan Cho",
  title =        "A new subsumption method in the connection graph proof
                 procedure",
  journal =      j-THEOR-COMP-SCI,
  volume =       "103",
  number =       "2",
  pages =        "283--309",
  day =          "14",
  month =        sep,
  year =         "1992",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:24:22 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., KAIST, Seoul, South Korea",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bit operations; computational complexity; connection
                 graph proof procedure; consistency; logical
                 consistency; logical inconsistency; open problem;
                 pairwise strongly compatible matching substitutions;
                 pairwise strongly compatible test; restricted
                 subsumption algorithm; s-link test; search space
                 reduction rules; subsumption method; theorem proving;
                 unrestricted subsumption algorithm; worst-case time
                 complexity",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries