Logics in Artificial Intelligence 13th European Conference, JELIA 2012, Toulouse, France, September 26-28, 2012. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Cerro, Luis Fariñas del (Επιμελητής έκδοσης), Herzig, Andreas (Επιμελητής έκδοσης), Mengin, Jérôme (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012.
• Σειρά: Lecture Notes in Computer Science, 7519
• Θέματα: Computer science.; Computer programming.; Computer logic.; Mathematical logic.; Information storage and retrieval.; Artificial intelligence.; Computer graphics.; Computer Science.; Artificial Intelligence (incl. Robotics).; Mathematical Logic and Formal Languages.; Logics and Meanings of Programs.; Programming Techniques.; Information Storage and Retrieval.; Computer Imaging, Vision, Pattern Recognition and Graphics.

This book constitutes the refereed proceedings of the 13th European Conference on Logics in Artificial Intelligence, held in Toulouse, France, in September 2012. The book includes 3 invited talks, 36 regular papers, and 5 system descriptions, selected from 107 submissions. The papers cover various a...

Πίνακας περιεχομένων:

• Preferential Semantics for the Logic of Comparative Similarity over Triangular and Metric Models
• Nested Sequent Calculi for Conditional Logics
• Conflict-Tolerant Semantics for Argumentation Frameworks
• Knowledge Means ’All ’, Belief Means ’Most’
• Generalized DEL-Sequents
• Deciding the Bisimilarity Relation between Datalog Goals
• Inconsistency Management for Traffic Regulations: Formalization and Complexity Results
• Conditional Epistemic Planning
• PTL: A Propositional Typicality Logic
• The Complexity of One-Agent Refinement Modal Logic
• The View-Update Problem for Indefinite Databases
• Three-Valued Logics for Incomplete Information and Epistemic Logic
• Exploiting Unfounded Sets for HEX-Program Evaluation
• Using Satisfiability for Non-optimal Temporal Planning
• How to Exploit Parametric Uniformity for Maximum Entropy Reasoning in a Relational Probabilistic Logic
• Exact Query Reformulation with First-Order Ontologies and Databases
• A Selective Semantics for Logic Programs with Preferences
• A Minimal Model Semantics for Nonmonotonic Reasoning
• Extending a Temporal Defeasible Argumentation Framework with Possibilistic Weights
• On Decidability of a Logic for Order of Magnitude Qualitative Reasoning with Bidirectional Negligibility
• Fault Tolerance in Belief Formation Networks
• Large-Scale Cost-Based Abduction in Full-Fledged First-Order Predicate Logic with Cutting Plane Inference
• Belief Base Change Operations for Answer Set Programming
• A Framework for Semantic-Based Similarity Measures for ELH-Concepts
• Sequent Systems for Lewis’ Conditional Logics
• Relevant Minimal Change in Belief Update
• Minimal Proof Search for Modal Logic K Model Checking
• Building an Epistemic Logic for Argumentation
• A Unifying Perspective on Knowledge Updates
• Verifying Brahms Human-Robot Teamwork Models
• On Satisfiability in ATL with Strategy Contexts
• Jumping to Conclusions: A Logico-Probabilistic Foundation for Defeasible Rule-Based Arguments
• Beyond Maxi-Consistent Argumentation Operators
• Reasoning about Agent Programs Using ATL-Like Logics
• Qualitative Approximate Behavior Composition
• A Preferential Framework for Trivialization-Resistant Reasoning with Inconsistent Information
• DebateWEL: An Interface for Debating with Enthymemes and Logical Formulas
• OMiGA: An Open Minded Grounding On-The-Fly Answer Set Solver
• The Multi-Engine ASP Solver ME-ASP
• A System for the Use of Answer Set Programming in Reinforcement Learning
• The Tableau Prover Generator MetTeL2.