Logics in Artificial Intelligence: European Workshop, JELIA '96, Evora, Portugal, September 30 - October 3, 1996, Proceedings: Lecture Notes in Computer Science, cartea 1126
Editat de Jose Julio Alferes, Luis Moniz Pereira, Eva Orlowskaen Limba Engleză Paperback – 28 aug 1996
The 25 revised full papers included together with three invited papers were selected from 57 submissions. Many relevant aspects of AI logics are addressed. The papers are organized in sections on automated reasoning, modal logics, applications, nonmonotonic reasoning, default logics, logic programming, temporal and spatial logics, and belief revision and paraconsistency.
Din seria Lecture Notes in Computer Science
- 20% Preț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 444.17 lei
- 20% Preț: 238.01 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 440.52 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 632.22 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1053.45 lei
- 20% Preț: 579.56 lei
- Preț: 373.56 lei
- 20% Preț: 330.23 lei
- 15% Preț: 429.74 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 567.60 lei
- 20% Preț: 575.48 lei
- 20% Preț: 571.63 lei
- 20% Preț: 747.79 lei
- 15% Preț: 568.74 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 574.05 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 747.79 lei
- 20% Preț: 809.19 lei
- 20% Preț: 649.49 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 332.50 lei
Preț vechi: 415.63 lei
-20% Nou
Puncte Express: 499
Preț estimativ în valută:
63.63€ • 66.10$ • 52.86£
63.63€ • 66.10$ • 52.86£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540616306
ISBN-10: 3540616306
Pagini: 436
Ilustrații: X, 426 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.61 kg
Ediția:1996
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: 3540616306
Pagini: 436
Ilustrații: X, 426 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.61 kg
Ediția:1996
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
Hyper tableaux.- An algorithm for the retrieval of unifiers from discrimination trees.- Building proofs or counterexamples by analogy in a resolution framework.- What you always wanted to know about rigid E-unification.- Labelled proofs for quantified modal logic.- A uniform tableaux method for nonmonotonic modal logics.- Design and implementation of diagnostic strategies using modal logic.- A modal action logic based framework for organization specification and analysis.- McCarthy's idea.- Strong and explicit negation in non-monotonic reasoning and logic programming.- Only persistence makes nonmonotonicity monotonous.- Ordering-based representations of rational inference.- Semi-representability of default theories in rational default logic.- A query answering algorithm for Lukaszewicz' general open default theory.- Infinitary default logic for specification of nonmonotonic reasoning.- A system for computing constrained default logic extensions.- The Oz programming model.- An abductive framework for negation in disjunctive logic programming.- Characterizing D-WFS: Confluence and iterated GCWA.- Modules and specifications.- Logic programming with integrity constraints.- Temporal reasoning over linear discrete time.- Similarity saturation for first order linear temporal logic with UNLESS.- Carving Up space: Steps towards construction of an absolutely complete theory of spatial regions.- Informational logic for automated reasoning.- Extensions for open default theories via the domain closure assumption.- Revising and updating using a back-up semantics.- A simple signed system for paraconsistent reasoning.