1,721,026 research outputs found
Preface
No full textPreface to the proceedings of the 19th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2016) held in Phuket, Thailand, during August 22–26, 201
Preface
No full textSince the first edition in 2013, the International Workshop on Engineering Multi-Agent Systems (EMAS) is a reference venue where software engineering, MAS, and artificial intelligence researchers can meet, discuss different viewpoints and findings, and share them with industry.
Originally set up by merging three separate historical workshops – AOSE, focusing on software engineering aspects, ProMAS about programming aspects, and DALT about the application of declarative techniques to design, program, and verification of MAS – EMAS overall purpose is to facilitate the cross- fertilisation of ideas and experiences in the various fields to:
– enhance knowledge and expertise in MAS engineering and improve the state or-the art;
– define new directions for MAS engineering that are useful to practitioners, relying in results and recommendations coming from different but continuous research areas;
– investigate how practitioners can use or need to adapt established method- ologies for the engineering of large-scale and open MAS.
Like in previous editions, also the 5th edition of the workshop has been co-located with AAMAS (International Conference on Autonomous Agents and Multiagent Systems) which in 2017 took place in Brasil, Sao Paulo. The previous editions were held in St. Paul (LNAI 8245), in Paris (LNAI 8758), in Istanbul (LNAI 9318) and in Singapore (LNAI 10093).
This year the EMAS workshop was held as a two-day event. Eighteen papers were submitted to the workshop and after a double review process, ten papers were selected for inclusion in this volume. All the contributions were revised by taking into account the comments received and the discussions at the workshop. Among them, the paper “Approaching Interactions in Agent-Based Modelling with an Affordance Perspective” by Franziska Klu ̈gl and Sabine Timpf also ap- pears in LNAI 10642 [Sukthankar G., Rodriguez-Aguilar J. (eds), AAMAS 2017 Ws Best Papers, LNAI 10642, 2017, DOI: 10.1007/978-3-319-71682-4 14], since it was selected as the best paper of the workshop.
Finally, we would like to thank the members of the Program Committee for their work during the reviewing phase, as well as the members of the EMAS Steering Committee for their valuable suggestions and support. We also ac- knowledge the EasyChair conference management system for its support for the workshop organisation process
Preference elicitation with interdependency and user bother cost
No full textAgent-based scheduling systems, such as automated systems that schedule meetings for users and systems that schedule smart devices in smart homes, require the elicitation of user preferences in oder to operate in a manner that is consistent with user expectations. Unfortunately, interactions between such systems and users can be limited as human users prefer to not be overly bothered by such systems. As such, a key challenge is for the system to efficiently elicit key preferences without bothering the users too much. To tackle this problem, we propose a cost model that captures the cognitive or bother cost associated with asking a question. We incorporate this model into our iPLEASE system, an interactive preference elicitation approach. iPLEASE represents a user's preferences as a matrix, called preference matrix, and uses heuristics to select, from a given set of questions, an efficient sequence of questions to ask the user such that the total bother cost incurred to the user does not exceed a given bother cost budget. The user's response to those questions will partially populate the preference matrix. It then performs an exact matrix completion via convex optimization to approximate the remaining preferences that are not directly elicited. We empirically apply iPLEASE on randomly-generated problems as well as on a real-world dataset for the smart device scheduling problem to demonstrate that our approach outperforms other non-trivial benchmarks in eliciting user preferences.</p
A Family of Decidable Bi-intuitionistic Modal Logics
No full textWe investigate intuitionistic logics extended with both the
co-implication connective of Hilbert–Brouwer logic and with
diamond and box modalities. We use a Kripke semantics based
on frames with two ‘forth’ confluence conditions on the modal
relation with respect to the intuitionistic relation. We give
sound and strongly complete axiomatisations for entailment
on this class of frames, and give similar axiomatisations for the
subclasses of frames satisfying any combination of reflexivity,
transitivity, and seriality. We then prove that all of these
logics are decidable, by proving that they have the finite frame
property
VCWC: A Versioning Competition Workflow Compiler
No full textSystem competitions evaluate solvers and compare state-of-the-art implementations on benchmark sets in a dedicated and controlled computing environment comprising of multiple hosts. An important task for running a competition is the benchmark execution platform that schedules the workload on available benchmark machines, keeps track of failed and finished jobs, and calculates the competition statistics and solver ranking. In this paper we present VCWC, the Versioning Competition Workflow Compiler. This tool takes as input the participating solvers and dedicated benchmark sets and generates a workflow description for executing all necessary (sub-)tasks for generating the final solver rankings and statistics. As jobs may fail during the execution, VCWC supports a gradual refinement of the competition workflow and allows to add or update solvers, instances, benchmarks, or further runs after the machinery has been brought up. We introduce an abstract model for a competition and present the implementation and system architecture for VCWC. Based on this we report how VCWC is used for the Answer Set Programming Competition 2013
Reactive single-page applications with dynamic dataflow
No full textModern web applications are heavily dynamic. Several approaches, including functional reactive programming and data binding, allow a presentation layer to automatically reflect changes in a data layer. However, many of these techniques are prone to unpredictable memory performance, do not make guarantees about node identity, or cannot easily express dynamism in the dataflow graph.
We identify a point in the design space for the creation of statically-typed, reactive, dynamic, single-page web applications for the WebSharper framework in the functional-first language F#. We provide an embedding abstraction to link a dynamic dataflow graph to a DOM presentation layer in order to implement dynamic single-page applications, and show how the technique can be used to support declarative animation
AGM-style belief revision of logic programs under answer set semantics
No full textIn the past few years, several approaches for revision (and update) of logic programs have been studied. None of these however matched the generality and elegance of the original AGM approach to revision in classical logic. One particular obstacle is the underlying nonmonotonicity of the semantics of logic programs. Recently however, specific revision operators based on the monotonic concept of SE-models (which underlies the answer-set semantics of logic programs) have been proposed. Basing revision of logic programs on sets of SE-models has the drawback that arbitrary sets of SE-models may not necessarily be expressed via a logic program. This situation is similar to the emerging topic of revision in fragments of classical logic. In this paper we show how nonetheless classical AGM-style revision can be extended to various classes of logic programs using the concept of SE-models. That is, we rephrase the AGM postulates in terms of logic programs, provide a semantic construction for revision operators, and then in a representation result show that these approaches coincide. This work is interesting because, on the one hand it shows how the AGM approach can be extended to a seemingly nonmonotonic framework, while on the other hand the formal characterization may provide guiding principles for the development of specific revision operators. © 2013 Springer-Verlag
ARVis: Visualizing Relations between Answer Sets
No full textAnswer set programming (ASP) is nowadays one of the most popular modeling languages in the areas of Knowledge Representation and Artificial Intelligence. Hereby one represents the problem at hand in such a way that each model of the ASP program corresponds to one solution of the original problem. In recent years, several tools which support the user in developing ASP applications have been introduced. However, explicit treatment of one of the main aspects of ASP, multiple solutions, has received less attention within these tools. In this work, we present a novel system to visualize relations between answer sets of a given program. The core idea of the system is that the user specifies the concept of a relation by an ASP program itself. This yields a highly flexible system that suggests potential applications beyond development environments, e.g., applications in the field of abduction, which we will discuss in a case study
The Fourth Answer Set Programming Competition: Preliminary Report
No full textAnswer Set Programming is a well-established paradigm of declarative programming in close relationship with other declarative formalisms such as SAT Modulo Theories, Constraint Handling Rules, PDDL and many others. Since its first informal editions, ASP systems are compared in the nowadays customary ASP Competition. The fourth ASP Competition, held in 2012/2013, is the sequel to previous editions and it was jointly organized by University of Calabria (Italy) and the Vienna University of Technology (Austria). Participants competed on a selected collection of benchmark problems, taken from a variety of research areas and real world applications. The Competition featured two tracks: the Model& Solve Track, held on an open problem encoding, on an open language basis, and open to any kind of system based on a declarative specification paradigm; and the System Track, held on the basis of fixed, public problem encodings, written in a standard ASP language
- …
