Logics in Artificial Intelligence: 11th European Conference, JELIA 2008, Dresden, Germany, September 28-October 1, 2008. Proceedings / Edition 1by Steffen Holldobler
Pub. Date: 09/28/2008
Publisher: Springer Berlin Heidelberg
This volume contains the papers selected for presentation at the 11th European Conference on Logics in Arti?cial Intelligence (or Jourń ees Euro&pacute; eennes sur la Logique en Intelligence Arti?cielle, JELIA), which was held from September 28 to October 1, 2008, at the Technische Universit¨ at Dresden, Germany. In total, 98 researchpapers were submitted… See more details below
This volume contains the papers selected for presentation at the 11th European Conference on Logics in Arti?cial Intelligence (or Jourń ees Euro&pacute; eennes sur la Logique en Intelligence Arti?cielle, JELIA), which was held from September 28 to October 1, 2008, at the Technische Universit¨ at Dresden, Germany. In total, 98 researchpapers were submitted by researchersfrom 24 countries. Each submission was reviewed by at least three expert reviewers. The ?nal de- sionsonthepapersweretakenduringanelectronicProgramCommitteemeeting held on the Internet. The Program Committee accepted 32 research papers for presentation at the conference. This includes two summaries of master theses that won the best thesis awardof the EuropeanMaster’sProgrammein Com- tational Logic (EMCL) in 2006 and 2007, respectively: the paper by Magdalena Ortizon“ExtendingCARINtotheDescriptionLogicsoftheSHFamily”andthe one by Novak Novakovic on “Proof-Theoretic Approach to Deciding Subsu- tion and Computing Least Common Subsumer in EL w. r. t. Hybrid TBoxes. ” The program also included three invited lectures by Sergei Artemov, Ruth Byrne,and&Jacute; erˆ omeLang. Thelecture byRuth Byrnewasgivenjointlyto JELIA 2008 and to the 9. Fachtagung der Gesellschaft fu ¨r Kognitionswissenschaft (9th Symposium of the German Cognitive Science Society), which was held in par- lel at the Technische Universit¨ at Dresden. Also colocated with JELIA 2008 were the9thInternationalWorkshoponComputationalLogicinMulti-AgentSystems (CLIMA-IX) and the 22nd Workshop on (Constraint) Logic Programming (WLP 2008). Many people contributed to making JELIA 2008 a success. We thank the authors of the submitted papers, which were of very high quality and covered a broadrange of topics including belief revision,descriptionlogics,non-monotonic reasoning, multi-agent systems, probabilistic logic, and temporal logic.
- Springer Berlin Heidelberg
- Publication date:
- Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence Series, #5293
- Edition description:
- Product dimensions:
- 6.10(w) x 9.30(h) x 1.00(d)
Table of ContentsInvited 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.
and post it to your social network
Most Helpful Customer Reviews
See all customer reviews >