LEADER 04556oam 2200625 450 001 9910484312203321 005 20231213005655.0 010 $a3-540-87803-3 024 7 $a10.1007/978-3-540-87803-2 035 $a(CKB)1000000000490763 035 $a(SSID)ssj0000318721 035 $a(PQKBManifestationID)11265209 035 $a(PQKBTitleCode)TC0000318721 035 $a(PQKBWorkID)10335934 035 $a(PQKB)10229941 035 $a(DE-He213)978-3-540-87803-2 035 $a(MiAaPQ)EBC3063320 035 $a(MiAaPQ)EBC6413331 035 $a(PPN)129063126 035 $a(EXLCZ)991000000000490763 100 $a20210520d2008 uy 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aLogics in artificial intelligence $e11th European conference, JELIA 2008, Dresden, Germany, September 28 - October 1, 2008 : proceedings /$fSteffen Hölldobler, Carsten Lutz, Heinrich Wansing (editors) 205 $a1st ed. 2008. 210 1$aBerlin, Germany :$cSpringer,$d[2008] 210 4$d©2008 215 $a1 online resource (XI, 429 p.) 225 1 $aLecture Notes in Artificial Intelligence ;$v5293 300 $aIncludes index. 311 $a3-540-87802-5 320 $aIncludes bibliographical references and author index. 327 $aInvited Talks -- Justification Logic -- Voting in Combinatorial Domains: What Logic and AI Have to Say -- Regular Papers -- Strongly Equivalent Temporal Logic Programs -- Consistency Preservation and Crazy Formulas in BMS -- Propositional Clausal Defeasible Logic -- Complexity and Succinctness Issues for Linear-Time Hybrid Logics -- Optimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders -- Normal Form Nested Programs -- A Logic for Closed-World Interaction -- Declarative Semantics for Revision Programming and Connections to Active Integrity Constraints -- Recovering Consistency by Forgetting Inconsistency -- On the Credal Structure of Consistent Probabilities -- A Fluent Calculus Semantics for ADL with Plan Constraints -- Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks -- Query Answering in the Description Logic Horn- -- Accommodative Belief Revision -- Reasoning about Typicality in Preferential Description Logics -- Counting Complexity of Minimal Cardinality and Minimal Weight Abduction -- Uniform Interpolation by Resolution in Modal Logic -- GOAL Agents Instantiate Intention Logic -- Linear Exponentials as Resource Operators: A Decidable First-order Linear Logic with Bounded Exponentials -- Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness -- Confluence Operators -- A Game-Theoretic Measure of Argument Strength for Abstract Argumentation -- A Tableau for RoBCTL -- A Proof-Theoretic Approach to Deciding Subsumption and Computing Least Common Subsumer in w.r.t. Hybrid TBoxes -- Extending Carin to the Description Logics of the Family -- How to Restore Compactness into Probabilistic Logics? -- Combining Modes of Reasoning: An Application of Abstract Argumentation -- Cheap Boolean Role Constructors for Description Logics -- Improved Second-Order Quantifier Elimination in Modal Logic -- Literal Projection for First-Order Logic -- Meta Level Reasoning and Default Reasoning -- Rule Calculus: Semantics, Axioms and Applications. 330 $aThis book constitutes the refereed proceedings of the 11th European Conference on Logics in Artificial Intelligence, JELIA 2008, held in Dresden, Germany, Liverpool, in September/October 2008. The 32 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 98 submissions. The papers cover a broad range of topics including belief revision, description logics, non-monotonic reasoning, multi-agent systems, probabilistic logic, and temporal logic. 410 0$aLecture Notes in Artificial Intelligence ;$v5293 606 $aArtificial intelligence$vCongresses 606 $aLogic, Symbolic and mathematical$vCongresses 615 0$aArtificial intelligence 615 0$aLogic, Symbolic and mathematical 676 $a006.3 686 $a54.72$2bcl 702 $aWansing$b H$g(Heinrich)., 702 $aLutz$b Carsten$f1971- 702 $aHo?lldobler$b Steffen$f1957- 712 12$aJELIA 2008 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a9910484312203321 996 $aLogics in Artificial Intelligence$9772596 997 $aUNINA