Entry Middeldorp:1996:LNS from tcs1995.bib

Last update: Sun Oct 15 02:56:11 MDT 2017                Valid HTML 3.2!

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{Middeldorp:1996:LNS,
  author =       "Aart Middeldorp and Satoshi Okui and Tetsuo Ida",
  title =        "Lazy narrowing: {Strong} completeness and eager
                 variable elimination",
  journal =      j-THEOR-COMP-SCI,
  volume =       "167",
  number =       "1--2",
  pages =        "95--130",
  day =          "30",
  month =        oct,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:20 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=167&issue=1-2;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1996&volume=167&issue=1-2&aid=2273",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210L (Formal
                 languages and computational linguistics); C6170K
                 (Knowledge engineering techniques)",
  conflocation = "Aarhus, Denmark; 22-26 May 1995",
  conftitle =    "TAPSOFT '95: Theory and Practice of Software
                 Development. 6th International Joint Conference
                 CAAP/FASE. Proceedings",
  corpsource =   "Inst. of Inf. Sci. and Electron., Tsukuba Univ.,
                 Ibaraki, Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "confluent term rewriting systems; eager variable
                 elimination; equational theories; inference mechanisms;
                 inference rules; lazy narrowing; redundant derivations;
                 rewriting systems; search space; selection functions;
                 strong completeness; unification problems",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries