Logic Programming and Automated Reasoning: International Conference LPAR '92, St.Petersburg, Russia, July 15-20, 1992. ProceedingsAndrei Voronkov Springer Science & Business Media, 1992 - 509 páginas This volume contains the proceedings of LPAR '92, the international conference on logic programming and automated reasoning held in St. Petersburg in July 1992. The aim of the conference was to bring together researchers from the Russian and the international logic programming and theorem proving communities. The topics of interest covered by papers inthe volume include automated theorem proving, non-monotonic reasoning, applications of mathematical logic to computer science, deductive databases, implementation of declarative concepts, and programming in non-classical logics. LPAR '92 is the successor of the First and Second Russian Conferences on Logic Programming held in 1990 and 1991, respectively, the proceedings of which were publishedin LNAI Vol. 592. |
Contenido
I | 1 |
II | 13 |
III | 30 |
VI | 42 |
VII | 54 |
VIII | 66 |
IX | 78 |
XII | 84 |
XLV | 369 |
XLVI | 381 |
XLVII | 393 |
XLVIII | 403 |
XLIX | 409 |
LI | 421 |
LIII | 433 |
LV | 445 |
XIII | 96 |
XIV | 107 |
XV | 119 |
XVII | 131 |
XVIII | 137 |
XIX | 148 |
XX | 160 |
XXI | 172 |
XXII | 178 |
XXIV | 190 |
XXVII | 202 |
XXVIII | 214 |
XXX | 226 |
XXXI | 238 |
XXXII | 250 |
XXXIII | 261 |
XXXVI | 273 |
XXXVII | 285 |
XXXVIII | 297 |
XXXIX | 309 |
XL | 320 |
XLII | 332 |
XLIII | 357 |
LVII | 448 |
LIX | 451 |
LXI | 454 |
LXII | 457 |
LXIV | 460 |
LXV | 463 |
LXVI | 466 |
LXVIII | 469 |
LXIX | 472 |
LXX | 475 |
LXXI | 478 |
LXXII | 481 |
LXXIII | 484 |
LXXV | 487 |
LXXVII | 490 |
LXXVIII | 493 |
LXXIX | 496 |
LXXXII | 499 |
LXXXIII | 501 |
LXXXIV | 504 |
LXXXV | 507 |
Otras ediciones - Ver todas
Logic Programming and Automated Reasoning: International Conference LPAR '92 ... Andrei Voronkov Vista de fragmentos - 1992 |
Logic Programming and Automated Reasoning: International Conference LPAR '92 ... Andrei Voronkov Sin vista previa disponible - 1992 |
Términos y frases comunes
Abstract algebra algorithm APPLY LAMBDA Argonne Artificial Intelligence atom Automated automated theorem proving C₁ calculus called complete Computer Science consider constant constraint construction contains corresponding D₁ deductive databases defined Definition denote derivation domain equational theories example execution extended finite fixpoint function symbols given goal formula Herbrand higher-order implementation induction inference rules infinite instantiated interpretation Lemma linear logic literals Logic Programming method Minker module multiset natural deduction negation negation as failure node normal notion obtained operator P₁ parallel parameters paramodulation predicate symbols problem Proc programming language Prolog proof net Proposition quantifiers query r-description r₁ recursive refutation relation restricted result rewriting systems run-time satisfied semantic tree sequence sequent calculus set-of-support SLS-tree sort specification step structure subset substitution subterm term termination theorem proving transformation tree type theory unification unifier variables well-founded semantics