Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Computer Science Logic

CSL 1987: CSL '87 pp 173–187Cite as

Optimization aspects of logical formulas

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 329))

Abstract

We consider logical formulas and we are interested in the question whether a clause γ is a consequence of a given formula α. We investigate the problem whether efficiency of an algorithm deciding deducibility α ⊨ γ for some clause γ can be improved by learning from queries γ' having been answered by the algorithm before. Thus, instead of α we consider a formula α' being equivalent to α. In the first part of this paper we show a connection of this kind of optimization problem to the P=NP-problem. Afterwards we consider Prolog programs and the Prolog inference strategy under these aspects of optimization presenting various possibilities of optimizing propositional Prolog programs.

The work of the author was supported by the Studienstiftung des Deutschen Volkes

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. R. Apt, M. H. van Emden: Contributions to the Theory of Logic Programming, J. of the ACM 29 (1982), pp. 841–862

    Google Scholar 

  2. E. Börger: Berechenbarkeit, Komplexität, Logik, Vieweg-Verlag, Braunschweig 1985 (English translation in preparation)

    Google Scholar 

  3. C. Brown, A. Goldberg, P. Purdom: Average Time Analysis of Simplified Davis-Putnam Procedures, Information Processing Letters 15 (1982), pp. 72–75

    Google Scholar 

  4. C. A. Brown, P. W. Purdom: An Average Time Analysis of Backtracking, SIAM J. Computing 10 (1981), pp. 583–593

    Google Scholar 

  5. C. A. Brown, P. W. Purdom: The pure literal rule and polynomial average time, SIAM J. Computing 14 (1985), pp. 943–953

    Google Scholar 

  6. W. F. Clocksin, C. S. Mellish: Programming in Prolog, Springer-Verlag, Berlin 1984

    Google Scholar 

  7. S. A. Cook: The Complexity of Theorem-proving Procedures, Proc. Third ACM Symp. on Theory of Computing (1971), pp. 151–158

    Google Scholar 

  8. W. F. Dowling, J. H. Gallier: Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae, J. Logic Programming 1 (1984), pp. 267–284

    Google Scholar 

  9. M. R. Genesereth, D. E. Smith: Ordering Conjunctive queries, Artificial Intelligence 26 (1985), pp. 171–215

    Google Scholar 

  10. A. Goldberg: Average case complexity of the satisfiability problem, Proc. Fourth Workshop on Automated Deduction (1979), pp. 1–6

    Google Scholar 

  11. L. Henschen, L. Wos: Unit Refutation and Horn Sets, J. of the ACM 21 (1974), pp. 590–605

    Google Scholar 

  12. N. D. Jones, W. T. Laaser: Complete Problems for Deterministic Polynomial Time, Theoretical Computer Science 3 (1977), pp. 105–117

    Google Scholar 

  13. H. Kleine Büning, U. Löwen: Optimizing Propositional Calculus Formulas with Regard to Questions of Deducibility, Technical Report 178 (1987), Universität Karlsruhe, Institut für Angewandte Informatik und Formale Beschreibungsverfahren

    Google Scholar 

  14. H. Kleine Büning, U. Löwen: Towards Average Complexity of Propositional Binary Prolog Programs, Preprint (1988)

    Google Scholar 

  15. H. Kleine Büning, U. Löwen: Optimization Aspects for Special Prolog Programs, Preprint (1988)

    Google Scholar 

  16. H. Kleine Büning, S. Schmitgen: Prolog, B. G. Teubner, Stuttgart 1986

    Google Scholar 

  17. R. Kowalski: Predicate Logic as Programming Language, Information Processing 74, J. Rosenfeld (ed.), North-Holland, Amsterdam 1974, pp. 556–574

    Google Scholar 

  18. K. S. Natarajan: Optimizing Backtrack Search for all Solutions to Conjunctive Problems, Proc. Tenth Int. Joint Conf. on Artificial Intelligence (1987), pp. 955–958

    Google Scholar 

  19. N. J. Nilsson: Principles of Artificial Intelligence, Springer-Verlag, Berlin 1982

    Google Scholar 

  20. L. M. Pereira, A. Porto: Selective Backtracking, Logic Programming, K. Clark and S. Tärnlund (eds.), Academic Press, New York 1982, pp. 107–114

    Google Scholar 

  21. D. Plaisted: The Occur-Check Problem in Prolog, Proc. Int. Symp. on Logic Programming (1984), pp. 272–280

    Google Scholar 

  22. J. R. Shoenfield: Mathematical Logic, Addison-Wesley, London 1967

    Google Scholar 

  23. E. Speckenmeyer: Classes of CNF-Formulas with Backtracking Trees of Exponential or Linear Average Order for Exact Satisfiability, Technical Report 47 (1987), Universität — GH — Paderborn, Fachbereich Mathematik-Informatik

    Google Scholar 

  24. E. Speckenmeyer: On the Average Case Complexity of Backtracking for the Exact Satisfiability Problem, this volume

    Google Scholar 

  25. P. Štěpánek, O. Štěpánková: Transformations of Logic Programs, J. Logic Programming 1 (1984), pp. 305–318

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB 11 — Fachgebiet Praktische Informatik, Universität — GH — Duisburg, D-4100, Duisburg 1, West-Germany

    Ulrich Löwen

Authors
  1. Ulrich Löwen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Hans Kleine Büning Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag

About this paper

Cite this paper

Löwen, U. (1988). Optimization aspects of logical formulas. In: Börger, E., Büning, H.K., Richter, M.M. (eds) CSL '87. CSL 1987. Lecture Notes in Computer Science, vol 329. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50241-6_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-50241-6_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50241-8

  • Online ISBN: 978-3-540-45960-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation