Abstract
Data standardization is the commercially important process of extracting useful information from poorly structured textual data. This process includes correcting misspellings and truncations, extraction of data via parsing, and correcting inconsistencies in extracted data. Prolog programming offers natural advantages for standardizing: definite clause grammars can be used to parse data; Prolog rules can be used to correct inconsistencies; and Prolog’s simple syntax allows rules to be generated to correct misspellings and truncations of keywords. These advantages can be seen as rudimentary mechanisms for knowledge representation and at least one commercial standardizer has exploited these advantages. However advances in implementation and in knowledge representation — in particular the addition of preferences to logical formalisms — allow even more powerful and declarative standardizers to be constructed. In this paper a simple preference logic, that of [7] is considered. A fixed point semantics is defined for this logic and its tabled implementation within XSB is described. Development of a commercial standardizer using the preference logic of [7] is then documented. Finally, detailed comparisons are made between the preference logic standardizer and the previous Prolog standardizer illustrating how an advance in knowledge representation can lead to improved commercial software.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
G. Brewka. Well-founded semantics for extended logic programs with dynamic preferences. Journal of Artificial Intelligence Research, 4:19–36, 1996.
W. Chen and D. S. Warren. Tabled Evaluation with Delaying for General Logic Programs. JACM, 43(1):20–74, January 1996.
C. Crowner, K. Govindarajan, B. Jayaraman, and S. Mantha. Preference logic grammars. Computer Languages, 1999. To apear.
B. Cui, T. Swift, and D. S. Warren. Using tabled logic programs and preference logic for data standardization. Available at http://www.cs.sunysb.edu/~tswift, 1998.
J. Earley. An efficient context-free parsing algorithm. Communications of the ACM, 13(2):94–102, 1970.
J. Freire, T. Swift, and D. S. Warren. Beyond depth-first: Improving tabled logic programs through alternative scheduling strategies. Journal of Functional and Logic Programming, 1998(3), 1998.
K. Govindarajan, B. Jayaraman, and S. Mantha. Preference logic programming. In ICLP, pages 731–746. MIT Press, 1995.
M. Kifer and V. S. Subrahmanian. Theory of generalized annotated logic programming and its applications. J. Logic Programming, 12(4):335–368, 1992.
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin Germany, 1984.
I. V. Ramakrishnan, A. Roychoudhury, and T. Swift. A standardization tool for data warehousing. In Practical Applications of Prolog, 1997.
T. Swift. Tabling for non-monotonic programming. Annals of Mathematics and Artifficial Intelligence, 1999. To appear.
T. Swift, C. Henderson, R. Holberger, J. Murphey, and E. Neham. CCTIS: an expert transaction processing system. In Sixth Conference on Industrial Applications of Artifficial Intelligence,pages 131–140, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cui, B., Swift, T., Warren, D.S. (1999). A Case Study in Using Preference Logic Grammars for Knowledge Representation. In: Gelfond, M., Leone, N., Pfeifer, G. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 1999. Lecture Notes in Computer Science(), vol 1730. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46767-X_15
Download citation
DOI: https://doi.org/10.1007/3-540-46767-X_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66749-0
Online ISBN: 978-3-540-46767-0
eBook Packages: Springer Book Archive