918 resultados para Dominant logic
Resumo:
This paper reports on a system for automated agent negotiation, based on a formal and executable approach to capture the behavior of parties involved in a negotiation. It uses the JADE agent framework, and its major distinctive feature is the use of declarative negotiation strategies. The negotiation strategies are expressed in a declarative rules language, defeasible logic, and are applied using the implemented system DR-DEVICE. The key ideas and the overall system architecture are described, and a particular negotiation case is presented in detail.
Resumo:
In this paper we follow the BOID (Belief, Obligation, Intention, Desire) architecture to describe agents and agent types in Defeasible Logic. We argue, in particular, that the introduction of obligations can provide a new reading of the concepts of intention and intentionality. Then we examine the notion of social agent (i.e., an agent where obligations prevail over intentions) and discuss some computational and philosophical issues related to it. We show that the notion of social agent either requires more complex computations or has some philosophical drawbacks.
Resumo:
While some recent frameworks on cognitive agents addressed the combination of mental attitudes with deontic concepts, they commonly ignore the representation of time. An exception is [1]that manages also some temporal aspects both with respect to cognition and normative provisions. We propose in this paper an extension of the logic presented in [1]with temporal intervals.
Resumo:
The theory of Owicki and Gries has been used as a platform for safety-based verifcation and derivation of concurrent programs. It has also been integrated with the progress logic of UNITY which has allowed newer techniques of progress-based verifcation and derivation to be developed. However, a theoretical basis for the integrated theory has thus far been missing. In this paper, we provide a theoretical background for the logic of Owicki and Gries integrated with the logic of progress from UNITY. An operational semantics for the new framework is provided which is used to prove soundness of the progress logic.
Resumo:
We explore of the feasibility of the computationally oriented institutional agency framework proposed by Governatori and Rotolo testing it against an industrial strength scenario. In particular we show how to encode in defeasible logic the dispute resolution policy described in Article 67 of FIDIC.
Resumo:
This article extends Defeasible Logic to deal with the contextual deliberation process of cognitive agents. First, we introduce meta-rules to reason with rules. Meta-rules are rules that have as a consequent rules for motivational components, such as obligations, intentions and desires. In other words, they include nested rules. Second, we introduce explicit preferences among rules. They deal with complex structures where nested rules can be involved.
Resumo:
The effect of adjuvant on induction of human papillomavirus type 16 E7 protein-specific cytotoxic T lymphocytes (CTL) and immunoglobulin G (IgG)(2a) antibody was studied in C57BL/6 J mice immunized with various adjuvants and E7 protein. Quil-A adjuvant, but not complete Freund's adjuvant (CFA) or Algammulin, induced a T-helper 1 (Th1)-type response to E7, which was characterized by CTL activity against a tumour cell line transfected with E7 protein and by E7-specific IgG(2a). All tested adjuvants elicited comparable levels of E7-specific IgG(1). The longest duration and greatest magnitude of CTL response was seen following two immunizations with the highest dose of E7 and Quil-A. Simultaneous immunization with a Th1 and a T helper 2 (Th2)-promoting adjuvant gave a Th1-type response. However, E7 and Quil-A were unable to induce a Th1-type response (as measured by the inability to generate anti-E7 IgG(2a) antibody) in animals with a pre-existing Th2-type response to E7. These results suggest that saponin adjuvants may be suitable for immunotherapy in humans where a Th1-type response is sought, provided that there is no pre existing Th2-type response to the antigen.
Resumo:
The refinement calculus provides a framework for the stepwise development of imperative programs from specifications. In this paper we study a refinement calculus for deriving logic programs. Dealing with logic programs rather than imperative programs has the dual advantages that, due to the expressive power of logic programs, the final program is closer to the original specification, and each refinement step can achieve more. Together these reduce the overall number of derivation steps. We present a logic programming language extended with specification constructs (including general predicates, assertions, and types and invariants) to form a wide-spectrum language. General predicates allow non-executable properties to be included in specifications. Assertions, types and invariants make assumptions about the intended inputs of a procedure explicit, and can be used during refinement to optimize the constructed logic program. We provide a semantics for the extended logic programming language and derive a set of refinement laws. Finally we apply these to an example derivation.
Resumo:
Nursing diagnoses associated with alterations of urinary elimination require different interventions, Nurses, who are not specialists, require support to diagnose and manage patients with disturbances of urine elimination. The aim of this study was to present a model based on fuzzy logic for differential diagnosis of alterations in urinary elimination, considering nursing diagnosis approved by the North American Nursing Diagnosis Association, 2001-2002. Fuzzy relations and the maximum-minimum composition approach were used to develop the system. The model performance was evaluated with 195 cases from the database of a previous study, resulting in 79.0% of total concordance and 19.5% of partial concordance, when compared with the panel of experts. Total discordance was observed in only three cases (1.5%). The agreement between model and experts was excellent (kappa = 0.98, P < .0001) or substantial (kappa = 0.69, P < .0001) when considering the overestimative accordance (accordance was considered when at least one diagnosis was equal) and the underestimative discordance (discordance was considered when at least one diagnosis was different), respectively. The model herein presented showed good performance and a simple theoretical structure, therefore demanding few computational resources.
Resumo:
Primary Hodgkin`s lymphoma (HL) of the stomach is an extremely rare entity. Most cases of gastric involvement by HL are observed in the setting of disseminated disease. The nonspecific nature of the symptoms and endoscopic findings, which include a large malignant-looking ulcer and mass or wall thickening, together with the considerable histological overlap between HLs and some non-HLs or undifferentiated carcinoma, make the surgical resection diagnosis extremely difficult. An accurate diagnosis is important as treatment and outcome differ significantly for these neoplasms. In small endoscopic gastric biopsies and even in postoperative specimens, the precise histological diagnosis of HL is particularly challenging. Here, the authors report 5 cases of 2 women and 3 men aged 22 to 68, with gastric involvement by classic HLs-3 primary gastric HLs and 2 as part of widespread disease. All 5 patients presented with digestive symptoms. At endoscopy, the lesions presented as ulcerated and elevated lesions, with or without mucosal thickening. Four patients were misdiagnosed in the preoperative biopsy or in the gastrectomy specimen. Association with Epstein-Barr virus (EBV) was detected in 4 cases, with a predominance of subtype A EBV. These cases illustrate the significant difficulties, both clinical and pathological, in achieving the diagnosis of HL involving the stomach in immunocompetent patients.
Resumo:
In this paper we demonstrate a refinement calculus for logic programs, which is a framework for developing logic programs from specifications. The paper is written in a tutorial-style, using a running example to illustrate how the refinement calculus is used to develop logic programs. The paper also presents an overview of some of the advanced features of the calculus, including the introduction of higher-order procedures and the refinement of abstract data types.