
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Vilas Wuwongse, Ekawit Nantajeewarawat, "Declarative Programs with Implicit Implications," IEEE Transactions on Knowledge and Data Engineering, vol. 14, no. 4, pp. 836849, July/August, 2002.  
BibTex  x  
@article{ 10.1109/TKDE.2002.1019217, author = {Vilas Wuwongse and Ekawit Nantajeewarawat}, title = {Declarative Programs with Implicit Implications}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {14}, number = {4}, issn = {10414347}, year = {2002}, pages = {836849}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2002.1019217}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Declarative Programs with Implicit Implications IS  4 SN  10414347 SP836 EP849 EPD  836849 A1  Vilas Wuwongse, A1  Ekawit Nantajeewarawat, PY  2002 KW  Declarative program KW  implicit implication KW  subsumption KW  taxonomy KW  deductive objectoriented database KW  modeltheoretic semantics KW  fixpoint semantics. VL  14 JA  IEEE Transactions on Knowledge and Data Engineering ER   
In the presence of taxonomic information, there often exists implicit implication among atoms in an interpretation domain. A general framework is proposed for the discussion of an appropriate semantics for declarative programs with respect to such implicit implication. It is first assumed that the implicit implication can be predetermined and represented by a preorder on the interpretation domain. Under the consequent constraint that every interpretation must conform to the implicit implication, an appropriate modeltheoretic semantics as well as its corresponding fixpoint semantics for declarative programs is described. Based on Köstler et al.'s foundation of fixpoint with subsumption, it is shown that, if the implicitimplication relation is, in addition, assumed to be a partial order, then the meaning of a program can be determined more efficiently by application of an immediateconsequence operator which involves only reduced representations, basically consisting only of their maximal elements, of subsets of the interpretation domain.
[1] H. AitKaci and R. Nasr, "LOGIN: A Logic Programming Language with BuiltIn Inheritance," The J. of Logic Programming, vol. 3, no. 3, pp. 185215, Oct. 1986.
[2] H. AïtKaci and A. Podelski, “Towards a Meaning of Life,“ J. Logic Programming, vol. 16, no. 3/4, pp. 195–234, 1993.
[3] K. Akama, “Declarative Semantics of Logic Programs on Parameterized Representation Systems,“ Advances in Software Science and Technology, vol. 5, pp. 45–63, 1993.
[4] C. Anutariya et al., "Towards a Foundation for XML Document Databases," Proc. 1st Int'l Conf. Electronic Commerce and Web Technologies(ECWeb 2000), Lecture Notes in Computer Science, no. 1875, SpringerVerlag, Heidelberg, 2000, pp. 324333.
[5] A. Borgida, J. Mylopoulos, and H.K.T. Wong, “Generalization/Specialization as a Basis for Software Specification,” On Conceptual Modelling: Perspectives from Artificial Intelligence, Databases, and Programming Languages, M.L. Brodie, J. Mylopoulos, and J.W. Schmidt, eds., pp. 87–117, 1984.
[6] A. Borgida, Description Logics in Data Management IEEE Trans. Knowledge and Data Eng., vol. 7, no. 5, pp. 671682, 1995.
[7] R.J. Brachman, R.E. Fikes, and H.J. Levesque, “KRYPTON: A Functional Approach to Knowledge Representation,“ Computer, vol. 16, no. 10, pp. 67–73, 1983.
[8] R.J. Brachman, D.L. McGuinness, P.F. PatelSchneider, and L.A. Resnick, “Living with CLASSIC: When and How to Use a KLONELike Language” Principles of Semantic Networks, J.F. Sowa, ed., pp. 401–456, 1991.
[9] R.J. Brachman and J.G. Schmolze, “An Overview of the KLONE Knowledge Representation System,“ Cognitive Science, vol. 9, no. 2, pp. 171–216, 1985.
[10] W. Cyre, “A Requirements Sublanguage for Automated Analysis,“ Int'l J. Intelligent Systems, vol. 10, no. 7, pp. 665–689, 1995.
[11] W.R. Cyre, "Capture, Integration, and Analysis of Digital Systems Requirements with Conceptual Graphs," IEEE Trans. Knowledge and Data Eng., vol. 9, no. 1, Jan. 1991, pp. 823.
[12] G. Ellis, “Compiling Conceptual Graphs,“ IEEE Trans. Knowledge and Data Eng., vol. 7, no. 1, pp. 68–81, Feb. 1995.
[13] B.C. Ghosh, V. Wuwongse, “Inference Systems for Conceptual Graph Programs” W.M. Tepfenhart, J.P. Dick and J.F. Sowa, eds., Conceptual Structures: Current Practices, Lecture Notes in Artificial Intelligence, vol. 835 pp. 214–229, 1994.
[14] B.C. Ghosh and V. Wuwongse, “A Direct Proof Procedure for Definite Conceptual Graph Programs,” Conceptual Structures: Applications, Implementation, and Theory, G. Ellis, R.A. Levinson, W. Rich, and J.F. Sowa, eds., 1995.
[15] B.C. Ghosh and V. Wuwongse, “Conceptual Graph Programs and Their Declarative Semantics,“ IEICE Trans. Information and Systems, vol. E78D, no. 9, pp. 1208–1217, 1995.
[16] J.R. Hobbs, “Overview of the TACITUS Project,“ Computational Linguistics, vol. 12, no. 3, pp. 220–222, 1986.
[17] M. Kifer, G. Lausen, and J. Wu, "Logical Foundations of ObjectOriented and FrameBased Languages," J. ACM, vol. 42, pp. 741843, 1995.
[18] G. Köstler, W. Kießling, H. Thöne, and U. Güntzer, “The Differential Fixpoint Operator with Subsumption,“ Proc. Third Int'l Conf. Deductive and ObjectOriented Databases (DOOD), pp. 35–48, 1993.
[19] G. Köstler, W. Kießling, H. Thöne, and U. Güntzer, “Fixpoint Iteration with Subsumption in Deductive Databases,“ J. Intelligent Information Systems, vol. 4, no. 2, pp. 123–148, 1995.
[20] D. Lenat and R.V. Guha, Building Large KnowledgeBased Systems. AddisonWesley, 1990.
[21] J.W. Lloyd, Foundations of Logic Programming, Springer Series in Symbolic Computation, second ed. New York: SpringerVerlag, 1987.
[22] R. MacGregor, “A Deductive Pattern Matcher,“ Proc. Nat'l Conf. Artificial Intelligence (AAAI), pp. 403–408, 1988.
[23] M.L. Mugnier and M. Chein,“Characterization and algorithmic recognition of canonical conceptual graphs,” in G.W. Mineau, B. Moulin, and J.F. Sowa, eds., Conceptual Graphs for Knowledge Representation, Lecture Notes in Artificial Intelligence, SpringerVerlag, Berlin, No. 699, 1993, pp. 294311.
[24] M.L. Mugnier and M. Chein, “Polynomial Algorithms for Projection and Matching,” Conceptual Structures: Theory and Implementation, T.E. Nagle and H.D. Pfeiffer, eds., 1993.
[25] M.L. Mugnier, “On Generalization/Specialization for Conceptual Graphs,“ J. Experimental and Theoretical Artificial Intelligence, vol. 7, pp. 325–344, 1995.
[26] S.J. Russell and P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, Upper Saddle River, N.J., 1994.
[27] J.F. Sowa, Conceptual Structures: Information Processing in Mind and Machine, AddisonWesley, Reading, Mass., 1984.
[28] J. Sowa, Knowledge Representation: Logical, Philosophical, and Computational Foundations, to be published, PWS Publishing Company, Aug. 1999.
[29] A. Taivalsaari, "On the Notion of Inheritance," ACM Computing Surveys, Vol. 28, No. 3, 1996, pp. 438479.
[30] D.H.D. Warren and F.C.N. Pereira, “An Efficient Easily Adaptable System for Interpreting Natural Language Queries,“ Computational Linguistics, vol. 8, no. 3/4, pp. 110–122, 1982.
[31] W.A. Woods, “Understanding Subsumption and Taxonomy: A Framework for Progress,” Principles of Semantic Networks, J.F. Sowa, ed., pp. 45–94, 1991.
[32] W.A. Woods and J.G. Schmolze, “The KLONE Family,“ Computers&Mathematics with Applications, vol. 23, pp. 133–177, 1992.
[33] V. Wuwongse and E. Nantajeewarawat, “Declarative Program Theory with Implicit Implication,“ Proc. Fourth Pacific Rim Int'l Conf. Artificial Intelligence (PRICAI), 1996.