Cantitate/Preț
Produs

Foundations of Information and Knowledge Systems: 4th International Symposium, FoIKS 2006, Budapest, Hungary, February 14-17, 2006, Proceedings: Lecture Notes in Computer Science, cartea 3861

Editat de Stephen J. Hegner
en Limba Engleză Paperback – 25 ian 2006

Din seria Lecture Notes in Computer Science

Preț: 32813 lei

Preț vechi: 41015 lei
-20% Nou

Puncte Express: 492

Preț estimativ în valută:
6280 6523$ 5216£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540317821
ISBN-10: 3540317821
Pagini: 348
Ilustrații: X, 331 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.49 kg
Ediția:2006
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 Presentation.- The Semijoin Algebra.- Regular Papers.- Equational Constraint Solving Via a Restricted Form of Universal Quantification.- Modeling the Evolution of Objects in Temporal Information Systems.- Controlled Query Evaluation with Open Queries for a Decidable Relational Submodel.- Iterative Modification and Incremental Evaluation of Preference Queries.- On the Number of Independent Functional Dependencies.- Arity and Alternation: A Proper Hierarchy in Higher Order Logics.- Solving Abduction by Computing Joint Explanations: Logic Programming Formalization, Applications to P2P Data Integration, and Complexity Results.- The Nested List Normal Form for Functional and Multivalued Dependencies.- Axiomatising Functional Dependencies for XML with Frequencies.- Guarded Open Answer Set Programming with Generalized Literals.- Reasoning Support for Expressive Ontology Languages Using a Theorem Prover.- Consistency Checking Algorithms for Restricted UML Class Diagrams.- Some Contributions to the Minimum Representation Problem of Key Systems.- On Multivalued Dependencies in Fixed and Undetermined Universes.- Preference-Based Query Tuning Through Refinement/Enlargement in a Formal Context.- Processing Ranked Queries with the Minimum Space.- Hybrid Minimal Spanning Tree and Mixture of Gaussians Based Clustering Algorithm.