Optimization by non-deterministic, lazy rewriting

  • Sanjai Narain
Regular Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 355)


Given a set S and a condition C we address the problem of determining which members of S satisfy C. One useful approach is to set up the generation of S as a tree, where each node represents a subset of S. If from the information available at a node, we can determine that no members of the subset it represents satisfy C, then the subtree rooted at it can be pruned, i.e. its generation suppressed. Thus, large subsets of S can be quickly eliminated from consideration. We show how such a tree can be simulated by interpretation of non-deterministic rewrite rules, and its pruning simulated by lazy evaluation.


Normal Form Logic Programming Function Symbol Reduction Rule Horn Clause 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Barbuti, R., Bellia, M., Levi, G. [1986]. LEAF: A language which integrates logic, equations, and functions. In Logic programming: functions, relations and equations (eds.) D. DeGroot, G. Lindstrom, Prentice Hall, N.J.Google Scholar
  2. Bruynooghe, M., Pereira, L.M. [1984]. Deduction revision by intelligent backtracking. In, Chang, J.-H., Despain, A.M. [1984]. Semi-intelligent backtracking of Prolog based on a static data dependency analysis. Proceedings of IEEE symposium on logic programming, Boston, MA.Google Scholar
  3. Clark, K.L., McCabe F. [1979]. Programmer's guide to IC-Prolog. CCD Report 79/7, London: Imperial College, University of London.Google Scholar
  4. Dincbas, M., Simonis, H., van Hentenryck, P. [1988]. Solving a cutting-stock problem in constraint logic programming. Proceedings of fifth international conference and symposium on logic programming, eds. R. Kowalski, K. Bowen, MIT Press, Cambridge, MA.Google Scholar
  5. Garey, M.R., Johnson, D.S. [1979]. Computers and intractability. A guide to the theory of NP-completeness. W.H. Freeman & Co. New York, N.Y.Google Scholar
  6. Huet, G., Levy, J.-J. [1979]. Call by need computations in non-ambiguous linear term rewriting systems. IRIA technical report 359.Google Scholar
  7. Kahn, G., MacQueen, D. [1977]. Coroutines and Networks of Parallel Processes. Information Processing-77, North-Holland, Amsterdam.Google Scholar
  8. Knuth, D.E., Bendix, P.B. [1970]. Simple word problems in universal algebras. Computational problems in abstract algebra, ed. J. Leech, Pergamon Press.Google Scholar
  9. Kumar, V., Lin, Y.-J. [1988]. A data-dependency-based intelligent backtracking scheme for Prolog. Journal of Logic Programming, vol. 5, No. 2, June.Google Scholar
  10. Lloyd, J. [1984]. Foundations of logic programming. Springer Verlag, New York.Google Scholar
  11. Narain, S. [1986]. A Technique for Doing Lazy Evaluation in Logic. Journal of Logic Programming, vol. 3, no. 3, October.Google Scholar
  12. Narain, S. [1988]. LOG(F): An optimal combination of logic programming, rewriting and lazy evaluation. Ph.D. Thesis, Department of Computer Science, University of California, Los Angeles.Google Scholar
  13. O'Donnell, M.J. [1985]. Equational logic as a programming language. MIT Press, Cambridge, MA.Google Scholar
  14. Polya, G. [1973]. How to solve it. Princeton university press. Princeton, NJ.Google Scholar
  15. Sterling, L., Shapiro, E. [1986]. The art of Prolog. MIT Press, Cambridge, MA.Google Scholar
  16. Subrahmanyam, P.A. and You J.-H. [1984]. Conceptual Basis and Evaluation Strategies for Integrating Functional and Logic Programming. Proceedings of IEEE Logic Programming Symposium, Atlantic City, N.J.Google Scholar
  17. van Hentenryck, P., Dincbas, M. [1987]. Foward checking in logic programming. Proceedings of fourth international conference on logic programming. ed. J.-L. Lassez, MIT Press, Camberidge, MA.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Sanjai Narain
    • 1
  1. 1.RAND CorporationSanta Monica

Personalised recommendations