|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910483038703321 |
|
|
Titolo |
Foundations of information and knowledge systems : 4th international symposium, FoIKS 2006, Budapest, Hungary, February 14-17, 2006 : proceedings / / Jurgen Dix, Stephen J. Hegner (eds.) |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin ; ; New York, : Springer, c2006 |
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2006.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (X, 331 p.) |
|
|
|
|
|
|
Collana |
|
Lecture notes in computer science, , 0302-9743 ; ; 3861 |
LNCS sublibrary. SL 3, Information systems and applications, incl. Internet/Web, and HCI |
|
|
|
|
|
|
|
|
Altri autori (Persone) |
|
DixJ <1961-> (Jurgen) |
HegnerStephen J |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer systems |
Information technology |
Computer science - Mathematics |
Databases |
Knowledge representation (Information theory) |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
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 |
|
|
|
|