187 results found
van der Hoek W, Lomuscio A, 2004, A logic for ignorance, DECLARATIVE AGENT LANGUAGES AND TECHNOLOGIES, Vol: 2990, Pages: 97-108, ISSN: 0302-9743
Raimondi F, Lomuscio A, 2004, Automatic verification of deontic properties of multi-agent systems, 7th International Workshop on Deontic Logic in Computer Science, Publisher: SPRINGER-VERLAG BERLIN, Pages: 228-242, ISSN: 0302-9743
Raimondi F, Lomuscio A, 2004, Automatic verification of deontic interpreted systems by model checking via OBDD'S, 16th European Conference on Artificial Intelligence, Publisher: I O S PRESS, Pages: 53-57, ISSN: 0922-6389
Lomuscio A, Nute D, 2004, Proceedings of DEON04, Publisher: Springer
Lomuscio A, Sergot MJ, 2004, A formulation of violation, error recovery, and enforcement in the bit transmission problem, Journal of Applied Logic, Vol: 2
Lomuscio A, Sergot M, 2004, A formalisation of violation, error recovery, and enforcement in the bit transmission problem, Journal of Applied Logic, Vol: 2, Pages: 93-116, ISSN: 1570-8683
Kacprzak M, Lomuscio A, Lasica T, et al., 2004, Verifying Multi-agent Systems via Unbounded Model Checking., Publisher: Springer, Pages: 189-212
, 2004, Deontic Logic in Computer Science, 7th International Workshop on Deontic Logic in Computer Science, DEON 2004, Madeira, Portugal, May 26-28, 2004. Proceedings, Publisher: Springer
Raimondi F, Lomuscio A, 2004, Symbolic model checking of multi-agent systems via OBDDs: an algorithm and its implementation, roceedings of the 3rd International Joint Conference on Autonomous Agents and Multi Agent Systems (AAMAS04), Publisher: ACM
Van der Hoek W, Lomuscio A, 2003, Ignore at Your Peril - Towards a Logic for Ignorance, Pages: 1148-1149
The usefulness of non-standard modal logic for explaining ignorance in multi-agent systems is discussed. Semantic definitions for a non-standard modal operator and the issues related to axiomatization are described. The state of ignorance is an invariant in the execution. The formalisms resulting from the refinements of BAN logic are concerned with proving that particular protocols are secure. Secure protocols imply that any intruder will not be able to decrypt the messages being exchanged.
Lomuscio A, Raimondi F, Sergot MJ, 2003, Towards Model Checking Interpreted Systems, Pages: 1054-1055
A software platform used to check validity of propositional modal formulas, to verify static properties of multi-agent systems formalized on interpreted systems semantics was described. The technical results on violations of the bit-transmission protocol was also studied. The Akka front-end software platform was used to check the epistemic properties of the scenario. It was shown that it is possible to pair the NuSMV model checker with Akka, a software platform used to check validity of proporsitional modal formulas.
Penczek W, Lomuscio A, 2003, Verifying epistemic properties of multi-agent systems via bounded model checking, Fundamenta Informaticae, Vol: 55, Pages: 167-185, ISSN: 0169-2968
We present a framework for verifying temporal and epistemic properties of multi-agent systems by means of bounded model checking. We use interpreted systems as underlying semantics. We give details of the proposed technique, and show how it can be applied to the "attacking generals problem", a typical example of coordination in multi-agent systems.
Penczek W, Lomuscio A, 2003, Verifying epistemic properties of multi-agent systems via bounded model checking, Workshop on the Concurrency Specification and Programming (CS&P), Publisher: IOS PRESS, Pages: 167-185, ISSN: 0169-2968
Lomuscio AR, Wooldridge M, Jennings NR, 2003, A classification scheme for negotiation in electronic commerce, GROUP DECISION AND NEGOTIATION, Vol: 12, Pages: 31-56, ISSN: 0926-2644
Lomuscio A, Lasica T, Penczek W, 2003, Bounded model checking for interpreted systems: Preliminary experimental results, 2nd International Workshop on Formal Approaches to Agent-Based Systems (FAABS 2002), Publisher: SPRINGER-VERLAG BERLIN, Pages: 115-125, ISSN: 0302-9743
Lomuscio A, Sergot M, 2003, Deontic interpreted systems, Studia Logica, Vol: 75, Pages: 63-92, ISSN: 0039-3215
Penczek W, Lomuscio A, 2003, Verifying epistemic properties of multi-agent systems via bounded model checking., Publisher: ACM, Pages: 209-216
Governatori G, Lomuscio A, Sergot MJ, 2003, A tableaux system for deontic interpreted systems, Berlin, 16th Australian conference on artificial intelligence, University of Western Australia, Perth, Australia, 2003, Publisher: Springer-Verlag, Pages: 339-351
van der Hoek W, de Vink E, Lomuscio A, et al., 2003, Proceedings of LCMAS03 - Special issue, Electronic Notes of Theoretical Computer Science
Lomuscio A, Sergot MJ, 2003, Deontic interpreted systems, STUDIA LOGICA, Vol: 75, Pages: 63-92, ISSN: 0039-3215
D'Inverno M, Luck M, Abramsky S, et al., 2002, Practical and theoretical innovations in multi-agent systems research, Knowledge Engineering Review, Vol: 17, Pages: 295-301, ISSN: 0269-8889
Lomuscio A, Sergot M, 2002, The bit transmission problem revisited, Pages: 946-947
The design of complex multi-agent systems is increasingly having to confront the possibility that agents may not behave as they are supposed to. In addition to analysing the properties that hold if protocols are followed correctly, it is also necessary to predict, test, and verify the properties that would hold if these protocols were to be violated. We illustrate how the formal machinery of deontic interpreted systems can be applied to the analysis of such problems by considering three variations of the bit transmission problem.
Lomuscio A, Sergot M, 2002, On multi-agent systems specification via Deontic Logic, Berlin, 8th international workshop on agent theories, architectures, and language (ATAL 2001), Seattle, Washington, 2001, Publisher: Springer-Verlag, Pages: 86-99
D'Inverno M, Luck M, Boutilier C, et al., 2001, Multi-agent systems research into the 21st century, Knowledge Engineering Review, Vol: 16, Pages: 271-275, ISSN: 0269-8889
The proceedings of the third UK Workshop on Multi-Agent systems (UKMAS 2001) held at St Catherine's College, Oxford were discussed. A method for solving sequential multi-agent decision problems by allowing agents to reason explicitly about specific coordination mechanisms was proposed. An adaptive organizational policy known as task and resource allocation in computational economy (TRACE), incorporating task and resource allocation for multi-agent systems that operate under time constraints and load variations was also proposed. An object-oriented extension of the multi-threaded Qu-Prolog language developed at Imperial College was also presented.
Jennings NR, Faratin P, Lomuscio AR, et al., 2001, Automated negotiation: Prospects, methods and challenges, GROUP DECISION AND NEGOTIATION, Vol: 10, Pages: 199-215, ISSN: 0926-2644
Wooldridge M, 2001, A computationally grounded logic of visibility, perception, and knowledge, Pages: 257-272, ISSN: 1367-0751
Lomuscio A, Sergot MJ, 2001, Investigation on Knowledge under Correct Behaviour, TARK01: Theoretical Aspects of Rationality and Knowledge, Publisher: Morgan Kauffman publishers
Lomuscio A, Wooldridge M, Jennings NR, 2001, A Classification Scheme for Negotiation in Electronic Commerce., Publisher: Springer, Pages: 19-33
Lomuscio AR, Meyden Van Der R, Ryan M, 2000, Knowledge in Multiagent Systems: Initial Configurations and Broadcast, Pages: 247-284, ISSN: 1529-3785
The semantic framework for the modal logic of knowledge due to Halpern and Moses provides a way to ascribe knowledge to agents in distributed and multiagent systems. In this paper we study two special cases of this framework: full systems and hypercubes. Both model static situations in which no agent has any information about another agent's state. Full systems and hypercubes are an appropriate model for the initial configurations of many systems of interest. We establish a correspondence between full systems and hypercube systems and certain classes of Kripke frames. We show that these classes of systems correspond to the same logic. Moreover, this logic is also the same as that generated by the larger class of weakly directed frames. We provide a sound and complete axiomatization, S5WDn, of this logic, and study its computational complexity. Finally, we show that under certain natural assumptions, in a model where knowledge evolves over time, S5WDn characterises the properties of knowledge not just at the initial configuration, but also at all later configurations. In particular, this holds for homogeneous broadcast systems, which capture settings in which agents are initially ignorant of each others local states, operate synchronously, have perfect recall, and can communicate only by broadcasting. © 2000, ACM. All rights reserved.
Wooldridge M, Lomuscio A, 2000, Reasoning about visibility, perception, and knowledge, Pages: 1-12, ISSN: 0302-9743
Although many formalisms have been proposed for reasoning about intelligent agents, few of these have been semantically grounded in a concrete computational model. This paper presents VSK logic, a formalism for reasoning about multi-agent systems, in which the semantics are grounded in an general, finite state machine-like model of agency. VSK logic allows us to represent: what is objectively true of the environment; what is visible, or knowable about the environment; what the agent perceives of the environment; and finally, what the agent actually knows about the environment. VSK logic is an extension of modal epistemic logic. The possible relationships between what is true, visible, perceived, and known are discussed and characterised in terms of the architectural properties of agents that they represent. Some conclusions and issues are then discussed. © Springer-Verlag Berlin Heidelberg 2000.
This data is extracted from the Web of Science and reproduced under a licence from Thomson Reuters. You may not copy or re-distribute this data in whole or in part without the written consent of the Science business of Thomson Reuters.