1,721,030 research outputs found

    Probabilistic Justification Logic

    No full text
    We present a probabilistic justification logic, PPJ, to study rational belief, degrees of belief and justifications. We establish soundness and completeness for PPJ and show that its satisfiability problem is decidable. In the last part we use PPJ to provide a solution to the lottery paradox

    Belief Expansion in Subset Models

    No full text
    Subset models provide a new semantics for justifcation logic.The main idea of subset models is that evidence terms are interpreted assets of possible worlds. A term then justifies a formula if that formula istrue in each world of the interpretation of the term.In this paper, we introduce a belief expansion operator for subset mod-els. We study the main properties of the resulting logic as well as thedifferences to a previous (symbolic) approach to belief expansion in jus-tification logic

    A Logic of Interactive Proofs

    Full text link
    We introduce the probabilistic two-agent justification logic IPJ⁠, a logic in which we can reason about agents that perform interactive proofs. In order to study the growth rate of the probabilities in IPJ⁠, we present a new method of parametrizing IPJ over certain negligible functions. Further, our approach leads to a new notion of zero-knowledge proofs

    Providing Cost-Effective Multimedia Services in a Concurrent Engineering Environment

    No full text
    Handling of multimedia information in a concurrent engineering environment requires that it be delivm·ed in a cost effective manner, yet having high consumc~r satisfaction. Since most such products run on general purpose computers connected by off the shelf networks, multimedia streams are likely to encounter frame losses, delays and mis-synchronizations, resulting in poor quality. This paper presents metrics to measure such qualitative degradations and reports the results of a user study to validate them. Furthermore, this paper includes the results of a performance analysis of the Continuous Media Toolkit (GMT) for constructing multimedia demonstrations, to measure its ability to satisfy parameters obtained in the user survey. In addition, we describe some enhancements that are being made to CMT to ensure user needs are met.This work is partially supported by Air Force contract number F30602-96-C-01J0 to Honeywell Inc, via subcontract number B09030541/ AF to the University of Minnesota and DOD MURI grant DAAH04-96-10341 to Cornell UniversityWijesekera, Duminda; Parikh, Shwetal; Varadarajan, Srivatsan; Srivastava, Jaideep; Nerode, Anil. (1997). Providing Cost-Effective Multimedia Services in a Concurrent Engineering Environment. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215336

    Performance Evaluation of Media Losses in the Continuous Media Toolkit

    No full text
    Rapid growth of multimedia systems, and accordingly research in this area requires fast prototyping environments. The Berkeley Continuous Media Toolkit (GMT} is a popular environment that satisfies this need. Form a human user's perspective, in order for multimedia demonstrations to be comprehensible, the number of audio or video frames dropped and the timing delays in the ones that are displayed, need to be kept to a minimum. Therefore, it is important to know the frame dropping characteristics of CMT. In a series of experiments we rnonir.ored tlHi variation of thPse parameters with respect processor and network loads. It was obsprvrd that loads affen ap,gregau· frame drops at lower rates and consecutive frame drops at higher rates. Because at a higher rates a liarge number of consecutive frames are dropped, the ones that are played appear in a more timely manner. As a solution to observed problems, we present some QoS based approaches to control drop and delay parameters.This work is partially supported by Air Force contract number F30602-96-C-0I30 to Honeywell Inc, via subcontract number B09030541/ AF to the University of Minnesota and DOD MURI grant DAAH04-96-10341 to Cornell UniversityWijesekera, Duminda; Parikh, Shwetal; Varadarajan, Srivatsan; Srivastava, Jaideep; Nerode, Anil. (1997). Performance Evaluation of Media Losses in the Continuous Media Toolkit. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215338

    Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics

    No full text
    The admissible rules of a logic are those rules under which the set of theorems of the logic is closed. In a previous paper by the authors, formal systems for deriving the admissible rules of Intuitionistic Logic and a class of modal logics were defined in a proof-theoretic framework where the basic objects of the systems are sequent rules. Here, the framework is extended to cover derivability of the admissible rules of intermediate logics and a wider class of modal logics, in this case, by taking hypersequent rules as the basic objects
    corecore