Foundations of Information and Knowledge Systems [electronic resource] : 5th International Symposium, FoIKS 2008, Pisa, Italy, February 11-15, 2008. Proceedings / edited by Sven Hartmann, Gabriele Kern-Isberner.

Contributor(s): Hartmann, Sven [editor.] | Kern-Isberner, Gabriele [editor.] | SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 4932Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008Description: XII, 400 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540776840Subject(s): Computer science | Logic design | Computational complexity | Database management | Data mining | Artificial intelligence | Computer Science | Database Management | Data Mining and Knowledge Discovery | User Interfaces and Human Computer Interaction | Artificial Intelligence (incl. Robotics) | Logics and Meanings of Programs | Discrete Mathematics in Computer ScienceAdditional physical formats: Printed edition:: No titleDDC classification: 005.74 LOC classification: QA76.9.D3Online resources: Click here to access online
Contents:
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 Automated Multi-issue Negotiation.
In: Springer eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK8002

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 Automated Multi-issue Negotiation.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha