Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Semantics-Based Filtering: Logic Programming’s Killer App

Gopal GuptaContact Information, Hai-Feng Guo7, Arthur I. Karshmer8, Enrico Pontelli9, Juan Raymundo Iglesias9, Desh Ranjan9, Brook Milligan10, Nayana Datta11, Omar El Khatib9, Mohammed Noamany9 and Xinhong Zhou12

(6)  Dept. of Computer Science, UT Dallas, Richardson, TX, USA
(7)  Dept. of Computer Science, SUNY Stony Brook, Stony Brook, NY, USA
(8)  National Science Foundation and University of S. Florida, Tampa, FL, USA
(9)  Dept. of Computer Science, New Mexico State University, Las Cruces, NM, USA
(10)  Dept. of Biology, New Mexico State University, Las Cruces, NM, USA
(11)  Synopsis, Inc., Boston, MA, USA
(12)  Sabre, Inc, USA
Abstract
We present a logic programming based framework for rapidly translating one formal notation $$
\mathcal{L}_s 
$$ to another formal notation $$
\mathcal{L}_t 
$$ . The framework is based on Horn logical semantics—a logic programming encoding of formal semantics. A Horn logical semantics of the language $$
\mathcal{L}_s 
$$ is constructed which employs the parse trees of the language $$
\mathcal{L}_t 
$$ as semantic domains for expressing the meaning of sentences in $$
\mathcal{L}_s 
$$ . This formal semantics, coded in logic programming, immediately yields an executable (reversible) filter. This (reversible) filter is provably correct, as it is generated from the semantic specification. Our approach provides a formal basis for interoperability and is illustrated through five major practical applications: Translating Nemeth Math Braille notation to LaTEX, translating HTML to VoiceXML to make web-pages accessible via an audio-browser or a phone, translating ODBC programs/data to OQL (Object Query Language) programs/data, automatically generating validating parsers for XML, and interoperating between various biological software systems developed for phylogenetic inference via the NEXUS data representation language.
Authors are partially supported by NSF grants CCR 99-00320, CCR 98-20852, CDA- 9729848, HRD 9800209, EIA 98-10732, EIA 9729848, INT 9904063, CCR 9875279 and grant H133G010046 from the US Dept. of Education.

Contact Information Gopal Gupta
Email: gupta@utdallas.edu
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.106 • Server: MPWEB25
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)