Nonmonotonic reasoning as prioritized argumentation

IEEE Transactions on Knowledge and Data Engineering

Volumn 13, Issue 6, 2001, Pages 968-979

  You, Jia Huai ^a   Wang, Xianchang ^b   Yuan, Li Yan ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

^b MessagingDirect Ltd   (Canada)

Author keywords

Argumentation; Default logic; Nonmonotonic reasoning; Priority; Representability

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; INFERENCE ENGINES; KNOWLEDGE REPRESENTATION;

NONMONOTONIC REASONING;

LOGIC PROGRAMMING;

EID: 0035517623     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/69.971190     Document Type: Article

References (55)

1. Constraint optimization using preference logics: A new role for modal logic
2. Priorities on default with prerequisite and their application in treating specificity in terminological default logic
3. Stable and extension class theory for logic programs and default logic
4. An abstract, argumentation-theoretic approach to default reasoning
5. Adding priorities and specificity to default logic
6. Well-founded semantics for extended logic programming with dynamic preference
7. Normal logic programs as open positive programs
8. Stable models and their computation for logic programming with inheritance and true negation
9. Negation as failure
10. Compiling reasoning with and about preferences into default logic
11. Alternative approach to default logic
12. Logic programming without negation as failure
13. An argumentation theoretic foundation for logic programming
14. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming, and N-person games
15. Non-monotonic inheritance, argumentation, and logic programming
16. Abduction compared with negation by failure
17. On inheritance hierarchies with exceptions
18. The stable model semantics for logic programming
19. The power of beliefs or translating default into standard autoepistemic logic
20. Preference logic programming
21. Results on translating defaults to circumscription
22. Hypothetical reasoning in logic programs
23. Managing conflicts between rules
24. On the intertranslatability of non-monotonic logics
25. The role of abduction in logic programming
26. The acceptability semantics for logic programs
27. Abstract argumentation
28. On open defaults
29. Argument systems: A uniform basis for non-monotonic reasoning
30. Relating autoepistemic and default logic
31. Semantical consideration on nonmonotonic logic
32. System Z: A natural ordering of default with tractable applications to nonmonotonic reasoning
33. Defeasible reasoning
34. Theorist: A logical reasoning system for defaults and diagnosis
35. A logical framework for modeling legal argument
36. A dialectical model of assessing conflicting arguments in legal reasoning
37. On closed world data bases
38. A logic for default reasoning
39. On interacting defaults
40. Representing priorities in logic programs
41. A simple computational model for nonmonotonic and adversarial legal reasoning
42. A lattice-theoretical fixpoint theorem and its applications
43. Computing the acceptability semantics
44. The alternating fixpoint of logic programs with negation
45. The well-founded semantics for general logic programs
46. Circumscription by inference rules with priority
47. Logic programming without default negation revisited
48. Nonmonotonic reasoning by monotonic inferences with priority constraint
49. Compiling defeasible inheritance networks to general logic programs
50. Disjunctive logic programming as constrained inferences
51. On the equivalence of semantics for normal logic programs