Iterative social consolidations:Forming beliefs from many-valued evidence and peers' opinions

Recently, several logics modelling evidence have been proposed in the literature. These logics often also feature beliefs. We call the process or function that maps evidence to beliefs consolidation. In this paper, we use a four-valued modal logic of evidence as a basis. In the models for this logic, agents are represented by nodes, peer connections by edges and the private evidence that each agent has by a four-valued valuation. From this basis, we propose methods of consolidating the beliefs of the agents, taking into account both their private evidence as well as their peers' opinions. To this end, beliefs are computed iteratively. The final consolidated beliefs are the ones in the point of stabilization of the model. However, it turns out that some consolidation policies will not stabilize for certain models. Finding the conditions for stabilization is one of the main problems studied here, along with other properties of such consolidations. Our main contributions are twofold: we offer a new dynamic perspective on the process of forming evidence-based beliefs, in the context of evidence logics, and we set up and address some mathematically challenging problems, which are related to graph theory and practical subject areas such as belief/opinion diffusion and contagion in multi-agent networks.</p

Realisability of branching pomsets

A communication protocol is realisable if it can be faithfully implemented in a distributed fashion by communicating agents. Pomsets offer a way to compactly represent concurrency in communication protocols and have been recently used for the purpose of realisability analysis. In this paper we focus on the recently introduced branching pomsets, which also compactly represent choices. We define well-formedness conditions on branching pomsets, inspired by multiparty session types, and we prove that the well-formedness of a branching pomset is a sufficient condition for the realisability of the represented communication protocol

Parameterized aspects of team-based formalisms and logical inference

Parameterized complexity is an interesting subfield of complexity theory that has received a lot of attention in recent years. Such an analysis characterizes the complexity of (classically) intractable problems by pinpointing the computational hardness to some structural aspects of the input. In this thesis, we study the parameterized complexity of various problems from the area of team-based formalisms as well as logical inference. In the context of team-based formalism, we consider propositional dependence logic (PDL). The problems of interest are model checking (MC) and satisfiability (SAT). Peter Lohmann studied the classical complexity of these problems as a part of his Ph.D. thesis proving that both MC and SAT are NP-complete for PDL. This thesis addresses the parameterized complexity of these problems with respect to a wealth of different parameterizations. Interestingly, SAT for PDL boils down to the satisfiability of propositional logic as implied by the downwards closure of PDL-formulas. We propose an interesting satisfiability variant (mSAT) asking for a satisfiable team of size m. The problem mSAT restores the ‘team semantic’ nature of satisfiability for PDL-formulas. We propose another problem (MaxSubTeam) asking for a maximal satisfiable team if a given team does not satisfy the input formula. From the area of logical inference, we consider (logic-based) abduction and argumentation. The problem of interest in abduction (ABD) is to determine whether there is an explanation for a manifestation in a knowledge base (KB). Following Pfandler et al., we also consider two of its variants by imposing additional restrictions over the size of an explanation (ABD and ABD=). In argumentation, our focus is on the argument existence (ARG), relevance (ARG-Rel) and verification (ARG-Check) problems. The complexity of these problems have been explored already in the classical setting, and each of them is known to be complete for the second level of the polynomial hierarchy (except for ARG-Check which is DP-complete) for propositional logic. Moreover, the work by Nord and Zanuttini (resp., Creignou et al.) explores the complexity of these problems with respect to various restrictions over allowed KBs for ABD (ARG). In this thesis, we explore a two-dimensional complexity analysis for these problems. The first dimension is the restrictions over KB in Schaefer’s framework (the same direction as Nord and Zanuttini and Creignou et al.). What differentiates the work in this thesis from an existing research on these problems is that we add another dimension, the parameterization. The results obtained in this thesis are interesting for two reasons. First (from a theoretical point of view), ideas used in our reductions can help in developing further reductions and prove (in)tractability results for related problems. Second (from a practical point of view), the obtained tractability results might help an agent designing an instance of a problem come up with the one for which the problem is tractable

