A case study in using preference logic grammars for knowledge representation

Baoqiu Cui, Terrance Swift, David S. Warren

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages206-220
Number of pages15
Volume1730
ISBN (Print)3540667490, 9783540667490
DOIs
StatePublished - 1999
Externally publishedYes
Event5th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1999 - El Paso, United States
Duration: Dec 2 1999Dec 4 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1730
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other5th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1999
CountryUnited States
CityEl Paso
Period12/2/9912/4/99

Fingerprint

Knowledge representation
Knowledge Representation
Grammar
Prolog
Logic
Inconsistency
Truncation
Standardization
Semantics
Parsing
Programming
Fixed point
Software

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Cui, B., Swift, T., & Warren, D. S. (1999). A case study in using preference logic grammars for knowledge representation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1730, pp. 206-220). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1730). Springer Verlag. https://doi.org/10.1007/3-540-46767-X_15

A case study in using preference logic grammars for knowledge representation. / Cui, Baoqiu; Swift, Terrance; Warren, David S.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1730 Springer Verlag, 1999. p. 206-220 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1730).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cui, B, Swift, T & Warren, DS 1999, A case study in using preference logic grammars for knowledge representation. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1730, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1730, Springer Verlag, pp. 206-220, 5th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1999, El Paso, United States, 12/2/99. https://doi.org/10.1007/3-540-46767-X_15
Cui B, Swift T, Warren DS. A case study in using preference logic grammars for knowledge representation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1730. Springer Verlag. 1999. p. 206-220. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-46767-X_15
Cui, Baoqiu ; Swift, Terrance ; Warren, David S. / A case study in using preference logic grammars for knowledge representation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1730 Springer Verlag, 1999. pp. 206-220 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{351e716dbd2243159dd1af72de52dbb5,
title = "A case study in using preference logic grammars for knowledge representation",
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.",
author = "Baoqiu Cui and Terrance Swift and Warren, {David S.}",
year = "1999",
doi = "10.1007/3-540-46767-X_15",
language = "English (US)",
isbn = "3540667490",
volume = "1730",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "206--220",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - A case study in using preference logic grammars for knowledge representation

AU - Cui, Baoqiu

AU - Swift, Terrance

AU - Warren, David S.

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84958614101&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84958614101&partnerID=8YFLogxK

U2 - 10.1007/3-540-46767-X_15

DO - 10.1007/3-540-46767-X_15

M3 - Conference contribution

AN - SCOPUS:84958614101

SN - 3540667490

SN - 9783540667490

VL - 1730

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 206

EP - 220

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -