Entry Enjalbert:1989:MRC from tcs1985.bib

Last update: Thu Sep 27 02:46:57 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{Enjalbert:1989:MRC,
  author =       "Patrice Enjalbert and Luis {Farinas del Cerro}",
  title =        "Modal resolution in clausal form",
  journal =      j-THEOR-COMP-SCI,
  volume =       "65",
  number =       "1",
  pages =        "1--33",
  day =          "15",
  month =        jun,
  year =         "1989",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ de Caen",
  affiliationaddress = "Caen, Fr",
  classification = "723; C1230 (Artificial intelligence); C6110 (Systems
                 analysis and programming)",
  corpsource =   "Lab. d'Informatique, Caen Univ., France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  journalabr =   "Theor Comput Sci",
  keywords =     "Automated Deduction Methods; automated deduction
                 methods; clausal form; Completeness Proof; completeness
                 proof technique; Computer Metatheory; Computer
                 Programming--Algorithms; Deletion Strategy; deletion
                 strategy; Formal Logic; logic programming; Modal Logic;
                 modal logic; modal resolution; Modal Resolution;
                 Robinson resolution method; Subsumption Relation;
                 subsumption relation; tableau method",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries