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 Voronkoven Limba Engleză Paperback – 29 iun 1993
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (2) | 320.42 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – 29 iun 1993 | 320.42 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – iul 1992 | 325.90 lei 6-8 săpt. |
Din seria Lecture Notes in Computer Science
- 20% Preț: 1005.39 lei
- 20% Preț: 322.44 lei
- 20% Preț: 324.00 lei
- 20% Preț: 315.19 lei
- 20% Preț: 238.01 lei
- 20% Preț: 554.98 lei
- 20% Preț: 322.44 lei
- 20% Preț: 438.69 lei
- 20% Preț: 325.58 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 1339.86 lei
- 20% Preț: 782.28 lei
- 17% Preț: 360.19 lei
- 20% Preț: 620.45 lei
- 20% Preț: 307.71 lei
- 20% Preț: 550.29 lei
- 20% Preț: 560.32 lei
- 20% Preț: 319.32 lei
- 15% Preț: 549.86 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- 20% Preț: 548.74 lei
- 20% Preț: 172.69 lei
- 20% Preț: 611.22 lei
- 20% Preț: 970.25 lei
- 20% Preț: 552.64 lei
- 20% Preț: 315.78 lei
- 20% Preț: 315.78 lei
- 20% Preț: 722.90 lei
- 20% Preț: 722.90 lei
- 20% Preț: 301.95 lei
- 20% Preț: 504.57 lei
- 20% Preț: 1120.51 lei
- 20% Preț: 369.12 lei
- 20% Preț: 334.94 lei
- 20% Preț: 552.64 lei
- Preț: 389.31 lei
- 20% Preț: 564.99 lei
- 20% Preț: 724.49 lei
- 20% Preț: 552.64 lei
- 20% Preț: 1018.35 lei
- 20% Preț: 331.82 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 320.42 lei
Preț vechi: 400.52 lei
-20% Nou
Puncte Express: 481
Preț estimativ în valută:
61.37€ • 66.53$ • 51.02£
61.37€ • 66.53$ • 51.02£
Carte tipărită la comandă
Livrare economică 02-16 decembrie
Preluare comenzi: 021 569.72.76
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
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ă
ResearchCuprins
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.