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

An Effective Fixpoint Semantics for Linear Logic Programs

In this paper we investigate the theoretical foundation of a new bottom-up semantics for linear logic programs, and more precisely for the fragment of LinLog that consists of the language LO enriched with the constant 1. We use constraints to symbolically and finitely represent possibly infinite collections of provable goals. We define a fixpoint semantics based on a new operator in the style of Tp working over constraints. An application of the fixpoint operator can be computed algorithmically. As sufficient conditions for termination, we show that the fixpoint computation is guaranteed to converge for propositional LO. To our knowledge, this is the first attempt to define an effective fixpoint semantics for linear logic programs. As an application of our framework, we also present a formal investigation of the relations between LO and Disjunctive Logic Programming. Using an approach based on abstract interpretation, we show that DLP fixpoint semantics can be viewed as an abstraction of our semantics for LO. We prove that the resulting abstraction is correct and complete for an interesting class of LO programs encoding Petri Nets.Comment: 39 pages, 5 figures. To appear in Theory and Practice of Logic Programmin

Perfect tag identification protocol in RFID networks

Radio Frequency IDentification (RFID) systems are becoming more and more popular in the field of ubiquitous computing, in particular for objects identification. An RFID system is composed by one or more readers and a number of tags. One of the main issues in an RFID network is the fast and reliable identification of all tags in the reader range. The reader issues some queries, and tags properly answer. Then, the reader must identify the tags from such answers. This is crucial for most applications. Since the transmission medium is shared, the typical problem to be faced is a MAC-like one, i.e. to avoid or limit the number of tags transmission collisions. We propose a protocol which, under some assumptions about transmission techniques, always achieves a 100% perfomance. It is based on a proper recursive splitting of the concurrent tags sets, until all tags have been identified. The other approaches present in literature have performances of about 42% in the average at most. The counterpart is a more sophisticated hardware to be deployed in the manufacture of low cost tags.Comment: 12 pages, 1 figur

Rituximab and autologous stem-cell transplantation for high-risk diffuse large B-cell lymphoma - Authors' reply

n

Minimum Message Waiting Time Scheduling in Distributed Systems

In this paper, we examine the problem of packet scheduling in a single-hop multichannel system, with the goal ofminimizing the average message waiting time. Such an objective function represents the delay incurred by the users before receivingthe desired data. We show that the problem of finding a schedule with minimum message waiting time is NP-complete, by means ofpolynomial time reduction of the time table design problem to our problem. We present also several heuristics that result in outcomesvery close to the optimal ones. We compare these heuristics by means of extensive simulations

Primary mediastinal lymphoma: diagnosis and treatment options.

Primary mediastinal large B-cell lymphoma (PMBCL) is a unique B-cell lymphoma variant that arises from a putative thymic medulla B cell. It constitutes 2-4% of non-Hodgkin lymphomas and occurs most frequently in young females. PMBCL is characterized by a diffuse proliferation of medium-to-large B cells associated with sclerosis. Molecular analysis shows that PMBCL is a distinct entity compared to other types of diffuse large B-cell lymphomas. PMBCL is characterized by a locally invasive anterior mediastinal bulky mass. The combination of rituximab with CHOP/CHOP-like regimens followed by mediastinal radiation therapy (RT) is associated with a 5-year progression-free survival of 75-85%. However, the role of consolidation RT still remains uncertain. More intensive regimens, such as DA-EPOCH-R without mediastinal RT, have shown very promising results. The conclusive role of PET-CT scan requires prospective studies and there is hope that this may allow to de-escalate RT and accordingly yield reliable prognostic information

Minimizing the Message Waiting Time in Single-Hop Multichannel Systems

In this paper, we examine the problem of packet scheduling in a single-hop multichannel systems, with the goal of minimizing the average message waiting time. Such an objective function represents the delay incurred by the users before receiving the desired data. We show that the problem of finding a schedule with minimum message waiting time, is NP-complete, by means of polynomial time reduction of the time table design problem to our problem. We present also several heuristics which result in outcomes very close to the optimal ones. We compare these heuristics by means of extensive simulations

Is now the time for molecular driven therapy for diffuse large B-cell lymphoma?

INTRODUCTION: Recent genetic and molecular discoveries regarding alterations in diffuse large B-cell lymphoma (DLBCL) deeply changed the approach to this lymphoproliferative disorder. Novel additional predictors of outcomes and new therapeutic strategies are being introduced to improve outcomes. Areas covered: This review aims to analyse the recent molecular discoveries in DLBCL, the rationale of novel molecular driven treatments and their impact on DLBCL prognosis, especially in ABC-DLBCL and High Grade B Cell Lymphoma. Pre-clinical and clinical evidences are reviewed to critically evaluate the novel DLBCL management strategies. Expert commentary: New insights in DLBCL molecular characteristics should guide the therapeutic approach; the results of the current studies which are investigating safety and efficacy of novel 'X-RCHOP' will probably lead, in future, to a cell of origin (COO) based upfront therapy. Moreover, it is necessary to identify early patients with DLBCL who carried MYC, BCL2 and/or BCL6 rearrangements double hit lymphomas (DHL) because they should not receive standard R-CHOP but high intensity treatment as reported in many retrospective studies. New prospective trials are needed to investigate the more appropriate treatment of DHL

Integrity constraints in logic databases

AbstractWe consider logic databases as logic programs and suggest how to deal with the problem of integrity constraint checking. Two methods for integrity constraint handling are presented. The first one is based on a metalevel consistency proof and is particularly suitable for an existing database which has to be checked for some integrity constraints. The second method is based on a transformation of the logic program which represents the database into a logic program which satisfies the given integrity constraints. This method is specially suggested for databases that have to be built specifying, separately, which are the deductive rules and the facts and which are the integrity constraints on a specific relation. Different tools providing for the two mechanisms are proposed for a flexible logic database management system