Cantitate/Preț
Produs

Foundations of Information and Knowledge Systems: 5th International Symposium, FoIKS 2008, Pisa, Italy, February 11-15, 2008, Proceedings: Lecture Notes in Computer Science, cartea 4932

Editat de Sven Hartmann, Gabriele Kern-Isberner
en Limba Engleză Paperback – 29 ian 2008

Din seria Lecture Notes in Computer Science

Preț: 33264 lei

Preț vechi: 41580 lei
-20% Nou

Puncte Express: 499

Preț estimativ în valută:
6366 6613$ 5288£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540776833
ISBN-10: 3540776834
Pagini: 416
Ilustrații: XII, 400 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.61 kg
Ediția:2008
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Information Systems and Applications, incl. Internet/Web, and HCI

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Invited Talks.- Coupling Design and Verification in Software Product Lines.- Random Geometric Identification.- Strategic Abilities of Agents.- Regular Papers.- Aggregation of Attack Relations: A Social-Choice Theoretical Analysis of Defeasibility Criteria.- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets.- An Alternative Foundation for DeLP: Defeating Relations and Truth Values.- Appropriate Reasoning about Data Dependencies in Fixed and Undetermined Universes.- Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory.- Cost-Minimising Strategies for Data Labelling: Optimal Stopping and Active Learning.- Information-Optimal Reflections of View Updates on Relational Database Schemata.- Merging First-Order Knowledge Using Dilation Operators.- On the Existence of Armstrong Instances with Bounded Domains.- Reasoning on Data Models in Schema Translation.- Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings.- Using Transversals for Discovering XML Functional Dependencies.- Visibly Pushdown Transducers for Approximate Validation of Streaming XML.- A Probabilistic Logic with Polynomial Weight Formulas.- A Transformation-Based Approach to View Updating in Stratifiable Deductive Databases.- Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach.- Database Preferences Queries – A Possibilistic Logic Approach with Symbolic Priorities.- Defeasible Reasoning and Partial Order Planning.- Lossless Decompositions in Complex-Valued Databases.- SIM-PDT: A Similarity Based Possibilistic Decision Tree Approach.- Towards a Logic for Abstract MetaFinite State Machines.- Towards a Fuzzy Logic for AutomatedMulti-issue Negotiation.