Relating Protocols For Dynamic Dispute With Logics For Defeasible Argumentation

Internet voting protocols is the base of the Internet voting systems. In this paper a new practical Internet voting protocol is introduced. The proposed Internet voting protocol does not apply the strong physical assumptions and has the properties of privacy, completeness, soundness, fairness, invariableness, and universal verifiability, receipt-free and coercion-resistant. At the same time it solves some problems in other internet voting protocols and the verification progress of universal verifiability is simple and efficient.

With the rapid development of Internet, the network gradually changes from simple static information carrier into platform on which people express their views and show personality. Faced with such a sea of emotional information-rich text, it is urgent to find method of a quick orientation calculation on the large-scale text. Orientation calculation of words is the basis of orientation calculation on the large-scale text. Aiming at the problem that is orientation calculation of words relies mainly upon benchmark words, the paper builds dynamic benchmark set in accordance with part of speech of words and provides the method of semantic orientation calculation of words based on dynamic benchmark set. The proposed method is tested on test set contains verbs and adjectives and more than 90% accuracy have been achieved, which shows the validity and rationality of the method.

Tableau Method and NEXPTIME-Completeness of DEL-Sequents

We consider a generic framework for anti-unification of simply typed lambda terms. It helps to compute generalizations which contain maximally common top part of the input expressions, without nesting generalization variables. The rules of the corresponding anti-unification algorithm are formulated, and their soundness and termination are proved. The algorithm depends on a parameter which decides how to choose terms under generalization variables. Changing the particular values of the parameter, we obtained four new unitary variants of higher-order anti-unification and also showed how the already known pattern generalization fits into the schema.

On construction of minimum energy k-fault resistant topologies

Shared memory concurrency is pervasive in modern programming, including in systems that must protect highly sensitive data. Recently, verification has finally emerged as a practical tool for proving interesting security properties of real programs, particularly information flow control (IFC) security. Yet there remain no general logics for verifying IFC security of shared-memory concurrent programs. In this paper we present the first such logic, COVERN (Compositional Verification of Noninterference) and its proof of soundness via a new generic framework for general rely-guarantee IFC reasoning. We apply COVERN to model and verify the security-critical software functionality of the Cross Domain Desktop Compositor, an embedded device that facilitates simultaneous and intuitive user interaction with multiple classified networks while preventing leakage between them. To our knowledge this is the first foundational, machine-checked proof of IFC security for a non-trivial shared-memory concurrent program in the literature.

Extensive Form Generalized Games

This work addresses the problem of providing explanation capabilities to an argumentation system. Explanation in defeasible argumentation is an important, and yet undeveloped field in the area. Therefore, we move in this direction by defining a concrete argument system with explanation facilities.We consider the structures that provide information on the warrant status of a literal. Our focus is put on argumentation systems based on a dialectical proof procedure, therefore we study dialectical explanations. Although arguments represent a form of explanation for a literal, we study the complete set of dialectical trees that justifies the warrant status of a literal, since this set has proved to be a useful tool to comprehend, analyze, develop, and debug argumentation systems.KeywordsBelief RevisionWarrant StatusStrong NegationDialectical ProcessDefeat RelationThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

In this paper we define a recursive semantics for warrant in a general defeasible argumentation framework by formalizing a notion of collective (non-binary) conflict among arguments. This allows us to ensure direct and indirect consistency (in the sense of Caminada and Amgoud) without distinguishing between direct and indirect conflicts. Then, the general defeasible argumentation framework is extended by allowing to attach levels of preference to defeasible knowledge items and by providing a level-wise definition of warranted and blocked conclusions. Finally, we formalize the warrant recursive semantics for the particular framework of Possibilistic Defeasible Logic Programming, characterize the unique output program property and design an efficient algorithm for computing warranted conclusions in polynomial space.

The literature on concurrency theory offers a wealth of examples of characteristic-formula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed points of suitable functions. Such constructions and their proofs of correctness have been developed independently, but have a common underlying structure. This study provides a general view of characteristic formulae that are expressed in terms of logics with a facility for the recursive definition of formulae. It is shown how several examples of characteristic-formula constructions from the literature can be recovered as instances of the proposed general framework, and how the framework can be used to yield novel constructions.

