Bharat Jayaraman, Kannan Govindarajan, Surya Mantha  Home/Search
Context Related
Links: ACM DBLP | buffalo.edu/pub/WWW/LRG/Papers...plg.ps buffalo.edu/pub/WWW/LRG/Papers...plg.ps buffalo.edu/LRG/Papers/plg.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: buffalo.edu/pub/WWW/LRG/papers (more) From: buffalo.edu (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Preference logic grammars (PLGs) are introduced in this paper as a declarative means of resolving ambiguity in logic grammars. Preference logic grammars can be thought as extensions of definite clause grammars (DCGs) and definite-clause translation grammars (DCTGs). Just as DCGs and DCTGs can be directly translated into logic programs, PLGs can be translated into preference logic programs (PLPs), which we introduced in our earlier work. We discuss two applications of PLGs, optimal parsing and... (Update)
Context of citations to this paper: More
.... framework is called Preference Logic Grammars (PLGs) which can be taken as a grammatical form of Preference Logic Programs (PLPs) [9]. The following example from [9] illustrates their use in a simple example from programming languages. Example 1.1 An imperative programming...
...S. Warren. This paper does not re ect the ocial positions of the U.S. Defense Logistics Agency or the U.S. Customs Service. As proposed in [6, 7] a natural way to resolve grammatical ambiguities is to declare preferences for one parse over another by adding preference clauses...
Cited by: More
Using Tabling to Extend Prolog with Non-Monotonic Constructs - Swift (Correct)
Preference Logic Grammars: Fixed Point Semantics and.. - Cui, Swift (2002) (Correct)
Preference Logic Grammars: Semantics, Implementation, and.. - Cui, Swift (Correct)
Similar documents (at the sentence level): More
12.3%: Logic Programming with Preferences and Constraints - Jayaraman, Govindarajan, al. (Correct)
7.9%: Preference Logic Grammars - Govindarajan (1994) (Correct)
6.1%: Optimization and Relaxation in Constraint Logic Languages - Govindarajan, Jayaraman.. (1996) (Correct)
Active bibliography (related documents): More All
0.4: A Logical Approach to Quality of Service Specification in Video.. - Bertino (2004) (Correct)
0.3: Bottom-Up Earley Deduction - Erbach (1994) (Correct)
0.3: 1983-1993: The Wonder Years of Sequential Prolog Implementation - Van Roy (1993) (Correct)
Similar documents based on text: More All
0.4: A Generalized Greibach Normal Form for Definite Clause Grammars - Dymetman (1992) (Correct)
0.4: Extraposition Grammars - Pereira (1981) (Correct)
0.3: Preference Datalog - Summary Kannan (Correct)
Related documents from co-citation: More All
3: CCTIS: an expert transaction processing system - Swift, Henderson et al. - 1994
2: Linear subclasses of the well-founded semantics (context) - Dix, Swift - 2000
2: Well-founded semantics for extended logic programs with dynamic preferences - Brewka - 1996
BibTeX entry: (Update)
B. Jayaraman, K. Govindarajan, and S. Mantha. Preference logic grammars. Computer Languages, 1998. 179-196. http://citeseer.ist.psu.edu/jayaraman98preference.html More
@article{ jayaraman98preference,
author = "Bharat Jayaraman and Kannan Govindarajan and Surya Mantha",
title = "Preference logic grammars",
journal = "Computer Languages",
volume = "24",
number = "3",
pages = "179--196",
year = "1998",
url = "citeseer.ist.psu.edu/jayaraman98preference.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1987 ACM
561 Constraint Logic Programming (context) - Jaffar, Lassez - 1987 ACM DBLP
380 Constraint Satisfaction in Logic Programming (context) - van Hentenryck - 1989
373 Constraint Logic Programming: A Survey - Jaffar, Maher - 1994 DBLP
245 Semantics of Context-Free Languages (context) - Knuth - 1968 DBLP
135 Definite Clause Grammars for Language Analysis - A Survey of.. (context) - Pereira, Warren - 1980 DBLP
91 Code Generation using Tree Matching and Dynamic Programming (context) - Aho, Ganapathi et al. - 1989 ACM DBLP
78 Software Practice and Experience (context) - Knuth, Plass et al. - 1981
58 Memoing for Logic Programs (context) - Warren - 1992 ACM DBLP
56 Seven Principles of Surface Structure Parsing in Natural Lan.. (context) - Kimball - 1973
50 Hierarchical Constraint Logic Programming - Wilson, Borning - 1993 ACM DBLP
30 Strategies for Adding Control Information to Declarative Gra.. - Uszkoreit - 1991 ACM DBLP
25 Preference Logic Programming - Govindarajan, Jayaraman et al. - 1995 DBLP
15 Are There Preference Trade-offs in Attachment Decisions (context) - Schubert - 1986
13 A new Characterization of Attachment Preferences (context) - Pereira - 1985
11 Optimization and Relaxation in Constraint Logic Languages - Govindarajan, Jayaraman et al. - 1996 ACM DBLP
10 Definite Clause Translation Grammars (context) - Abramson - 1984 ACM DBLP
7 The Declarative Semantics of Document Processing (context) - Brown, Mantha et al. - 1992
3 Using Preference Values in Typed Feature Structures to Explo.. (context) - Erbach - 1992 ACM
3 XSB: An Overview of its Use and Implementation - Sagonas, Swift et al.
3 Optimization and Relaxation in Logic Languages (context) - Govindarajan - 1997 ACM
3 Symbolic Computation (context) - Abramson, Dahl - 1989 ACM
Documents on the same site (http://www.cse.buffalo.edu/pub/WWW/LRG/papers.html): More
From Context-Free To Definite-Clause Grammars: A.. - Juergen Haas (1993) (Correct)
Scoping Constructs in Logic Programming: Implementation.. - Nadathur, Jayaraman.. (1995) (Correct)
Preference Logic Programming - Kannan Govindarajan (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC