Abstract
W.C. Rounds and G.-Q. Zhang have proposed to study a form of disjunctive logic programming generalized to algebraic domains [1]. This system allows reasoning with information which is hierarchically structured and forms a (suitable) domain. We extend this framework to include reasoning with default negation, giving rise to a new nonmonotonic reasoning framework on hierarchical knowledge which encompasses answer set programming with extended disjunctive logic programs. We also show that the hierarchically structured knowledge on which programming in this paradigm can be done, arises very naturally from formal concept analysis. Together, we obtain a default reasoning paradigm for conceptual knowledge which is in accordance with mainstream developments in nonmonotonic reasoning.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Rounds, W.C., Zhang, G.Q.: Clausal logic and logic programming in algebraic domains. Information and Computation 171, 156–182 (2001)
Abramsky, S., Jung, A.: Domain theory. In: Abramsky, S., Gabbay, D., Maibaum, T.S. (eds.) Handbook of Logic in Computer Science, Clarendon, Oxford, vol. 3 (1994)
Reiter, R.: A logic for default reasoning. Artificial Intelligence 13, 81–132 (1980)
Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: A deductive system for nonmonotonic reasoning. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265, Springer, Heidelberg (1997)
Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence (200x) (to appear)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365–385 (1991)
Hitzler, P., Wendt, M.: Formal concept analysis and resolution in algebraic domains. In: de Moor, A., Ganter, B. (eds.) Using Conceptual Structures – Contributions to ICCS 2003, pp. 157–170. Shaker Verlag, Aachen (2003)
Ganter, B., Wille, R.: Formal Concept Analysis – Mathematical Foundations. Springer, Berlin (1999)
Scott, D.S.: Domains for denotational semantics. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140, pp. 577–613. Springer, Heidelberg (1982)
Hofmann, K.H., Mislove, M.W.: Local compactness and continuous lattices. In: Lee, J.P., Grinstein, G.G. (eds.) Visualization-WS 1993. LNCS, vol. 871, pp. 209–248. Springer, Heidelberg (1994)
Plotkin, G.: Tω as a universal domain. Journal of Computer and System Sciences 17, 209–236 (1978)
Fitting, M.: A Kripke-Kleene-semantics for general logic programs. The Journal of Logic Programming 2, 295–312 (1985)
Hitzler, P.: A resolution theorem for algebraic domains. In: Gottlob, G., Walsh, T. (eds.) Proceedings of the 18th International Joint Conference on Artificial Intelligence, Acapulco, Mexico, August 2003, pp. 1339–1340. Morgan Kaufmann Publishers, San Francisco (2003)
Hitzler, P.: A generalized resolution theorem. Journal of Electrial Engineering, Slovak Academy of Sciences 55, 25–30 (2003)
Makinson, D.: Bridges between classical and nonmonotonic logic. Logic Journal of the IGPL 11, 69–96 (2003)
Lloyd, J.W.: Foundations of Logic Programming. Springer, Berlin (1988)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R.A., Bowen, K.A. (eds.) Logic Programming. Proceedings of the 5th International Conference and Symposium on Logic Programming, pp. 1070–1080. MIT Press, Cambridge (1988)
Wille, R.: Restructuring lattice theory: An approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets, pp. 445–470. Reidel, Dordrecht (1982)
Ganter, B., Wille, R.: Contextual attribute logic. In: Tepfenhart, W.M. (ed.) ICCS 1999. LNCS, vol. 1640, pp. 377–388. Springer, Heidelberg (1999)
Wille, R.: Boolean judgement logic. In: Delugach, H.S., Stumme, G. (eds.) ICCS 2001. LNCS (LNAI), vol. 2120, pp. 115–128. Springer, Heidelberg (2001)
Zhang, G.Q.: Chu spaces, concept lattices, and domains. In: Proceedings of the Nineteenth Conference on the Mathematical Foundations of Programming Semantics, Montreal, Canada, March 2003. Electronic Notes in Theoretical Computer Science, vol. 83 (2003)
Zhang, G.Q., Shen, G.: Approximable concepts, Chu spaces, and information systems. Theory and Applications of Categories (200x) (to appear)
Hitzler, P., Zhang, G.Q.: A cartesian closed category of approximable concept structures. In: Pfeiffer, H., Wolff, K. (eds.) Proceedings of the International Conference On Conceptual Structures, Huntsville, Alabama, USA. LNCS, Springer, Heidelberg (2004) (to appear)
Osswald, R.: Assertions, conditionals, and defaults. In: Kern-Isberner, G., Rödder, W., Kulmann, F. (eds.) WCII 2002. LNCS (LNAI), vol. 3301, pp. 108–130. Springer, Heidelberg (2005)
Osswald, R., Petersen, W.: A logical approach to data driven classification. In: Günter, A., Kruse, R., Neumann, B. (eds.) KI 2003. LNCS (LNAI), vol. 2821, pp. 267–281. Springer, Heidelberg (2003)
Zhang, G.Q., Rounds, W.C.: Reasoning with power defaults (preliminary report). In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265, pp. 152–169. Springer, Heidelberg (1997)
Zhang, G.Q., Rounds, W.C.: Semantics of logic programs and representation of Smyth powerdomains. In: Keimel, K., et al. (eds.) Domains and Processes, pp. 151–179. Kluwer, Dordrecht (2001)
Hitzler, P., Seda, A.K.: Some issues concerning fixed points in computational logic: Quasi-metrics, multivalued mappings and the Knaster-Tarski theorem. In: Proceedings of the 14th Summer Conference on Topology and its Applications: Special Session on Topology in Computer Science, New York. Topology Proceedings, vol. 24, pp. 223–250 (1999)
Hitzler, P., Seda, A.K.: Generalized metrics and uniquely determined logic programs. Theoretical Computer Science 305, 187–219 (2003)
Seda, A.K., Hitzler, P.: Topology and iterates in computational logic. In: Proceedings of the 12th Summer Conference on Topology and its Applications: Special Session on Topology in Computer Science, Ontario, August 1997. Topology Proceedings, vol. 22, pp. 427–469 (1997)
Shastri, L.: Default reasoning in semantic networks: A formalization of recognition and inheritance. Artificial Intelligence 39, 283–355 (1989)
Baader, F., Hollunder, B.: Embedding defaults into terminological representation systems. J. Automated Reasoning 14, 149–180 (1995)
Donini, F.M., Nardi, D., Rosati, R.: Description logics of minimal knowledge and negation as failure. ACM Trans. Comput. Logic 3, 177–225 (2002)
Buccafurri, F., Leone, N.: Disjunctive logic programs with inheritance. Theory and Practice of Logic Programming 2, 293–321 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hitzler, P. (2004). Default Reasoning over Domains and Concept Hierarchies. In: Biundo, S., Frühwirth, T., Palm, G. (eds) KI 2004: Advances in Artificial Intelligence. KI 2004. Lecture Notes in Computer Science(), vol 3238. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30221-6_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-30221-6_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23166-0
Online ISBN: 978-3-540-30221-6
eBook Packages: Springer Book Archive