On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games

Artificial Intelligence

Volumn 77, Issue 2, 1995, Pages 321-357

  Dung, Phan Minh ^a  

^a ASIAN INSTITUTE OF TECHNOLOGY   (Thailand)

Author keywords

Argumentation; Logic programming; n person games; Nonmonotonic reasoning; The stable marriage problem

Indexed keywords

FORMAL LOGIC; GAME THEORY; HUMAN ENGINEERING; LEARNING SYSTEMS; LOGIC PROGRAMMING; PROBLEM SOLVING; PROGRAM COMPILERS; THEOREM PROVING;

ARGUMENTATION SYSTEMS; LOGICAL STRUCTURE; META-INTERPRETERS; N-PERSON GAMES; NONMONOTONIC REASONING;

ARTIFICIAL INTELLIGENCE;

EID: 0029368659     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(94)00041-X     Document Type: Article

References (68)

1. Towards a theory of declarative knowledge
2. Proceedings Third International Conference on Algebraic and Logic Programming
3. Argumentation: Approaches to Theory Formation
4. Towards an AI model of argumentation
5. Argument molecules: a functional representation of argument structure
6. An assumption-based framework to nonmonotonic reasoning, Invited Paper
7. Negation as failure
8. Analyzing the structure of argumentative discourse
9. Negations as hypotheses: an abductive foundation for logic programming
10. On the relations between stable and well-founded semantics of logic programs
11. Logic programming as dialogue games
12. An argumentational semantics to logic programming with explicit negation
13. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning and logic programming
14. Abduction compared with negation by failure
15. Reasoning with Incomplete Information: Investigation of Nonmonotonic Reasoning
16. M. Davis, Game Theory: A Nontechnical Introduction (Basic Books, New York).
17. A. Kripke-Kleene semantics for logic programs
18. Labelled deductive systems
19. Beyond negation as failure
20. The stable model semantics for logic programs
21. Representing actions in extended logic programming
22. What is wrong with nonmonotonic logic?
23. Stable theories for logic programs
24. Abductive logic programming
25. The acceptability semantics for logic programs
26. On the relation between default and autoepistemic logic
27. Logic-based open systems
28. The limitations of logic and its role in AI
29. Logic Programming in AI
30. Negation in logic programming
31. Signed data dependencies in logic programming
32. Argument systems: an uniform basis for nonmonotonic reasoning
33. A theory of nonmonotonic rule systems I
34. Circumscription—a form of non-monotonic reasoning
35. Opportunistic processing in arguments
36. Non-monotonic logic I
37. Semantical considerations on nonmonotonic logic
38. Nonmonotonic reasoning with well-founded semantics
39. On the consistency of commonsense reasoning
40. Defeasible reasoning
41. A theory of defeasible reasoning
42. Justification and defeat
43. On the comparison of theories: preferring the most specific explanation
44. A logical framework for default reasoning
45. The effect of knowledge on belief: conditioning, specificity and the lottery paradox in default reasoning
46. On the declarative semantics of deductive databases and logic programs
47. A logic for default reasoning
48. Game-theoretical semantics and logical form
49. Completed logic programs and their consistency
50. A mathematical treatment of defeasible reasoning and its implementation
51. Unfold/fold transformation of logic programs
52. Unfounded sets and well-founded semantics for general logic programs
53. The feasibility of defeat in defeasible reasoning