An argument-based approach to reasoning with specificity

Artificial Intelligence

Volumn 133, Issue 1-2, 2001, Pages 35-85

  Dung, Phan Minh ^a   Son, Tran Cao ^b  

^a ASIAN INSTITUTE OF TECHNOLOGY   (Thailand)

^b New Mexico State University   (United States)

Author keywords

Argumentation; Default reasoning; Reasoning with specificity; Specificity

Indexed keywords

MATHEMATICAL TRANSFORMATIONS; POLYNOMIALS; SEMANTICS;

DEFAULT REASONING;

ARTIFICIAL INTELLIGENCE;

EID: 0035575516     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(01)00134-5     Document Type: Article

References (53)

1. Reasoning with logic programming
2. How to prefer more specific defaults in terminological default logic
3. An abstract, argumentation-theoretic approach to default reasoning
4. Cumulative default logic: In defense of nonmonotonic inference rules
5. Adding priorities and specificity to default logic
6. Reasoning about priorities in default logic
7. Preferred answer sets for extended logic programs
8. Compiling specificity into approaches to nonmonotonic reasoning
9. A general approach to specificity in default reasoning
10. Preferred arguments are harder to compute than stable extensions
11. Finding admissible and preferred arguments can be very hard
12. Negation as hypothesis: An abductive foundation for logic programming
13. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
14. Nonmonotonic inheritance, argumentation, and logic programming
15. An argumentation-theoretic approach to default reasoning with specificity
16. Default reasoning with specificity
17. A nonmonotonic reasoning formalism using implicit specificity information
18. Conditional entailment: Bridging two approaches to default reasoning
19. Prioritized default theory
20. Qualitative probabilities for default reasoning, belief revision, and causal modeling
21. Some direct theories of non-monotonic inheritance
22. The role of abduction in logic programming
23. Computing argumentation in logic programming
24. A skeptical theory of inheritance in nonmonotonic semantic networks
25. Hierarchic autoepistemic theories for nonmonotonic reasoning
26. Nonmonotonic reasoning, preferential models and cumulative logics
27. Computing circumscription
28. Floating conclusion and zombie paths: Two deep difficulties in the 'directly skeptical' approach to defeasible inheritance nets
29. Circumscription - A form of nonmonotonic reasoning
30. Applications of circumscription to formalizing common sense knowledge
31. Nonmonotonic logic I
32. Preference by specificity in default logic
33. Semantical considerations on nonmonotonic logic
34. Towards efficient default reasoning
35. System Z: A natural ordering of defaults with tractable applications to nonmonotonic reasoning
36. Defeasible reasoning
37. On the comparison of theories: Preferring the most specific explanation
38. Logics for defeasible argumentation
39. A logic for default reasoning
40. On interacting defaults
41. Nonmonotonic inference rules for multiple inheritance with exceptions
42. The complexity of path-based defeasible inheritance
43. A mathematical treatment of defeasible reasoning and its implementation
44. On Sandewall's paper: Nonmonotonic inference rules for multiple inheritance with exceptions
45. On Stein's paper: Resolving ambiguity in nonmonotonic inheritance hierarchies
46. Resolving ambiguity in nonmonotonic inheritance hierarchies
47. A nonmonotonic disputation-based semantics and proof procedure for logic programs
48. The feasibility of defeat in defeasible reasoning
49. Compiling defeasible inheritance networks to general logic programs