Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
An abductive framework for generalized logic programs
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
Artificial Intelligence
Proceedings of the eleventh international conference on Logic programming
Introduction to algorithms
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates
Proceedings of the 17th International Conference on Logic Programming
Partial Evaluation and Relevance for Approximations of Stable Semantics
ISMIS '94 Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems
Transformation-Based Bottom-Up Computation of the Well-Founded Model
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
The Stable Semantics and its Variants: A Comparison of Recent Approaches
KI '94 Proceedings of the 18th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Defining new argumentation-based semantics by minimal models
ENC '06 Proceedings of the Seventh Mexican International Conference on Computer Science
Argumentation in artificial intelligence
Artificial Intelligence
Computing ideal sceptical argumentation
Artificial Intelligence
On principle-based evaluation of extension-based argumentation semantics
Artificial Intelligence
Preferred extensions as stable models*
Theory and Practice of Logic Programming
ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Computing Argumentation Semantics in Answer Set Programming
New Frontiers in Artificial Intelligence
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
On the Existence of Answer Sets in Normal Extended Logic Programs
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Expressing Extension-Based Semantics Based on Stratified Minimal Models
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
SCC-recursiveness: a general schema for argumentation semantics
Artificial Intelligence
Symmetric splitting in the general theory of stable models
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Approved models for normal logic programs
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Revised stable models – a semantics for logic programs
EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
A Classification Theory Of Semantics Of Normal Logic Programs: I. Strong Properties
Fundamenta Informaticae
A Classification Theory Of Semantics Of Normal Logic Programs: Ii. Weak Properties
Fundamenta Informaticae
CF2-extensions as Answer-set Models
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
WizArg: Visual Argumentation Framework Solving Wizard
Proceedings of the 2010 conference on Artificial Intelligence Research and Development: Proceedings of the 13th International Conference of the Catalan Association for Artificial Intelligence
Characterization of argumentation semantics in terms of the MMr semantics
MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
A Possibilistic Argumentation Decision Making Framework with Default Reasoning
Fundamenta Informaticae - Latin American Workshop on Logic Languages, Algorithms and New Methods of Reasoning (LANMR)
Approximating operators and semantics for abstract dialectical frameworks
Artificial Intelligence
| Hi-index | 0.00 |
In the literature, there are several approaches which try to perform common sense reasoning. Among them, the approaches which have probably received the most attention the last two decades are the approaches based on logic programming semantics with negation as failure and argumentation theory. Even though both approaches have their own features, it seems that they share some common behaviours which can be studied by considering the close relationship between logic programming semantics and extension-based argumentation semantics. In this paper, we will present a general recursive schema for defining new logic programming semantics. This schema takes as input any basic logic programming semantics, such as the stable model semantics, and gives as output a new logic programming semantics which satisfies some desired properties such as relevance and the existence of the intended models for every normal program. We will see that these new logic programming semantics can define candidate extension-based argumentation semantics. These new argumentation semantics will overcome some of the weakness of the extension-based argumentation semantics based on admissible sets. In fact, we will see that some of these new argumentation semantics have similar behaviour to the extension-based argumentation semantics built in terms of strongly connected components.