Grossi / Roy / Huang | Logic, Rationality, and Interaction | E-Book | sack.de
E-Book

E-Book, Englisch, 363 Seiten, eBook

Reihe: Theoretical Computer Science and General Issues

Grossi / Roy / Huang Logic, Rationality, and Interaction

4th International Workshop, LORI 2013, Hangzhou, China, October 9-12, 2013, Proceedings
Erscheinungsjahr 2013
ISBN: 978-3-642-40948-6
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark

4th International Workshop, LORI 2013, Hangzhou, China, October 9-12, 2013, Proceedings

E-Book, Englisch, 363 Seiten, eBook

Reihe: Theoretical Computer Science and General Issues

ISBN: 978-3-642-40948-6
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark



This book collects the papers presented at the 4th International Workshop on Logic, Rationality and Interaction/ (LORI-4), held in October 2013 at the /Center for the Study of Language and Cognition, Zhejiang University, Hangzhou, China. LORI is a series that brings together researchers from a variety of logic-related fields: Game and Decision Theory, Philosophy, Linguistics, Computer Science and AI. This year had a special emphasis on Norms and Argumentation. Out of 42 submissions, 23 full papers and 11 short contributions have been selected through peer-review for inclusion in the workshop program and in this volume. The quality and diversity of these contributions witnesses a lively, fast-growing, and interdisciplinary community working at the intersection of logic and rational interaction.

Grossi / Roy / Huang Logic, Rationality, and Interaction jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Full Papers.- Boolean Games with Epistemic Goals.- Minimal Preference Change.- The Topology of Belief, Belief Revision and Defeasible Knowledge.- Plan Recognition, Indefinites, and the Semantics-Pragmatics Boundary.- A Semantic Model for Interrogatives Based on Generalized Quantifiers and Bilattices.- A Two-Tiered Formalization of Social Influence.- A Unified Epistemic Analysis of Iterated Elimination Algorithms from Regret Viewpoint.- Listen to Me! Public Announcements to Agents That Pay Attention — or Not.- An Offer You Cannot Refuse: Obtaining Efficiency and Fairness in Preplay Negotiation Games with Conditional Offers.- Sequent Calculi for Multi-modal Logic with Interaction.- Dynamic Epistemic Logic Displayed.- Reasoning about Actions Meets Strategic Logics.- A Dynamic Deontic Logic Based on Histories.- Sequent Systems for Nondeterministic Propositional Logics without Reflexivity.- How to Update Neighborhood Models.- The Logic of a Priori and a Posteriori Rationality in Strategic Games.- Proof Theory, Semantics and Algebra for Normative Systems.- Explicit and Implicit Knowledge in Neighbourhood Models.- Expressivity Hierarchy of Languages for Epistemic Awareness Models.- Public Announcements, Private Actions and Common Knowledge in S5 Structures.- Logic Aggregation.- The Task Model of Court Investigation in a Multi-agent System of Argumentation in Court.- Short Papers.- A Deontic Action Logic for Complex Actions.- Planning Using Dynamic Epistemic Logic: Correspondence and Complexity.- Judgment Aggregation with Abstentions: A Hierarchical Approach.- A Note on Bayesian Games.- A Logic for Extensive Games with Short Sight.- Aggregated Beliefs and Informational Cascades.- Dynamic Attitudes, Fixed Points and Minimal Change.- Logic of Evidence-based Knowledge.- Backward Induction Is PTIME-complete.- On Fuzzy Propositional Logic with Different Negations.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.