482,931 research outputs found
Pre-play communication and credibility: A test of Aumann's conjecture
The effectiveness of pre-play communication in achieving efficient outcomes has long been a subject of controversy. In some environments, cheap talk may help to achieve coordination. However, Aumann conjectures that, in a variant of the Stag Hunt game, a signal for efficient play is not self-enforcing and concludes that an "agreement to play [the efficient outcome] conveys no information about what the players will do." Harsanyi and Selten (1988) cite this example as an illustration of risk-dominance vs. payoff-dominance. Farrell and Rabin (1996) agree with the logic, but suspect that cheap talk will nonetheless achieve efficiency. The conjecture is tested with one-way communication. When the sender first chooses a signal and then an action, there is impressive coordination: a 94% probability for the potentially efficient (but risky) play, given a signal for efficient play. Without communication, efforts to achieve efficiency were unsuccessful, as the proportion of B moves is only 35%. I also test a hypothesis that the order of the action and the signal affects the results, finding that the decision order is indeed important. While Aumann’s conjecture is behaviorally disconfirmed when the signal is determined initially, the signal’s credibility seems to be much more suspect when the sender is known to have first chosen an action, and the results are not statistically distinguishable from those when there is no signal. Some applications and issues in communication and coordination are discussed.Cheap talk, coordination, credibility, experiment, Leex
Analysing accident reports using structured and formal methods
Formal methods are proposed as a means to improve accident reports, such as the report into the 1996 fire in the Channel Tunnel between the UK and France. The size and complexity of accident reports create difficulties for formal methods, which traditionally suffer from problems of scalability and poor readability. This thesis demonstrates that features of an engineering-style formal modelling process, particularly the structuring of activity and management of information, reduce the impact of these problems and improve the accuracy of formal models of accident reports. This thesis also contributes a detailed analysis of the methodological requirements for constructing accident report models.
Structured, methodical construction and mathematical analysis of the models elicits significant problems in the content and argumentation of the reports. Once elicited,
these problems can be addressed. This thesis demonstrates the benefits and limitations of taking a wider scope in the modelling process than is commonly adopted for formal accident analysis.
We present a deontic action logic as a language for constructing models of accident reports. Deontic action models offer a novel view of the report, which highlights both the expected and actual behaviour in the report, and facilitates examination of the conflict between the two. This thesis contributes an objective analysis of the utility of both deontic and action logic operators to the application of modelling accident reports. A tool is also presented that executes a subset of the logic, including these deontic and action logic operators
Imperative change and obligation to do
The ambition of the paper is to provide a solution to the problem posed by Von Wright (1999): how is it possible that the two actions, one of producing P and the other of preventing P can have different deontic status, the former being obligatory and the latter being forbidden. The solution for the problem is sought for by an investigation into connections between imperative and deontic logic. First, it is asked whether a solution could be found in Lemmon's (1965) system of "change logic", using his idea on connection between logic of orders being in force and deontic logic. The answer is the negative one. Next, the connection between Lemmon's imperative logic and deontic logic given in Aqvist's paper - "Next" and "Ought" (1965) - is analyzed. Than, the Lemmon's treatment of imperatives is restricted to the natural language imperatives and Aqvist's way of connecting imperative and deontic logic is modified accordingly. Some principles for the natural language imperatives are established (the negation rule ; the law of contraposition for imperative conditionals) and a simple "global" semantics is developed. The notion of "opposite action" is introduced and it is given an important role in semantics. Finally, a solution for von Wright's problem is given. In the closing sections some further topics for investigation are hinted: one of them being the connection between Aqvist's epistemic- imperative conception of interrogatives and "epistemic obligations", the other being formalization of the idea that imperatives create and re-create obligation patterns that can be described in deontic terms
Logic-Based Specification Languages for Intelligent Software Agents
The research field of Agent-Oriented Software Engineering (AOSE) aims to find
abstractions, languages, methodologies and toolkits for modeling, verifying,
validating and prototyping complex applications conceptualized as Multiagent
Systems (MASs). A very lively research sub-field studies how formal methods can
be used for AOSE. This paper presents a detailed survey of six logic-based
executable agent specification languages that have been chosen for their
potential to be integrated in our ARPEGGIO project, an open framework for
specifying and prototyping a MAS. The six languages are ConGoLog, Agent-0, the
IMPACT agent programming language, DyLog, Concurrent METATEM and Ehhf. For each
executable language, the logic foundations are described and an example of use
is shown. A comparison of the six languages and a survey of similar approaches
complete the paper, together with considerations of the advantages of using
logic-based languages in MAS modeling and prototyping.Comment: 67 pages, 1 table, 1 figure. Accepted for publication by the Journal
"Theory and Practice of Logic Programming", volume 4, Maurice Bruynooghe
Editor-in-Chie
Disjunctive Logic Programs with Inheritance
The paper proposes a new knowledge representation language, called DLP<,
which extends disjunctive logic programming (with strong negation) by
inheritance. The addition of inheritance enhances the knowledge modeling
features of the language providing a natural representation of default
reasoning with exceptions.
A declarative model-theoretic semantics of DLP< is provided, which is shown
to generalize the Answer Set Semantics of disjunctive logic programs.
The knowledge modeling features of the language are illustrated by encoding
classical nonmonotonic problems in DLP<.
The complexity of DLP< is analyzed, proving that inheritance does not cause
any computational overhead, as reasoning in DLP< has exactly the same
complexity as reasoning in disjunctive logic programming. This is confirmed by
the existence of an efficient translation from DLP< to plain disjunctive logic
programming. Using this translation, an advanced KR system supporting the DLP<
language has been implemented on top of the DLV system and has subsequently
been integrated into DLV.Comment: 28 pages; will be published in Theory and Practice of Logic
Programmin
- …