Verovatnosno zaključivanje u izračunavanju i teoriji funkcionalnih tipova

This thesis investigates two different approaches for probabilistic reasoning in models of computation. The most usual approach is to extend the language of untyped lambda calculus with probabilistic choice operator which results in probabilistic computation. This approach has shown to be very useful and applicable in various fields, e.g. robotics, natural language processing, and machine learning. Another approach is to extend the language of a typed lambda calculus with probability operators and to obtain a framework for probabilistic reasoning about the typed calculus in the style of probability logic. First, we study the lazy call-by-name probabilistic lambda calculus extended with let-in operator, and program equivalence in the calculus. Since the proof of context equivalence is quite challenging, we investigate some effective methods for proving the program equivalence. Probabilistic applicative bisimilarity has proved to be a suitable tool for proving the context equivalence in probabilistic setting. We prove that the probabilistic applicative bisimilarity is fully abstract with respect to the context equivalence in the probabilistic lambda calculus with let-in operator. Next, we introduce Kripke-style semantics for the full simply typed combinatory logic, that is, the simply typed combinatory logic extended with product types, sum types, empty type and unit type. The Kripke-style semantics is defined as a Kripke applicative structure, which is extensional and has special elements corresponding to basic combinators, provided with the valuation of term variables. We prove that the full simply typed combinatory logic is sound and complete with respect to the proposed semantics. We introduce the logic of combinatory logic, that is, a propositional extension of the simply typed combinatory logic. We prove that the axiomatization of the logic of combinatory logic is sound and strongly complete with respect to the proposed semantics. In addition, we prove that the proposed semantics is the new semantics for the simply typed combinatory logic containing the typing rule that ensures that equal terms inhabit the same type. Finally, we introduce the probabilistic extension of the logic of combinatory logic. We extend the logic of combinatory logic with probability operators and obtain a framework for probabilistic reasoning about typed combinatory terms. We prove that the given axiomatization of the logic is sound and strongly complete with respect to the proposed semantics.Теза истражује два различита приступа за вероватносно закључивање у моделима израчунавања. Најчешћи приступ се састоји у проширењу ламбда рачуна вероватносним оператором избора што резултира вероватносним израчунавањем. То се показало веома корисним и примењивим у разним областима, на пример у роботици, обради природног језика и машинском учењу. Други приступ јесте да проширимо језик рачуна вероватносним операторима и добијемо модел за вероватносно закључивање о типизираном рачуну у стилу вероватносне логике. Најпре проучавамо вероватносни ламбда рачун проширен лет-ин оператором где је примењена лења позив-по-имену стратегија евалуације, и изучавамо проблем еквиваленције програма у овом окружењу. Како је проблем доказивања контекстне еквиваленције доста изазован, истраживали смо ефикасне методе за доказивање еквиваленције програма. Вероватносна апликативна бисимулација се показала као одговарајући алат за доказивање еквиваленције програма у вероватносном окружењу. Доказујемо да је вероватносна апликативна бисимулација потпуно апстрактна у односу на контекстну еквиваленцију у вероватносном ламбда рачуну са лет-ин оператором. Затим уводимо Крипкеову семантику за целу комбинаторну логику са функционалним типовима, односно комбинаторну логику са функционалним типовима проширену типовима производа, типовима суме, празним типом и јединичним типом. Крипкеову семантику дефинишемо као Крипкеову апликативну структуру, која је екстензионална и има елементе који одговарају основним комбинаторима, и којој је придружена валуација променљивих. Доказујемо да је цела комбинаторна логика са функционалним типовима сагласна и потпуна у односу на уведене семантике. Уводимо логику комбинаторне логике, то јест исказно проширење комбинаторне логике са функционалним типовима. Доказујемо да је аксиоматизација логике комбинаторне логике сагласна и потпуна у односу на предложену семантику. Даље, показујемо да је уведена семантика нова семантика за комбинаторну логику са функционалним типовима проширену правилом типизирања које осигурава да једнаки терми имају исти тип. На крају, уводимо вероватносно проширење логике комбинаторне логике. Логику комбинаторне логике смо проширили са вероватносним операторима и добили модел за вероватносно закључивање о типизираним комбинаторним термима. Показујемо да је аксиоматизација логике сагласна и јако потпуна у односу на предложену семантику.Teza istražuje dva različita pristupa za verovatnosno zaključivanje u modelima izračunavanja. Najčešći pristup se sastoji u proširenju lambda računa verovatnosnim operatorom izbora što rezultira verovatnosnim izračunavanjem. To se pokazalo veoma korisnim i primenjivim u raznim oblastima, na primer u robotici, obradi prirodnog jezika i mašinskom učenju. Drugi pristup jeste da proširimo jezik računa verovatnosnim operatorima i dobijemo model za verovatnosno zaključivanje o tipiziranom računu u stilu verovatnosne logike. Najpre proučavamo verovatnosni lambda račun proširen let-in operatorom gde je primenjena lenja poziv-po-imenu strategija evaluacije, i izučavamo problem ekvivalencije programa u ovom okruženju. Kako je problem dokazivanja kontekstne ekvivalencije dosta izazovan, istraživali smo efikasne metode za dokazivanje ekvivalencije programa. Verovatnosna aplikativna bisimulacija se pokazala kao odgovarajući alat za dokazivanje ekvivalencije programa u verovatnosnom okruženju. Dokazujemo da je verovatnosna aplikativna bisimulacija potpuno apstraktna u odnosu na kontekstnu ekvivalenciju u verovatnosnom lambda računu sa let-in operatorom. Zatim uvodimo Kripkeovu semantiku za celu kombinatornu logiku sa funkcionalnim tipovima, odnosno kombinatornu logiku sa funkcionalnim tipovima proširenu tipovima proizvoda, tipovima sume, praznim tipom i jediničnim tipom. Kripkeovu semantiku definišemo kao Kripkeovu aplikativnu strukturu, koja je ekstenzionalna i ima elemente koji odgovaraju osnovnim kombinatorima, i kojoj je pridružena valuacija promenljivih. Dokazujemo da je cela kombinatorna logika sa funkcionalnim tipovima saglasna i potpuna u odnosu na uvedene semantike. Uvodimo logiku kombinatorne logike, to jest iskazno proširenje kombinatorne logike sa funkcionalnim tipovima. Dokazujemo da je aksiomatizacija logike kombinatorne logike saglasna i potpuna u odnosu na predloženu semantiku. Dalje, pokazujemo da je uvedena semantika nova semantika za kombinatornu logiku sa funkcionalnim tipovima proširenu pravilom tipiziranja koje osigurava da jednaki termi imaju isti tip. Na kraju, uvodimo verovatnosno proširenje logike kombinatorne logike. Logiku kombinatorne logike smo proširili sa verovatnosnim operatorima i dobili model za verovatnosno zaključivanje o tipiziranim kombinatornim termima. Pokazujemo da je aksiomatizacija logike saglasna i jako potpuna u odnosu na predloženu semantiku

Computational Complexity of Strong Admissibility for Abstract Dialectical Frameworks

Abstract dialectical frameworks (ADFs) have been introduced as a formalism for modeling and evaluating argumentation allowing general logical satisfaction conditions. Different criteria used to settle the acceptance of arguments arecalled semantics. Semantics of ADFs have so far mainly been defined based on the concept of admissibility. Recently, the notion of strong admissibility has been introduced for ADFs. In the current work we study the computational complexityof the following reasoning tasks under strong admissibility semantics. We address 1. the credulous/skeptical decision problem; 2. the verification problem; 3. the strong justification problem; and 4. the problem of finding a smallest witness of strong justification of a queried argument