Efficient defeasible reasoning systems

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn , Issue , 2000, Pages 384-392

  Maher, M J ^a   Rock, A ^a   Antoniou, G ^a   Billington, D ^a   Miller, T ^a  

^a GRIFFITH UNIVERSITY   (Australia)

Author keywords

Australia; Computational complexity; Electronic commerce; Information technology; Logic programming; NP hard problem; Query processing

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; ELECTRONIC COMMERCE; INFORMATION TECHNOLOGY; LOGIC PROGRAMMING; MODELING LANGUAGES; QUERY PROCESSING;

AUSTRALIA; BACKWARD CHAINING; DEFEASIBLE REASONING; EXPERIMENTAL EVALUATION; LINEAR COMPLEXITY; NON-MONOTONIC REASONING; NONMONOTONIC LOGIC; QUERY ANSWERING SYSTEMS;

FORMAL LOGIC;

EID: 2342524479     PISSN: 10823409     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAI.2000.889898     Document Type: Article

References (32)

1. G. Antoniou. Nonmonotonic Reasoning. MIT Press 1997.
2. G. Antoniou, D. Billington, G. Governatori and M.J. Maher. Representation Results for Defeasible Logic. manuscript, 1999.
3. G. Antoniou, D. Billington, and M.J. Maher. Normal forms for defeasible logic. In Proc. 1998 Joint International Conference and Symposium on Logic Programming, MIT Press 1998, 160-174.
4. G. Antoniou, D. Billington and M.J. Maher. On the analysis of regulations using defeasible rules. In Proc. 32nd Hawaii International Conference on Systems Science 1999.
5. G. Antoniou. On the Role of Rule-Based Nonmonotonic Systems in Electronic Commerce - A Position Statement. In Proc. 1st Australasian Workshop on AI and Electronic Commerce, Sydney, 1999.
6. G. Antoniou, M.J. Maher and D. Billington. Defeasible Logic versus Logic Programming without Negation as Failure. Journal of Logic Programming 42(1): 47-57, 2000.
7. D. Billington, K. de Coster and D. Nute. A modular translation from defeasible nets to defeasible logic. Journal of Experimental and Theoretical Artificial Intelligence 2 (1990): 151-177.
8. D. Billington. Defeasible Logic is Stable. Journal of Logic and Computation 3 (1993): 370-400.
9. P. Cholewinski, V. Marek, A. Mikitiuk and M. Truszczynski. Experimenting with Nonmonotonic Reasoning. In Proc. International Conference on Logic Programming, MIT Press, 1995, 267-281.
10. M.A. Covington, D. Nute and A. Vellino. Prolog Programming in Depth. Prentice Hall 1997.
11. Y. Dimopoulos and A. Kakas. Logic Programming without Negation as Failure. In Proc. 5th International Symposium on Logic Programming, MIT Press 1995, 369-384.
12. W.F. Dowling and J.H. Gallier. Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae. Journal of Logic Programming 1(3): 267-284, 1984.
13. G. Gallo and G. Urbani. Algorithms for Testing the Satisfiability of Propositional Formulae. Journal of Logic Programming 7(1): 45-61, 1989.
14. M. Gelfond and V. Lifschitz. Representing action and change by logic programs. Journal of Logic Programming 17 (1993): 301-322.
15. G. Gottlob. Complexity results for nonmonotonic logics. Journal of Logic and Computation 2, 1992, 397-425.
16. G. Governatori & M. Maher. An Argumentation-Theoretic Characterization of Defeasible Logic. In Proc. European Conf. on Artificial Intelligence, 2000.
17. B.N. Grosof. Prioritized Conflict Handling for Logic Programs. In Proc. Int. Logic Programming Symposium, J. Maluszynski (Ed.), 197-211, MIT Press 1997.
18. B.N. Grosof. DIPLOMAT: Business Rules Interlingua and Conflict Handling, for E-Commerce Agent Applications (Overview of System Demonstration). In Proc. IJCAI-99 Workshop on Agent-mediated Electronic Commerce (AMEC-99), July 1999.
19. J.F. Horty, R.H. Thomason and D. Touretzky. A skeptical theory of inheritance in nonmonotonic semantic networks. In Proc. AAAI-87, 358-363.
20. M.P. Jones et al. The Hugs98 User Manual. http://www.haskell.org/hugs/
21. H. Kautz and B. Selman. Hard problems for simple default logics. In Proc. 1st International Conference on Principles of Knowledge Representation and Reasoning, Morgan Kaufmann 1989, 189-1997.
22. H.J. Levesque, R. Reiter, Y. Lesperance, F. Lin, and R.B. Scherl. GOLOG: A logic programming language for dynamic domains. The Journal of Logic Programming 31 (1997): 59-84.
23. M. Maher, G. Antoniou and D. Billington. A Study of Provability in Defeasible Logic. In Proc. Australian Joint Conference on Artificial Intelligence, LNAI 1502, Springer, 1998, 215-226.
24. M. Maher and G. Governatori, A Semantic Decomposition of Defeasible Logics, Proc. American National Conference on Artificial Intelligence (AAAI-99), AAAI/MIT Press, 299-305.
25. V. Marek and M. Truszczynski. Nonmonotonic Logic, Springer 1993.
26. L. Morgenstern. Inheritance Comes of Age: Applying Nonmonotonic Techniques to Problems in Industry. Artificial Intelligence 103(1998) 1-34.
27. I. Niemelä and P. Simons. Smodels - an implementation of the stable model and well-founded semantics for normal logic programs. In Proc. 4th International Conference on Logic Programming and Nonmonotonic Reasoning, LNAI 1265, Springer-Verlag, 420-429.
28. D. Nute. Defeasible Reasoning. In Proc. 20th Hawaii International Conference on Systems Science, IEEE Press 1987, 470-477.
29. D. Nute. Defeasible Logic. In D.M. Gabbay, C.J. Hogger and J.A. Robinson (eds.): Handbook of Logic in Artificial Intelligence and Logic Programming Vol. 3, Oxford University Press 1994, 353-395.
30. A. Rock and D. Billington. A propositional Plausible Logic implementation in Haskell. In Proc. Australasian Computer Science Conference, 2000, 204-210.
31. M. Shanahan. Solving the Frame Problem: A Mathematical Investigation of the Common Sense Law of Inertia. MIT Press 1997.
32. L.A. Stein. Resolving Ambiguity in Nonmonotonic Inheritance Hierarchies. Artificial Intelligence 55(1992): 259-310.