K. Govindarajan, "Optimization and relaxation in logic languages," Ph.D. thesis, Department of Computer Science, SUNY-Buffalo, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Logic Programming with Preferences and Constraints - Jayaraman, Govindarajan, al. Self-citation (Govindarajan) (Correct)
....areas of further work. To keep the paper concise, we have placed the technical proofs of the key propositions and lemmas in the appendix, and provided the proofs of the main results in the body of the paper. Omitted proofs of proposition lemmas theorems may be found in Govindarajan s dissertation [12]. 2 Related Work The use of constraints for problem modeling can be traced to the work on Sketchpad by Sutherland [34] More recent works include the constraint language of Steele [33] and Borning s Thinglab [3] and Leler s Bertrand language [25] A major breakthrough was achieved by Jaffar and ....
....rule out the pruned solution. Since the set of constraints associated with a node can have multiple solutions, it is possible that one solution to the set of constraints prunes another solution. We present the outline of the operational semantics and present the results. The reader is referred to [12] for details of the proofs. Definition 4.23 Given a CLP program P , a goal G and two partial computation trees T 1 and T 2 for P [ fGg, we define T 1 ) T 2 to mean that T 2 is derived from T 1 by choosing a non empty leaf l = hfA 1 ; Am ; A k g; fC j gi of T 1 , choosing a ....
[Article contains additional citation context not shown here]
K. Govindarajan. Optimization and Relaxation in Logic Languages. PhD thesis, Dept. of Computer Science, SUNY-Buffalo, 1997.
Preference Logic Grammars - Jayaraman, Govindarajan, Mantha (1998) (3 citations) Self-citation (Govindarajan) (Correct)
....derivable from a nonterminal, these arbiter clauses will dictate the most preferred parse for the sentence. Just as definite clause grammars can be translated into logic programs, preference logic grammars can be translated into preference logic programs which we introduced in our earlier work [GJM95, GJM96, Gov97]. The paradigm of preference logic programming was introduced in order to obtain a logical means of specifying optimization problems. The operational semantics of preference logic programs constructs the optimal parse by keeping track of alternative parses and pruning parses that are suboptimal. ....
....and each L i is an atom whose head is a C predicate or a constraint as in CLP. In essence this form of the arbiter states that p( t) is less preferred than p( u) if L 1 ; L n . We have formalized the semantics of preference logic programs in our earlier work, and we refer the reader to [GJM96, Gov97] for a detailed exposition. In short, preference logic programs have a well defined meaning as long as recursion through the optimization clauses is well founded, or locally stratified. This is similar in spirit to the semantics of negation as failure [Llo87] We have given a possible worlds ....
[Article contains additional citation context not shown here]
K. Govindarajan. Optimization and Relaxation in Logic Languages. PhD thesis, Dept. of Computer Science, SUNY-Buffalo, 1997.
A Logical Approach to Quality of Service Specification in Video.. - Bertino (2004) (Correct)
No context found.
K. Govindarajan, "Optimization and relaxation in logic languages," Ph.D. thesis, Department of Computer Science, SUNY-Buffalo, 1997.
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