Logics in Artificial Intelligence
by Holldobler, Steffen; Lutz, Carsten; Wansing, HeinrichFormat: Paperback
Pub. Date: 2008-11-19
Publisher(s): Springer-Verlag New York Inc
Other versions by this Author
List Price: $96.29
Rent Textbook
Select for Price
New Textbook
We're Sorry
Sold Out
Used Textbook
We're Sorry
Sold Out
eTextbook
We're Sorry
Not Available
How Marketplace Works:
- This item is offered by an independent seller and not shipped from our warehouse
- Item details like edition and cover design may differ from our description; see seller's comments before ordering.
- Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
- Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
- Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.
Summary
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.
Table of Contents
| Invited Talks | |
| Justification Logic | p. 1 |
| Voting in Combinatorial Domains: What Logic and AI Have to Say (Extended Abstract) | p. 5 |
| Regular Papers | |
| Strongly Equivalent Temporal Logic Programs | p. 8 |
| Consistency Preservation and Crazy Formulas in BMS | p. 21 |
| Propositional Clausal Defeasible Logic | p. 34 |
| Complexity and Succinctness Issues for Linear-Time Hybrid Logics | p. 48 |
| Optimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders | p. 62 |
| Normal Form Nested Programs | p. 76 |
| A Logic for Closed-World Interaction | p. 89 |
| Declarative Semantics for Revision Programming and Connections to Active Integrity Constraints | p. 100 |
| Recovering Consistency by Forgetting Inconsistency | p. 113 |
| On the Credal Structure of Consistent Probabilities | p. 126 |
| A Fluent Calculus Semantics for ADL with Plan Constraints | p. 140 |
| Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks | p. 153 |
| Query Answering in the Description Logic Horn-SHIQ | p. 166 |
| Accommodative Belief Revision | p. 180 |
| Reasoning about Typicality in Preferential Description Logics | p. 192 |
| Counting Complexity of Minimal Cardinality and Minimal Weight Abduction | p. 206 |
| Uniform Interpolation by Resolution in Modal Logic | p. 219 |
| GOAL Agents Instantiate Intention Logic | p. 232 |
| Linear Exponentials as Resource Operators: A Decidable First-order Linear Logic with Bounded Exponentials | p. 245 |
| Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness | p. 258 |
| Confluence Operators | p. 272 |
| A Game-Theoretic Measure of Argument Strength for Abstract Argumentation | p. 285 |
| A Tableau for RoBCTL | p. 298 |
| A Proof-Theoretic Approach to Deciding Subsumption and Computing Least Common Subsumer in EL w.r.t. Hybrid TBoxes | p. 311 |
| Extending Carin to the Description Logics of the SH Family | p. 324 |
| How to Restore Compactness into Probabilistic Logics? | p. 338 |
| Combining Modes of Reasoning: An Application of Abstract Argumentation | p. 349 |
| Cheap Boolean Role Constructors for Description Logics | p. 362 |
| Improved Second-Order Quantifier Elimination in Modal Logic | p. 375 |
| Literal Projection for First-Order Logic | p. 389 |
| Meta Level Reasoning and Default Reasoning | p. 403 |
| Rule Calculus: Semantics, Axioms and Applications | p. 416 |
| Author Index | p. 429 |
| Table of Contents provided by Ingram. All Rights Reserved. |
An electronic version of this book is available through VitalSource.
This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.
By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.
Digital License
You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.
More details can be found here.
A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.
Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.
Please view the compatibility matrix prior to purchase.