See this document in CiteSeerX!

Rule Ordering in Bottom-Up Fixpoint Evaluation of  (Make Corrections)  
Logic Programs Raghu Ramakrishnan Divesh Srivastava S. Sudarshan



  Home/Search   Context   Related

 
View or download:
att.com/~divesh/pa...94evaljournal.ps
Cached:  PS.gz  PS   PDF  Image  Update  Help

From:  att.com/~divesh/papers/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Logic programs can be evaluated bottom-up by repeatedly applying all rules, in "iterations ", until the fixpoint is reached. However, it is often desirable---and in some cases, e.g. (Update)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ raghu-rule,
  author = "Logic Programs Raghu",
  title = "Rule Ordering in Bottom-Up Fixpoint Evaluation of",
  url = "citeseer.ist.psu.edu/738948.html" }
Citations not processed or no citations identified.

Documents on the same site (http://public.research.att.com/~divesh/papers/):   More
Diamond in the Rough: Finding Hierarchical Heavy.. - Cormode, Korn.. (2004)   (Correct)
Explaining Program Execution in Deductive Systems - Arora, Ramakrishnan, Roth.. (1993)   (Correct)
Using LDAP Directory Caches - Cluet, Kapitskaia, Srivastava (1999)   (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