| Alternate document: Details Preference Logic Programming: Optimization as Inference (94) Kannan Govindarajan Bharat Jayaraman Department of Computer Science State |
Kannan Govindarajan  Home/Search
Context Related
Links: ACM DBLP | buffalo.edu/pub/techrepor...9427.ps.Z buffalo.edu/pub/techrepor...9427.ps.Z 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 Problem Downloading? From: buffalo.edu/pub/techrep...README (more) From: buffalo.edu/pub/techrep...README (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. An application of PLGs of special interest is optimal parsing, which is an extension of parsing wherein costs are associated with the different (ambiguous) parses of a string and the preferred parse is the one with least cost. Many problems can be viewed as optimal parsing problems, e.g., code generation, document layout, etc. We show that PLGs are an extension of... (Update)
Context of citations to this paper: More
.... The resulting grammar is called a preference logic grammar, and its translation to a preference logic program is straightforward (see [16] for details) We also show how the concept of constraint hierarchies described by Borning [40] is subsumed by preference logic...
...Horn clauses. The resulting framework is called Preference Logic Programs (PLPs) or, in their grammar form Preference Logic Grammars (PLGs) [3]. PLPs contain a syntactic restriction that ensures that the preferences can be precomputed statically . The semantics of PLPs is also...
Cited by: More
Tabling for Non-monotonic Programming - Swift (1999) (Correct)
Tabling for Logic-based Artificial Intelligence - Swift (1999) (Correct)
Preference Logic Programming - Govindarajan (1995) (Correct)
Similar documents (at the sentence level): More
24.2%: Preference Logic Programming: Optimization as Inference - Kannan Govindarajan (1994) (Correct)
9.0%: Preference Logic Grammars - Jayaraman, Govindarajan, Mantha (1998) (Correct)
6.5%: Optimization and Relaxation in Constraint Logic Languages - Govindarajan, Jayaraman.. (1996) (Correct)
Active bibliography (related documents): More All
0.2: Logic Programming with Preferences and Constraints - Jayaraman, Govindarajan, al. (Correct)
0.1: SIMON: A grammar-based transformation system for structured.. - An Feng And (1993) (Correct)
0.1: Document Reuse and Document Systems - Levy (1993) (Correct)
Similar documents based on text: More All
0.2: Preference Datalog - Summary Kannan (Correct)
0.2: Preference Queries in Deductive Databases - Kannan Govindarajan (1995) (Correct)
0.2: A Case Study in Using Preference Logic Grammars for Knowledge.. - Baoqiu Cui (1999) (Correct)
Related documents from co-citation: More All
7: Preference Logic Programming - Govindarajan, Jayaraman et al. - 1995
5: Foundations of Logic Programming (context) - Lloyd - 1987
4: Unfounded sets and well-founded semantics for general logic programs (context) - van Gelder, Ross et al. - 1991
BibTeX entry: (Update)
K. Govindarajan, B. Jayaraman, and S. Mantha. Preference Logic Grammars. Technical Report 94-27, Dept. of Computer Science, SUNY at Buffalo, 1994. http://citeseer.ist.psu.edu/govindarajan94preference.html More
@techreport{ govindarajan94preference,
author = "Kannan Govindarajan and Bharat Jayaraman and Surya Mantha",
title = "Preference Logic Grammars",
number = "94-27",
month = "24,",
year = "1994",
url = "citeseer.ist.psu.edu/govindarajan94preference.html" }
Citations (may not include all citations):561 Constraint Logic Programming (context) - Jaffar, Lassez - 1987 ACM DBLP
380 Constraint Satisfaction in Logic Programming (context) - van Hentenryck - 1989 ACM
373 Constraint Logic Programming : A Survey - Jaffar, Maher
245 Semantics of Context-Free Languages (context) - Knuth - 1968 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
62 Generating Language-based Environments (context) - Reps - 1984 ACM
33 Minimum and Maximum Predicates in Logic Programming - Ganguly, Greco et al. - 1991 ACM DBLP
28 Expanding Query Power in Constraint Logic Programming Langua.. (context) - Maher, Stuckey - 1989 DBLP
18 Incremental constraint satisfaction in logic programming (context) - van Hentenryck - 1990 ACM DBLP
15 the Semantics of Optimization Predicates in CLP Languages - Fages - 1993
12 First-Order Preference Theories and their Applications (context) - Mantha - 1991 ACM
10 Augmenting Parsers to Support Incrementality (context) - Ghezzi, Mandrioli - 1980 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 Symbolic Computation (context) - Abramson, Dahl - 1989 ACM
2 Preference Logic Programming : Optimization as Inference - Govindarajan, Jayaraman et al. - 1994
2 Attribute Grammars and Logic Programs : A Comparison of Conc.. (context) - Maluszynski
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.buffalo.edu/pub/tech-reports/README.html): More
Information Capacity of Binary Weights Associative Memories - Jagota, Narasimhan, Regan (1996) (Correct)
On Self-Testing without the Generator Bottleneck - Ravikumar, Sivakumar (1995) (Correct)
The Design of Uncheatable Benchmarks Using Complexity Theory - Cai, Nerurkar, Wu (1997) (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