LEADER 03827nam 2200613 450 001 9910483871503321 005 20220515110417.0 010 $a3-540-77684-2 024 7 $a10.1007/978-3-540-77684-0 035 $a(CKB)1000000000490587 035 $a(SSID)ssj0000317765 035 $a(PQKBManifestationID)11212464 035 $a(PQKBTitleCode)TC0000317765 035 $a(PQKBWorkID)10312396 035 $a(PQKB)11657988 035 $a(DE-He213)978-3-540-77684-0 035 $a(MiAaPQ)EBC3062193 035 $a(MiAaPQ)EBC6711417 035 $a(Au-PeEL)EBL6711417 035 $a(OCoLC)233973843 035 $a(PPN)123743427 035 $a(EXLCZ)991000000000490587 100 $a20220515d2008 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aFoundations of information and knowledge systems $e5th international symposium, FOIKS 2008, Pisa, Italy, February 11-15, 2008, proceedings /$fSven Hartmann, Gabriele Kern-Isberner (editors) 205 $a1st ed. 2008. 210 1$aBerlin ;$aHeidelberg :$cSpringer,$d[2008] 210 4$dİ2008 215 $a1 online resource (XII, 400 p.) 225 1 $aLecture notes in computer science ;$v4932 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-77683-4 320 $aIncludes bibliographical references and index. 327 $aInvited 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. 410 0$aLecture notes in computer science ;$v4932. 606 $aComputer systems$vCongresses 606 $aInformation technology$vCongresses 615 0$aComputer systems 615 0$aInformation technology 676 $a004 702 $aHartmann$b Sven$f1969- 702 $aKern-Isberner$b Gabriele$f1956- 712 12$aFoIKS 2008 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483871503321 996 $aFoundations of Information and Knowledge Systems$9774287 997 $aUNINA