Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
Due to its efficiency, defeasible logic is one of the most interesting non-monotonic formalisms. Unfortunately, the logic has one major limitation: it does not properly deal with cyclic defeasible rules. In this paper, we provide a new variant of defeasible logic, using CAKE method. The resulting formalism is tractable and properly deals with circular defeasible rules.
Słowa kluczowe
Wydawca
Czasopismo
Rocznik
Tom
Strony
193--213
Opis fizyczny
Bibliogr. 13 poz.
Twórcy
autor
- Institute of Informatics, Warsaw University, ul. Banacha 2, 02-097 Warsaw, Poland
autor
- Dept. of Computer Science, Linköping University
- College of Economics and Computer Science TWP, Olsztyn, Poland
Bibliografia
- [1] S. Abiteboul, R. Hull and V. Vianu. Foundations of Databases. Addison-Wesley, 1996.
- [2] G. Antoniou, D. Billington, G. Governatori and M. Maher. Representation Results for Defeasible Logic. ACM Transactions on Computational Logic, 2, 255-287, 2001.
- [3] K. R. Apt, H. A. Blair, A. Walker. Towards a Theory of Declarative Knowledge. Foundations of Deductive Databases and Logic Programming, J. Minker (ed.), Morgan Kaufmann Publishers, Palo Alto, CA, 89-148, 1988.
- [4] D. Billington. Defeasible Logic is Stable. Journal of Logic and Computation, 3, 370-400, 1993.
- [5] A. K. Chandra, D. Harel. Horn Clause Queries and Generalizations. Journal of Logic Programming, 2(1), 1-15, 1985.
- [6] P. Doherty, W. Łukaszewicz and A. Szalas. CAKE: A Computer Aided Knowledge Engineering Technique. Proceedings of the 15th European Conference on Artificial Intelligence, IOS Press, July, Amsterdam, 2002.
- [7] P. Doherty, P, W. Łukaszewicz, A. Skowron and A. Szalas. Knowledge Engineering: A Rough Set Approach. Physica Verlag, 2003, to appear.
- [8] V. Lifschitz. On the Declarative Semantics of Logic Programs with Negation. Foundations of Deductive Databases and Logic Programming, J. Minker (ed.), Morgan Kaufmann Publishers, Palo Alto, CA, 177-192, 1988.
- [9] M. Maher. Propositional Defeasible Logic has Linear Complexity. Theory and Practice of Logic Programming, 1 (6) 691-711, 2001.
- [10] D. Nute. Defeasible Reasoning and Decision Support Systems. decision Support Systems, 4, 97-110, 1998.
- [11] 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.
- [12] T. Przymusiński. Well-founded Semantics Coincides with Three-valued Stable Semantics. Fundamenta Informaticae, IOS Press, XIII, 1990, 445-463.
- [13] A. Van Gelder. Negation as Failure Using Tight Derivations for General Logic Programs. IEEE Symposium on Logic Programming, 127-139, 1986.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS2-0004-0149