Cantitate/Preț
Produs
Total produse
Vezi coșul
Logic Programming and Automated Reasoning: 4th International Conference, LPAR'93, St.Petersburg, Russia, July 13-20, 1993. Proceedings de Andrei Voronkov

Logic Programming and Automated Reasoning: 4th International Conference, LPAR'93, St.Petersburg, Russia, July 13-20, 1993. Proceedings: Lecture Notes in Computer Science, cartea 698

Editat de Andrei Voronkov
en Limba Engleză Paperback – 29 iun 1993
LPAR is an international conference series aimed at bringingtogether researchers interested in logic programming andautomated reasoning. The research in logic programming grewout of the research in automated reasoning in the early1970s. Later, the implementation techniques known from logicprogramming were used in implementing theorem provingsystems. Results from both fields applied to deductivedatabases.This volume contains the proceedings of LPAR '93, which wasorganized by the Russian Association for Logic Programming.The volume contains 35 contributed papers selected from 84submissions, together with an invited paper by Peter Wegnerentitled "Reasoning versus modeling in computer science".
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 32530 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 29 iun 1993 32530 lei  6-8 săpt.
  Springer Berlin, Heidelberg – iul 1992 33085 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 32530 lei

Preț vechi: 40663 lei
-20%

Puncte Express: 488
Preț estimativ în valută:
5751€ • 6820$ • 4989£

Carte tipărită la comandă

Livrare economică 11-25 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783540569442
ISBN-10: 3540569448
Pagini: 408
Ilustrații: XIV, 394 p.
Dimensiuni: 155 x 233 x 21 mm
Greutate: 0.58 kg
Ediția:1993
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Entailment and disentailment of order-sorted feature constraints.- Computing extensions of default logic — Preliminary report.- Prolog with arrays and bounded quantifications.- Linear 0–1 inequalities and extended clauses.- Search space pruning by checking dynamic term growth.- A proof search system for a modal substructural logic based on labelled deductive systems.- Consistency checking of automata functional specifications.- Yet another application for Toupie: Verification of mutual exclusion algorithms.- Parsing with DCG-terms.- A first order resolution calculus with symmetries.- Ordered paramodulation and resolution as decision procedure.- Static analysis of Prolog with cut.- A new type theory for representing logics.- Verification of Switch-level designs with many-valued logic.- Deciding in HFS-theory via linear integer programming.- The completion of typed logic programs and SLDNF-resolution.- Increasing the versatility of heuristic based theorem provers.- Sequentialization of parallel logic programs with mode analysis.- Refinements and extensions of model elimination.- Executable specifications based on dynamic algebras.- Generic resolution in propositional modal systems.- Optimized translation of multi modal logic into predicate logic.- Default reasoning with a constraint resolution principle.- Non-clausal deductive techniques for computing prime implicants and prime implicates.- Unification under one-sided distributivity with a multiplicative unit.- Unification in Order-Sorted Logic with Term Declarations.- Extracting inheritance hierarchies from Prolog programs: A system based on the inference of type relations.- A comparison of mechanisms for avoiding repetition of subdeductions in chain format linear deduction systems.- Neutralization and preemption inextended logic programs.- MULTLOG: A system for axiomatizing many-valued logics.- SKIL: A system for programming with proofs.- Reasoning about the reals: the marriage of HOL and maple.- System description of LAMBDALG.- Mixing metafor.- A complete axiom system for isomorphism of types in closed categories.- Reasoning, modeling, and component-based technology.