
Computational Logic in Multi-Agent Systems
Description
Alles über E-Books | Antworten auf Fragen rund um E-Books, Kopierschutz und Dateiformate finden Sie in unserem Info- & Hilfebereich.
The 22 papers presented were carefully reviewed and selected from 43 submissions. The purpose of the CLIMA workshops is to provide a forum for discussing techniques, based on computational logic, for representing, programming and reasoning about agents and multi-agent systems in a formal way. This volume features five thematic special sessions: secrets and trust, knowledge and beliefs, logics for games and social choice, cooperation, logic and languages, and norms and normative multi-agent systems.
More details
Other editions
Additional editions

Content
- Title Page
- Preface
- Organization
- CLIMA Publications
- Table of Contents
- Secrets and Trust
- Some Thoughts on Using Argumentation to Handle Trust
- Why Trust Is Important
- The Setting for OurWork
- HowWe Use Argumentation in Handling Trust
- How Argumentation Can Help
- Our Contribution so Far
- Current and FutureWork
- Conclusions
- References
- Transitivity and Propagation of Trust in Information Sources: An Analysis in Modal Logic
- Introduction
- Informal Trust Definitions
- Logical Framework
- Formal Trust Definitions
- From Case Studies to Generalization
- Trust in Information Sources Propagation
- Related Works
- Conclusion
- References
- The Functional Dependence Relation on Hypergraphs of Secrets
- Introduction
- Hypergraphs
- Protocol: A Formal Definition
- Language of Secrets
- Axioms
- Examples of Proofs
- Soundness
- Completeness
- Protocol P0
- Main Result
- Conclusion
- References
- Knowledge and Beliefs
- Three Steps
- Knowledge-Based Protocols for Card Players
- Logical Preliminaries
- There Is No Two-Step Protocol for (4, 4, 2)
- A Safe and Informative Announcement
- The Model before and after the First Announcement
- A Three Step Protocol for (4, 4, 2)
- A Probabilistic Protocol
- Conclusion
- References
- A Modal Framework for Relating Belief and Signed Information
- Introduction
- Setting the Framework
- Representing Signed Statements
- Preferences over Information Sources
- Representing Tell Statements
- Formal Framework
- Axiomatics
- Semantics
- Linking Signatures and Beliefs
- Ranking Agents
- Careful Aggregation
- A More Confident Aggregation
- Acquiring Information
- Example
- Conclusion
- References
- On the Definability of Simulability and Bisimilarity by Finite Epistemic Models
- Introduction
- Epistemic Logic
- Simulation and Bisimulation
- Undefinability
- Definability
- Conclusion and Further Research
- References
- Logics for Games and Social Choice
- Applications of Logic in Social Choice Theory
- Social Choice Theory
- Applications of Logic
- Representation of Preferences
- Characterisation and Impossibility Results
- Automated Reasoning in Social Choice Theory
- Judgment Aggregation
- References
- A Geometric Look at Manipulation
- Introduction
- Geometry of Voting: The Saari Triangle
- A 'Geometric' Proof of the Gibbard Satterthwaite Theorem
- Some Other Properties of Resolute Voting Rules
- Reflections on Manipulation
- Conclusion
- References
- Alternating-Time Temporal Announcement Logic
- Introduction
- Formalizing Conflicting Actions
- The Logic
- Syntax
- Semantics
- The Next-Fragment of ATAL
- Adding Always and Until
- Applications
- Related Work
- Conclusion
- References
- Synthesizing Strategies for Homogenous Multi-Agent Systems with Incomplete Information
- Introduction
- Formal Model
- Modular Models
- Logical Formalism
- Synthesis of All Maximal Homogenous Strategies
- Naive Solution
- Incremental solution
- Complexity and Comparison
- Conclusion
- References
- Reasoning about Joint Action and Coalitional Ability in $K_n$ with Intersection
- Introduction
- Background
- Coalition Logic
- Multi-modal K with Intersection of Modalities
- Injective Games
- Effectivity Functions and Representation
- Multi-modal K with Intersection for Games
- Joint Action Models
- Embedding of $CL$
- Axiomatisation of Joint Action Models
- Complexity
- Discussion
- References
- Ontology Merging as Social Choice
- Introduction
- A Framework for Ontology Aggregation
- Preliminaries: Description Logics
- Ontology Aggregators
- Example
- Properties of Ontology Aggregators
- Syntactic Axioms
- Semantic Axioms
- Procedures for Ontology Aggregation
- The Majority Rule
- Quota Rules
- A Support-Based Procedure
- A Distance-Based Procedure
- Two-Stage Procedures
- Conclusion and Future Work
- References
- Cooperation
- Social Commitment Delegation and Monitoring
- Introduction
- Formal Model
- Delegation
- Similarity
- Limits and Deadlines
- Monitoring
- Case Study
- Discussion
- References
- Verifying Team Formation Protocols with Probabilistic Model Checking
- Introduction
- Preliminaries
- Probabilistic Models
- Probabilistic Model Checking and PRISM
- Definitions and Algorithms
- Definitions
- Algorithms
- Models and Experimental Setup
- PRISM Models
- Experimental Setup
- Experimental Results
- DTMC Analysis
- MDP Analysis
- STPG Analysis
- Conclusion and Future Work
- References
- Abduction-Based Search for Cooperative Answers
- Introduction
- Background
- Extended Disjunctive Programs
- Abductive Logic Programs
- Queries to an ALP
- Query Relaxation
- Running Example
- Important Concepts
- Useful Literals
- Querying Agent's Choice
- Rational Explanations
- Our Search Method
- Ranking the Explanations
- Equivalent Explanations
- The Search for Cooperative Answers
- Relaxation Trees and Issues
- Expanding the Scope of a Query
- Evaluation
- Related Work
- Conclusion and Future Work
- References
- Reasoning about Exceptions to Contracts
- Introduction
- Diagnosis in Multiagent Systems
- Contracts, Commitments and Diagnosis Architecture
- Reasoning
- Domain-Dependent Rules
- General-Purpose Reasoning Rules
- Case Study
- Customer's Fault
- Bookstore's Fault
- Conclusion and Future Work
- References
- Logic and Languages
- Probabilistic Rule Learning in Nonmonotonic Domains
- Introduction
- Preliminaries
- Approach
- ILP as Abductive Reasoning
- Model Generation
- Parameter Estimation
- Case Study: A Planning Agent
- Knowledge Base
- Trace Generation
- Experiment
- Discussion and Related Work
- Conclusions
- References
- A Formal Semantics for Brahms
- Introduction
- Brahms
- Brahms Example
- Overview of Semantics
- Time Keeping and Scheduling
- Running Workframes and Thoughtframes
- Priority and Suspension of Workframes and Thoughtframes
- Executing Plans: Activities and Communication
- Detectables
- Variables
- Brahms Syntax
- Semantics: Notation
- Semantics: Structure
- Running Example of Brahms Semantics
- System Initiation
- Scheduler Rules
- Agents and Objects Are Now Invoked
- The Cycle Continues
- Concluding Remarks and Future Work
- References
- Making Golog Norm Compliant
- Introduction
- The Golog Language
- Basic Action Theories
- Golog
- Norms
- Ought-to-Do Norms
- Ought-to-Be Norms
- Deadlines
- Internalizing Norms
- Ought-to-Do Norms
- Ought-to-Be Norms
- Deadlines
- Related Work
- Conclusions
- References
- Norms and Normative Multi-agent Systems
- Probabilistic Action and Deontic Logic
- References
- A Dynamic Logic of Institutional Actions
- Introduction
- Institutional Actions: Conceptual Analysis
- Logic
- Language
- Models
- Constraints on Models
- Updating a Model by an Action
- Truth Conditions
- Axiomatization and Complexity
- Institutional Power and Compact Characterization
- Related Works
- Conclusion
- References
- A Paraconsistent Multi-agent Framework for Dealing with Normative Conflicts
- Introduction
- A Simple Classical Multi-agent Framework
- Language
- The Logic MDC
- More on Group Obligations
- Normative Conflicts
- Avoiding Deontic Explosion: The Logic MDP
- Drawbacks of MDP
- The Adaptive Logic MDPm
- Outlook
- References
- Normative Systems Represented as Hybrid Knowledge Bases
- Introduction
- Framework
- Language
- Example
- Formal Semantics
- Hybrid MKNF Knowledge Bases
- Well-Founded MKNF Model
- Implementation
- $CDF-Rules$
- Implementing Judicial Knowledge Bases
- Conclusions and Future Work
- References
- Acting on Norm Constrained Plans
- Introduction
- Plans and Norms
- Constraints, Substitution and Unification
- Actions and Plans
- Norms
- Permissions and Conflicts
- Normative Rules
- Enactment States
- Transitioning between Enactment States
- From Plans to Norm Constrained Actions
- Evaluation
- Discussion
- Conclusions and Future Work
- References
- Justice Delayed Is Justice Denied: Logics for a Temporal Account of Reparations and Legal Compliance
- Introduction
- The Many Faces of Obligations
- Temporalised Violation Logic
- Proof Conditions
- Checking Compliance
- Summary and Related Work
- References
- Author Index
System requirements
File format: PDF
Copy protection: Watermark-DRM (Digital Rights Management)
System requirements:
- Computer (Windows; MacOS X; Linux): Use the free software Adobe Reader, Adobe Digital Editions, or any other PDF viewer of your choice (see eBook Help).
- Tablet/Smartphone (Android; iOS): Install the free app Adobe Digital Editions or another reading app for eBooks, e.g., PocketBook (see eBook Help).
- E-reader: Bookeen, Kobo, Pocketbook, Sony, Tolino and many more (only limited: Kindle).
The file format PDF always displays a book page identically on any hardware. This makes PDF suitable for complex layouts such as those used in textbooks and reference books (images, tables, columns, footnotes). Unfortunately, on the small screens of e-readers or smartphones, PDFs are rather annoying, requiring too much scrolling.
This eBook uses Watermark-DRM, a „soft” copy protection. This means that there are no technical restrictions to prevent illegal distribution. However, there is a personalised watermark embedded in the eBook that can be used to identify the purchaser of the eBook in the event of misuse and to provide evidence for legal purposes.
For more information, see our eBook Help page.