918 research outputs found

    Quantum logic and weak values

    Full text link
    In this study, we study weak values from a quantum-logical viewpoint. In addition, we examine the validity of the counterfactual statements of Hardy's paradox, which are based on weak values, and we show that these statements have not been validated. It is also shown that strange weak values may only appear if they are not (conditional) probabilities. PACS numbers: 03.65.Ta, 03.65.Ud, 03.65.CaComment: 1 figur

    Trust and deception in multi-agent trading systems: a logical viewpoint

    Get PDF
    Trust and deception have been of concern to researchers since the earliest research into multi-agent trading systems (MATS). In an open trading environment, trust can be established by external mechanisms e.g. using secret keys or digital signatures or by internal mechanisms e.g. learning and reasoning from experience. However, in a MATS, where distrust exists among the agents, and deception might be used between agents, how to recognize and remove fraud and deception in MATS becomes a significant issue in order to maintain a trustworthy MATS environment. This paper will propose an architecture for a multi-agent trading system (MATS) and explore how fraud and deception changes the trust required in a multi-agent trading system/environment. This paper will also illustrate several forms of logical reasoning that involve trust and deception in a MATS. The research is of significance in deception recognition and trust sustainability in e-business and e-commerce

    Presuppositions in Context: Constructing Bridges

    Get PDF
    About the book: The First International and Interdisciplinary Conference on Modelling and Using Context, Rio de Janeiro, January 1997, gave rise to the present book, which contains a selection of the papers presented there, thoroughly refereed and revised. The treatment of contexts as bona fide objects of logical formalisation has gained wide acceptance, following the seminal impetus given by McCarthy in his Turing Award address. The field of natural language offers a particularly rich variety of examples and challenges to researchers concerned with the formal modelling of context, and several chapters in the volume deal with contextualisation in the setting of natural language. Others adopt a purely formal-logical viewpoint, seeking to develop general models of even wider applicability. The 12 chapters are organised in three groups: formalisation of contextual information in natural language understanding and generation, the application of context in mechanised reasoning domains, and novel non-classical logics for contextual application

    A Framework for Combining Defeasible Argumentation with Labeled Deduction

    Full text link
    In the last years, there has been an increasing demand of a variety of logical systems, prompted mostly by applications of logic in AI and other related areas. Labeled Deductive Systems (LDS) were developed as a flexible methodology to formalize such a kind of complex logical systems. Defeasible argumentation has proven to be a successful approach to formalizing commonsense reasoning, encompassing many other alternative formalisms for defeasible reasoning. Argument-based frameworks share some common notions (such as the concept of argument, defeater, etc.) along with a number of particular features which make it difficult to compare them with each other from a logical viewpoint. This paper introduces LDSar, a LDS for defeasible argumentation in which many important issues concerning defeasible argumentation are captured within a unified logical framework. We also discuss some logical properties and extensions that emerge from the proposed framework.Comment: 15 pages, presented at CMSRA Workshop 2003. Buenos Aires, Argentin

    Classical limit and quantum logic

    Get PDF
    The more common scheme to explain the classical limit of quantum mechanics includes decoherence, which removes from the state the interference terms classically inadmissible since embodying non-Booleanity. In this work we consider the classical limit from a logical viewpoint, as a quantum-to-Boolean transition. The aim is to open the door to a new study based on dynamical logics, that is, logics that change over time. In particular, we appeal to the notion of hybrid logics to describe semiclassical systems. Moreover, we consider systems with many characteristic decoherence times, whose sublattices of properties become distributive at different times

    A logical approach to experience-based reasoning

    Get PDF
    Experience-based reasoning (EBR) is a paradigm used in almost every human activity as a part of human reasoning. However, EBR has not been seriously studied from a logical viewpoint. This paper will attempt to fill this gap by providing a unified logical approach to EBR. More specifically, this paper first examines EBR and inference rules. Then it proposes eight different rules of inference for EBR, which cover all possible EBRs from a logical viewpoint. These eight different rules of inference constitute the fundamentals for all EBR paradigms, and therefore will be the theoretical foundation for EBR. The proposed approach will facilitate research and development of EBR, human reasoning, and common sense reasoning. © 2017 World Scientific Publishing Company

    A Unified Logical Model for CBR-based E-commerce Systems

    Get PDF
    This paper will examine new issues resulting from applying CBR in e-commerce and propose a unified logical model for CBR-based e-commerce systems (CECS) which consists of three cycles and covers almost all activities of applying CBR in e-commerce. This paper also decomposes case adaptation into problem adaptation and solution adaptation, which not only improves the understanding of case adaptation in the traditional CBR, but also facilitates the refinement of activity of CBR in e-commerce and intelligent support for e-commerce. It then investigates CBR-based product negotiation. This paper thus gives insight into how to use CBR in e-commerce and how to improve the understanding of CBR with its applications in e-commerce from a logical viewpoint

    A load-balanced complete-exchange multicast protocol for wireless Ad-Hoc networks

    Get PDF
    [[abstract]]Complete-exchange multicasting is quite useful for numerous applications. We explicate a load-balanced complete-exchange multicast protocol (LCM), based on passive clustering, for wireless ad-hoc networks. From a logical viewpoint, LCM constructs multiple cluster structures to balance the traffic loads among all group members. It further avoids overloading of nodes or traffic congestion on the route. In LCM, an innovative scheme is devised to deal with the scenario in which a node plays different roles for different cluster structures. Simulation results show that LCM not only preserves all the advantages of passive clustering, but also performs very efficiently in complete-exchange multicasting. Consequently, LCM is really a feasible solution for load-balanced complete-exchange multicasting, especially for dense networks.[[conferencetype]]國際[[conferencedate]]20040627~20040629[[booktype]]紙本[[conferencelocation]]Chengdu, Chin

    Locality and measurements within the SR model for an objective interpretation of quantum mechanics

    Full text link
    One of the authors has recently propounded an SR (semantic realism) model which shows, circumventing known no-go theorems, that an objective (noncontextual, hence local) interpretation of quantum mechanics (QM) is possible. We consider here compound physical systems and show why the proofs of nonlocality of QM do not hold within the SR model. We also discuss quantum measurement theory within this model, note that the objectification problem disappears since the measurement of any property simply reveals its unknown value, and show that the projection postulate can be considered as an approximate law, valid FAPP (for all practical purposes). Finally, we provide an intuitive justification for some unusual features of the SR model.Comment: 29 pages, minor correction

    A constructive modal semantics for contextual verification

    Get PDF
    This paper introduces a non-standard semantics for a modal version of constructive KT for contextual (assumptions-based) verification. The modal fragment expresses verifiability under extensions of contexts, enjoying adapted validity and (weak) monotonicity properties depending on satisfaction of the contextual data
    • …
    corecore