Publications
232 results found
Lomuscio A, Nute D, 2005, Deontic Logic in Computer Science - Special Issue, Journal of Applied Logic, Vol: 3
Kacprzak M, Lomuscio A, Penczek W, 2004, From bounded to unbounded model checking for temporal epistemic logic, FUNDAMENTA INFORMATICAE, Vol: 63, Pages: 221-240, ISSN: 0169-2968
- Author Web Link
- Cite
- Citations: 9
Kacprzak M, Lomuscio A, Penczek W, 2004, Verification of multiagent systems via unbounded model checking, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004, Vol: 2, Pages: 638-645
We present an approach to the problem of verification of epistemic properties of multi-agent systems by means of symbolic model checking. In particular, it is shown how to extend the technique of unbounded model checking from a purely temporal setting to a temporal-epistemic one. In order to achieve this, we base our discussion on interpreted systems semantics, a popular semantics used in multi-agent systems literature. We give details of the technique and show how it can be applied to the well-known train, gate and controller problem.
Raimondi F, Lomuscio A, 2004, Verification of multiagent systems via ordered binary decision diagrams: An algorithm and its implementation, Pages: 630-637
We investigate the problem of the verification of epistemic properties of multiagent systems via model checking. Specifically, we extend and adapt methods based on ordered binary decision diagrams, a mainstream verification technique in reactive systems. We provide an algorithm, and present a software package that implements it. We discuss the software and benchmark it by means of a standard example in the literature, the dining cryptographers.
Van Der Hoek W, Lomuscio A, 2004, A logic for ignorance, Pages: 117-133, ISSN: 1571-0661
We introduce and motivate a non-standard multi-modal logic to represent and reason about ignorance in Multi-Agent Systems. We argue that in Multi-agent systems being able to reason about what agents ignore is just as important as being able to reason about what agents know. We show a sound and complete axiomatisation for the logic. We investigate its applicability by restating the feasibility condition for the FIPA communication primitive of inform. © 2004 Published by Elsevier Science B.V.
Van Der Hoek W, Lomuscio A, De Vink E, et al., 2004, Electronic Notes in Theoretical Computer Science: Preface, ISSN: 1571-0661
Raimondi F, Lomuscio A, 2004, Automatic verification of deontic interpreted systems by model checking via OBDD's, Pages: 48-52, ISSN: 0922-6389
We present an algorithm for the verification of multiagent systems specified by means of a modal logic that includes a temporal, an epistemic, and a deontic operator. Verification is performed by model checking on OBDD's. We present an implementation of the algorithm and report on experimental results for the bit transmission problem with faults.
Wozna B, Lomuscio A, Penczek W, 2004, Bounded model checking for deontic interpreted systems, Electronic Notes of Theoretical Computer Science, Vol: 126
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
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
Raimondi F, Lomuscio A, 2004, A tool for the specification and verification of epistemic properties in interpreted systems, Electronic Notes of Theoretical Computer Science, Vol: 85
Kacprazk M, Lomuscio A, Penczek W, 2004, Verification of multiagent systems via unbounded model checking, Proceedings of the Third International Joint on Autonomous Agents and Multiagent systems (AAMAS04), Publisher: ACM
Lomuscio A, Sergot MJ, 2004, A formulation of violation, error recovery, and enforcement in the bit transmission problem, Journal of Applied Logic, Vol: 2
Raimondi F, Lomuscio A, 2004, Automatic verification of deontic interpreted systems by model checking via obdds, Proceedings of the Sixteenth European Conference on Artificial Intelligence (ECAI04), Publisher: IOS
Kacprzak M, Lomuscio A, Ĺasica T, et al., 2004, Verifying Multi-agent Systems via Unbounded Model Checking, Publisher: Springer Berlin Heidelberg, Pages: 189-212, ISSN: 0302-9743
, 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, 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
- Author Web Link
- Cite
- Citations: 1
Wozna B, Lomuscio A, 2004, A logic for knowledge, correctness, and real time, 5th International Workshop on Computational Logic in Multi-Agent Systems, Publisher: SPRINGER-VERLAG BERLIN, Pages: 1-15, ISSN: 0302-9743
- Author Web Link
- Cite
- Citations: 4
van der Hoek W, Lomuscio A, 2004, A Logic for Ignorance, Electronic Notes of Theoretical Computer Science, Vol: 85
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.
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: 1572-9907
In the last few years we have witnessed a surge of business-to-consumer and business-to-business commerce operated on the Internet. However, most current electronic commerce systems are little more than electronic catalogues that allow a user to purchase a product under predetermined and inflexible terms and conditions. We believe that in the next few years we will see a new generation of electronic commerce systems emerge, based on automated negotiation. In this paper, we identify the main parameters on which any automated negotiation depends. To show the applicability of our classification framework, we use it to categorise a representative sample of some of the most prominent negotiation models that exist in the literature.
Lomuscio A, Raimondi F, Sergot MJ, 2003, Towards model checking interpreted systems, Proceedings of AAMAS03, Second International Conference on Autonomous Agents and Multi-Agent Systems, Publisher: ACM
Penczek W, Lomuscio A, 2003, Verifying epistemic properties of multi-agent systems via bounded model checking., Publisher: ACM, Pages: 209-216
Lomuscio A, Sergot M, 2003, Deontic interpreted systems, Studia Logica, Vol: 75, Pages: 63-92, ISSN: 0039-3215
van der Hoek W, Lomuscio A, 2003, Ignore at your peril - towards a logic for ignorance, Proceedings of AAMAS03, Second International Conference on Autonomous Agents and Multi-Agent Systems, Publisher: ACM
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
- Author Web Link
- Cite
- Citations: 9
Lomuscio A, Sergot MJ, 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 model checking, Proceedings of AAMAS03, Second International Conference on Autonomous Agents and Multi-Agent Systems, Publisher: ACM
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.