Defeasible argumentation over relational databases
نویسندگان
چکیده
منابع مشابه
Defeasible argumentation over relational databases
Defeasible argumentation has been applied successfully in several real-world domains in which it is necessary to handle incomplete and contradictory information. In recent years, there have been interesting attempts to carry out argumentation processes supported by massive repositories developing argumentative reasoning applications. One of such efforts builds arguments by retrieving informatio...
متن کاملLogics for Defeasible Argumentation
4 General features of argument-based semantics 15 4.1 The `unique status assignment' approach . . . . . . . . . . . . . . 17 4.1.1 Fixed-point de nitions . . . . . . . . . . . . . . . . . . . . 17 4.1.2 Recursive de nitions . . . . . . . . . . . . . . . . . . . . . 21 4.2 The `multiple status assignment' approach . . . . . . . . . . . . . 25 4.3 Comparing the two approaches . . . . . . . . . . ...
متن کاملOBDA Over Non-Relational Databases
The database landscape has been significantly diversified during the last decade, resulting in the emergence of a variety of non-relational (also called NoSQL) databases, e.g., XML and JSON-document databases, key-value stores, and graph databases. To facilitate access to such databases and to enable data integration of non-relational data sources, we generalize the well-known ontologybased dat...
متن کاملLocal Search over Relational Databases
Solving combinatorial problems is increasingly crucial in business applications, in order to cope with hard problems of practical relevance. However, the approach of exploiting, in production scenarios, current constraint or mathematical programming solvers has severe limitations, which demand new methods: data is usually stored in potentially large relational databases, and maintaining the pro...
متن کاملArgumentation Semantics for Defeasible Logics
Defeasible logic is a simple but efficient rule-based non-monotonic logic. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the modelling of business rules. So far defeasible logic has been defined only proof-theoretically. Argumentation-based semantics have become popular in the area of logic programming. In this paper we give an argumentation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Argument & Computation
سال: 2017
ISSN: 1946-2174,1946-2166
DOI: 10.3233/aac-170017