scholarly journals If Nothing Is Accepted -- Repairing Argumentation Frameworks

2019 ◽  
Vol 66 ◽  
pp. 1099-1145
Author(s):  
Markus Ulbricht ◽  
Ringo Baumann

Conflicting information in an agent's knowledge base may lead to a semantical defect, that is, a situation where it is impossible to draw any plausible conclusion. Finding out the reasons for the observed inconsistency (so-called diagnoses) and/or restoring consistency in a certain minimal way (so-called repairs) are frequently occurring issues in knowledge representation and reasoning. In this article we provide a series of first results for these problems in the context of abstract argumentation theory regarding the two most important reasoning modes, namely credulous as well as sceptical acceptance. Our analysis includes the following problems regarding minimal repairs/diagnoses: existence, verification, computation of one and enumeration of all solutions. The latter problem is tackled with a version of the so-called hitting set duality first introduced by Raymond Reiter in 1987. It turns out that grounded semantics plays an outstanding role not only in terms of complexity, but also as a useful tool to reduce the search space for diagnoses regarding other semantics.

1999 ◽  
Vol 10 ◽  
pp. 399-434 ◽  
Author(s):  
A. Borgida

This paper offers an approach to extensible knowledge representation and reasoning for a family of formalisms known as Description Logics. The approach is based on the notion of adding new concept constructors, and includes a heuristic methodology for specifying the desired extensions, as well as a modularized software architecture that supports implementing extensions. The architecture detailed here falls in the normalize-compared paradigm, and supports both intentional reasoning (subsumption) involving concepts, and extensional reasoning involving individuals after incremental updates to the knowledge base. The resulting approach can be used to extend the reasoner with specialized notions that are motivated by specific problems or application areas, such as reasoning about dates, plans, etc. In addition, it provides an opportunity to implement constructors that are not currently yet sufficiently well understood theoretically, but are needed in practice. Also, for constructors that are provably hard to reason with (e.g., ones whose presence would lead to undecidability), it allows the implementation of incomplete reasoners where the incompleteness is tailored to be acceptable for the application at hand.


Author(s):  
Ringo Baumann ◽  
Markus Ulbricht

Abstract argumentation as defined by Dung in his seminal 1995 paper is by now a major research area in knowledge representation and reasoning. Dynamics of abstract argumentation frameworks (AFs) as well as syntactical consequences of semantical facts of them are the central issues of this paper. The first main part is engaged with the systematical study of the influence of attackers and supporters regarding the acceptability status of whole sets and/or single arguments. In particular, we investigate the impact of addition or removal of arguments, a line of research that has been around for more than a decade. Apart from entirely new results, we revisit, generalize and sum up similar results from the literature. To gain a comprehensive formal and intuitive understanding of the behavior of AFs we put special effort in comparing different kind of semantics. We concentrate on classical admissibility-based semantics and also give pointers to semantics based on naivity and weak admissibility, a recently introduced mediating approach. In the second main part we show how to infer syntactical information from semantical one. For instance, it is well-known that if a finite AF possesses no stable extension, then it has to contain an odd-cycle. In this paper, we even present a characterization of this issue. Moreover, we show that the change of the number of extensions if adding or removing an argument allows to conclude the existence of certain even or odd cycles in the considered AF without having further information.


Author(s):  
Abbas Z. Kouzani ◽  
◽  
Fangpo He ◽  
Karl Sammut

This paper highlights the theory of common-sense knowledge in terms of representation and reasoning. A connectionist model is proposed for common-sense knowledge representation and reasoning. A generic fuzzy neuron is used as a basic element for the connectionist model. The representation and reasoning ability of the model are described through examples. A common-sense knowledge base is employed to develop a human face detection system. The system consists of three stages: preprocessing, face-components extraction, and final decision making. A neural-network-based algorithm is utilised to extract face components. Five networks are trained to detect the mouth, nose, eyes, and full face. The detected face components and their corresponding possibility degrees enable the knowledge base to locate faces in the image and to generate a membership degree for the detected faces within the face class. The experimental results obtained using this method are presented.


AI Magazine ◽  
2010 ◽  
Vol 31 (3) ◽  
pp. 33 ◽  
Author(s):  
David Gunning ◽  
Vinay K. Chaudhri ◽  
Peter E. Clark ◽  
Ken Barker ◽  
Shaw-Yi Chaw ◽  
...  

In the winter, 2004 issue of AI Magazine, we reported Vulcan Inc.'s first step toward creating a question-answering system called "Digital Aristotle." The goal of that first step was to assess the state of the art in applied Knowledge Representation and Reasoning (KRR) by asking AI experts to represent 70 pages from the advanced placement (AP) chemistry syllabus and to deliver knowledge-based systems capable of answering questions from that syllabus. This paper reports the next step toward realizing a Digital Aristotle: we present the design and evaluation results for a system called AURA, which enables domain experts in physics, chemistry, and biology to author a knowledge base and that then allows a different set of users to ask novel questions against that knowledge base. These results represent a substantial advance over what we reported in 2004, both in the breadth of covered subjects and in the provision of sophisticated technologies in knowledge representation and reasoning, natural language processing, and question answering to domain experts and novice users.


2010 ◽  
Vol 1 (4) ◽  
pp. 10-28 ◽  
Author(s):  
Sarika Jain ◽  
N.K. Jain

EHCPRs system is a knowledge representation and reasoning system for representing common sense knowledge and reasoning with it. In such a system an EHCPR is used as a unit of knowledge for representing any universal concept. There are a number of EHCPRs at various levels of hierarchy of knowledge structure in the EHCPRs system, which results in a tree of EHCPRs. This EHCPRs tree has the capability of continuous growth through new added EHCPRs to it at proper place as well as to get refined continuously with time through improvement in the already acquired EHCPRs. The EHCPRs tree will become stronger in terms of strength of implication and richer in knowledge as time passes. This paper discusses different schemes for enhancing the intelligence, i.e., the knowledge base and the database in the EHCPRs system. By simple and general snippets of code, the EHCPRs system is able to acquire new pieces of knowledge and assimilate it properly in the already acquired knowledge base. The EHCPRs system dynamically restructures the EHCPRs tree in each learning phase by maintaining consistency and minimizing redundancy as well.


2014 ◽  
Author(s):  
David Braines ◽  
Geeth de Mel ◽  
Chris Gwilliams ◽  
Christos Parizas ◽  
Diego Pizzocaro ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document