Logics in Artificial Intelligence 11th European Conference, JELIA 2008, Dresden, Germany, September 28-October 1, 2008. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Hölldobler, Steffen (Επιμελητής έκδοσης), Lutz, Carsten (Επιμελητής έκδοσης), Wansing, Heinrich (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
• Σειρά: Lecture Notes in Computer Science, 5293
• Θέματα: Computer science.; Computer programming.; Programming languages (Electronic computers).; Mathematical logic.; Artificial intelligence.; Computer Science.; Artificial Intelligence (incl. Robotics).; Programming Languages, Compilers, Interpreters.; Programming Techniques.; Mathematical Logic and Formal Languages.

 This 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. 

 Invited 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.