| 1. |
- Bialek, Lukasz, et al.
(författare)
-
Belief Shadowing
- 2019
-
Ingår i: Engineering Multi-Agent Systems. EMAS 2018. - Cham : Springer. ; , s. 158-180
-
Konferensbidrag (refereegranskat)
|
|
| 2. |
- Bialek, Lukasz, et al.
(författare)
-
Towards a Paraconsistent Approach to Actions in Distributed Information-Rich Environments
- 2018
-
Ingår i: Intelligent Distributed Computing XI. - Cham : Springer. - 9783319663784 - 9783319663791 ; , s. 49-60
-
Konferensbidrag (refereegranskat)abstract
- The paper introduces ActLog, a rule-based language capable of specifying actions paraconsistently. ActLog is an extension of 4QL Bel " role="presentation"> Bel , a rule-based language for reasoning with paraconsistent and paracomplete belief bases and belief structures. Actions considered in the paper act on belief bases rather than states represented as sets of ground literals. Each belief base stores multiple world representations which can be though of as a representation of possible states. In this context ActLog’s action may be then seen as a method of transforming one belief base into another. In contrast to other approaches, ActLog permits to execute actions even if the underlying belief base state is partial or inconsistent. Finally, the framework introduced in this paper is tractable.
|
|
| 3. |
- De Angelis, Francesco Luca, et al.
(författare)
-
Paraconsistent Rule-Based Reasoning with Graded Truth Values
- 2018
-
Ingår i: Journal of Applied Logics - IfCoLog Journal. - : College Publications. - 2631-9810 .- 2631-9829. ; 5:1, s. 185-220
-
Tidskriftsartikel (refereegranskat)abstract
- Modern artificial systems, such as cooperative traffic systems or swarm robotics, are made of multiple autonomous agents, each handling uncertain, partial and potentially inconsistent information, used in their reasoning and decision making. Graded reasoning, being a suitable tool for addressing phenomena related to such circumstances, is investigated in the literature in many contexts – from graded modal logics to various forms of approximate reasoning. In this paper we first introduce a family of many-valued paraconsistent logics parametrised by a number of truth/falsity/inconsistency grades allowing one to handle multiple truth-values at the desired level of accuracy. Second, we define a corresponding family of rule-based languages with graded truth-values as first-class citizens, enjoying tractable query evaluation. In addition, we introduce introspection operators allowing one to resolve inconsistencies and/or lack of information in a non-monotonic manner. We illustrate and discuss the use of the framework in an autonomous robot scenario.
|
|
| 4. |
- Doherty, Patrick, 1957-, et al.
(författare)
-
Signed Dual Tableaux for Kleene Answer Set Programs
- 2018
-
Ingår i: Ewa Orłowska on Relational Methods in Logic and Computer Science. - Cham : Springer. - 9783319978789 - 9783319978796 ; , s. 233-252
-
Bokkapitel (refereegranskat)abstract
- Dual tableaux were introduced by Rasiowa and Sikorski (1960) as a cut free deduction system for classical first-order logic. In the current paper, a sound and complete proof procedure based on dual tableaux is proposed for R3 which is the standard Kleene logic augmented with a weak negation connective and an implication connective proposed, in another context, by Shepherdson (1989). R3is used as a basis for defining Kleene Answer Set Programs (ASPKprograms). The semantics forASPKprograms is based on strongly supported models. Both entailment procedures and model generation procedures for normal and non-normalASPKprograms are proposed based on the use of dual tableaux and a model filtering technique. The dual tableau proof procedure extended with a model filtering technique is shown to be sound and complete forASPKprograms, both normal and non-normal. Since there is a direct relationship between answer sets for classical ASP programs andR3models forASPKprograms, it can be shown that the sound and complete dual tableaux proof procedure with filtering for ASPK" role="presentation">ASPKprograms is also sound and complete for classical normal ASP programs. For classical non-normal ASP programs, the proof procedure is only sound, since an alternative semantics for disjunction is used inASPK
|
|
| 5. |
- Doherty, Patrick, et al.
(författare)
-
Stability, Supportedness, Minimality and Kleene Answer Set Programs
- 2015
-
Ingår i: Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation. - Cham : Springer. - 9783319147253 - 9783319147260 ; , s. 125-140
-
Bokkapitel (refereegranskat)abstract
- Answer Set Programming is a widely known knowledge representation framework based on the logic programming paradigm that has been extensively studied in the past decades. The semantic framework for Answer Set Programs is based on the use of stable model semantics. There are two characteristics intrinsically associated with the construction of stable models for answer set programs. Any member of an answer set is supported through facts and chains of rules and those members are in the answer set only if generated minimally in such a manner. These two characteristics, supportedness and minimality, provide the essence of stable models. Additionally, answer sets are implicitly partial and that partiality provides epistemic overtones to the interpretation of disjunctiver ules and default negation. This paper is intended to shed light on these characteristics by defining a semantic framework for answer set programming based on an extended first-order Kleene logic with weak and strong negation. Additionally, a definition of strongly supported models is introduced, separate from the minimality assumption explicit in stable models. This is used to both clarify and generate alternative semantic interpretations for answer set programs with disjunctive rules in addition to answer set programs with constraint rules. An algorithm is provided for computing supported models and comparative complexity results between strongly supported and stable model generation are provided.
|
|
| 6. |
- Dunin-Keplicz, Barbara, et al.
(författare)
-
A New Perspective on Goals
- 2015
-
Ingår i: The Facts Matter: Essays on Logic and Cognition in Honour of Rineke Verbrugge. - London : College Publications. - 9781848901735 ; , s. 50-66
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
- This book is in celebration of Rineke Verbrugge's 50th birthday. It is a product of an incredible effort on the part of Rineke's teachers, colleagues, students and friends who have all been won over by her ever-encouraging and positive presence in academia and also in daily life. Pertaining to Rineke's research interests, the book features eight articles on a wide range of topics - from theories of arithmetic to a study on autism. The papers on hybrid logic, formal theories of belief, probability, goals, social networks, and bisimulations enrich the logic section of the book while papers on cognitive strategizing and social cognition bring up the cognitive perspective. The themes themselves provide a compelling perception of the vast expanse of Rineke's academic interests and endeavours. A series of personal comments, stories, anecdotes, and pictures constitute the latter part of the book, adding a distinct personal touch to this volume.
|
|
| 7. |
- Dunin-Keplicz, Barbara, et al.
(författare)
-
Doxastic Group Reasoning via Multiple Belief Shadowing
- 2019
-
Ingår i: PRIMA 2019: Principles and Practice of Multi-Agent Systems. - Cham : Springer. - 9783030337926 - 9783030337919 ; , s. 271-288
-
Konferensbidrag (refereegranskat)
|
|
| 8. |
- Dunin-Kęplicz, Barbara, et al.
(författare)
-
Variations on Jaśkowski’s Discursive Logic
- 2018
-
Ingår i: The Lvov-Warsaw School. Past and Present. - Cham : Birkhäuser. - 9783319654294 - 9783319654300 ; , s. 485-497
-
Bokkapitel (refereegranskat)abstract
- Stanisław Jaśkowski, in his 1948–1949 papers on propositional calculus for contradictory deductive systems, proposed discursive logic D2. The main motivation behind D2 is the need to properly deal with contradictions that naturally appear in many areas of philosophy and discourse. The intuitive justification of this logic reflects knowledge fusion occurring when “the theses advanced by several participants in a discourse are combined into a single system.” This point of view was seminal in the mid twentieth century and remains visionary nowadays.In contemporary autonomous systems operating in dynamic, unpredictable information-rich environments, distributed reasoning routinely takes place. This explains the key role of knowledge fusion, among others, in Distributed Artificial Intelligence. Therefore, different types of modern knowledge and belief bases become primarily concerned with inconsistent or lacking information. This requirement leads to recent approaches to paraconsistent and paracomplete reasoning, where nonmonotonic techniques for disambiguating inconsistencies and completing missing knowledge can be applied.In this chapter we remind Jaśkowski’s seminal, pioneering work on paraconsistent reasoning and indicate some of its relations to contemporary research on reasoning in Distributed AI.
|
|
| 9. |
|
|