In this paper, we propose a reconstruction of logic-based approaches to abductive reasoning in terms of ampliative adaptive logics. A main advantage of this reconstruction is that the resulting logics have a proof theory. As abductive reasoning is non-monotonic, the latter is necessarily dynamic (conclusions derived at some stage may at a later stage be rejected). The proof theory warrants, however, that the conclusions derived at a given stage are justified in view of the insight in the premises at that stage. Thus, it even leads to justified conclusions for undecidable fragments. Another advantage of the proposed logics is that they are much closer to natural reasoning than the existing systems. Usually, abduction is viewed as a form of “backward reasoning”. The search procedure by which this is realized (for instance, some form of linear linear resolution) is very different from the search procedures of human reasoners. The proposed logics treat abduction as a form of “forward reasoning” (Modus Ponens in the “wrong direction”). As a result, abductive steps are very natural, and are moreover nicely integrated with deductive steps. We present two new adaptive logics for abduction, and illustrate both with some examples from the history of the sciences (the discovery of Uranus and of Neptune). We also present some alternative systems that are better suited for non-creative forms of abductive reasoning.

Link-layer fairness models that have been proposed for wireline and packet cellular networks cannot be generalized for shared channel wireless networks because of the unique characteristics of the wireless channel, such as location-dependent contention, inherent conflict between optimizing channel utilization and achieving fairness, and the absence of any centralized control.In this paper, we propose a general analytical framework that captures the unique characteristics of shared wireless channels and allows the modeling of a large class of system-wide fairness models via the specification of per-flow utility functions. We show that system-wide fairness can be achieved without explicit global coordination so long as each node executes a contention resolution algorithm that is designed to optimize its local utility function.We present a general mechanism for translating a given fairness model in our framework into a corresponding contention resolution algorithm. Using this translation, we derive the backoff algorithm for achieving proportional fairness in wireless shared channels, and compare the fairness properties of this algorithm with both the ideal proportional fairness objective, and state-of-the-art backoff-based contention resolution algorithms.We believe that the two aspects of the proposed framework, i.e. the ability to specify arbitrary fairness models via local utility functions, and the ability to automatically generate local contention resolution mechanisms in response to a given utility function, together provide the path for achieving flexible service differentiation in future shared channel wireless networks.

The universe of propositional approximations

Metapredicativity is a new general term in proof theory which describes the analysis and study of formal systems whose proof-theoretic strength is beyond the Feferman-Schutte ordinal Γ0 but which are nevertheless amenable to purely predicative methods. Typical examples of formal systems which are apt for scaling the initial part of metapredicativity are the transfinitely iterated fixed point theories IDα whose detailed proof-theoretic analysis is given by Jager, Kahle, Setzer and Strahm in [18]. In this paper we assume familiarity with [18]. For natural extensions of Friedman’s ATR that can be measured against transfinitely iterated fixed point theories the reader is referred to Jager and Strahm [20]. In the mid seventies, Feferman [3, 4] introduced systems of explicit mathematics in order to provide an alternative foundation of constructive mathematics. More precisely, it was the origin of Feferman’s program to give a logical account of Bishop-style constructive mathematics. Right from the beginning, systems of explicit mathematics turned out to be of general interest for proof theory, mainly in connection with the proof-theoretic analysis of subsystems of first and second order arithmetic and set theory, cf. e.g. Jager [15] and Jager and Pohlers [19]. More recently, systems of explicit mathematics have been used to develop a general logical framework for functional programming and type theory, where it is possible to derive correctness and termination properties of functional programs. Important references in this connection are Feferman [6, 7, 9] and Jager [17]. Universes are a frequently studied concept in constructive mathematics at least since the work of Martin-Lof, cf. e.g. Martin-Lof [23] or Palmgren [27] for

Many-valued logics in general and 3-valued logic in particular is an old subject which had its beginning in the work of Łukasiewicz [Łuk]. Recently there is a revived interest in this topic, both for its own sake (see, for example, [Ho]), and also because of its potential applications in several areas of computer science, such as proving correctness of programs [Jo], knowledge bases [CP] and artificial intelligence [Tu]. There are, however, a huge number of 3-valued systems which logicians have studied throughout the years. The motivation behind them and their properties are not always clear, and their proof theory is frequently not well developed. This state of affairs makes both the use of 3-valued logics and doing fruitful research on them rather difficult.Our first goal in this work is, accordingly, to identify and characterize a class of 3-valued logics which might be called natural. For this we use the general framework for characterizing and investigating logics which we have developed in [Av1]. Not many 3-valued logics appear as natural within this framework, but it turns out that those that do include some of the best known ones. These include the 3-valued logics of Łukasiewicz, Kleene and Sobociński, the logic LPF used in the VDM project, the logic RM3 from the relevance family and the paraconsistent 3-valued logic of [dCA]. Our presentation provides justifications for the introduction of certain connectives in these logics which are often regarded as ad hoc. It also shows that they are all closely related to each other. It is shown, for example, that Łukasiewicz 3-valued logic and RM3 (the strongest logic in the family of relevance logics) are in a strong sense dual to each other, and that both are derivable by the same general construction from, respectively, Kleene 3-valued logic and the 3-valued paraconsistent logic.