Abstract
In this article we discuss issues posed by the introduction of dependency-based search space pruning in an And-Or Tree Rewriting System (AORS), such as AKL and the Extended Andorra Model. A mechanism relying on two simple devices (the alt and other attributes) is presented. The construction and application of alt and other is illustrated in the context of the configuration rewrite rules for AKL.
Chapter PDF
Similar content being viewed by others
References
Salvador Abreu, Luís Moniz Pereira, and Philippe Codognet. Improving Backward Execution in Non-deterministic Concurrent Logic Languages. In Ryuzo Hasegawa and Mark Stickel, editors, Workshop on Automated Deduction, Fifth Generation Computer Systems. Institute for New Generation Computing, 1992.
Salvador Abreu, Luís Moniz Pereira, and Philippe Codognet. Improving backward execution in the andorra family of languages. In Apt [3], pages 384–398.
Krzysztof Apt, editor. Proceedings of the Joint International Conference and Symposium on Logic Programming, Washington, USA, 1992. The MIT Press.
M. Bruynooghe and L. M. Peieira. Deduction revision by intelligent backtracking. In J.A. Campbell, editor, Implementations of Prolog. Ellis-Horwood, 1984.
C. Codognet and P. Codognet. Non-deterministic stream AND-Parallelism based on intelligent backtracking. In Levi and Martelli [13], pages 63–79.
Christian Codognet, Philippe Codognet, and Gilberto File. Yet another intelligent backtracking method. In Kowalski and Bowen [11], pages 447–465.
Philippe Codognet and Thierry Sola. Extending the WAM for intelligent backtracking. In Furukawa [8], pages 127–141.
Koichi Furukawa, editor. Proceedings of the Eighth International Conference on Logic Programming, Paris, France, 1991. The MIT Press.
Seif Haridi and Sverker Janson. Kernel andorra Prolog and its computation model. In Warren and Szeredi [18], pages 31–46.
Sverker Janson and Seif Haridi. Programming paradigms of the Andorra kernel language. In Saraswat and Ueda [15], pages 167–186.
Robert A. Kowalski and Kenneth A. Bowen, editors. Proceedings of the Fifth International Conference and Symposium on Logic Programming, Seatle, 1988. ALP, IEEE, The MIT Press.
V. Kumar and Y.-J. Lin. An intelligent backtracking scheme for Prolog. In Proceedings of the 1987 Symposium on Logic Programming, pages 406–414, San Francisco, August-September 1987. IEEE, Computer Society Press.
Giorgio Levi and Maurizio Martelli, editors. Proceedings of the Sixth International Conference on Logic Programming, Lisbon, 1989. The MIT Press.
L. M. Pereira and A. Porto. Intelligent backtracking and sidetracking in horn clause programs. Technical Report CIUNL 2/79, Universitade Nova de Lisboa, 1979.
Vijay Saraswat and Kazunori Ueda, editors. Logic Programming, Proceedings of the 1991 International Symposium, San Diego, USA, 1991. The MIT Press.
Ehud Shapiro, editor. Proceedings of the Third International Conference on Logic Programming, Lecture Notes in Computer Science, London, 1986. Springer-Verlag.
David H. D. Warren. The extended andorra model with implicit control. ICLP90 Preconference Workshop, June 1990.
David H. D. Warren and Peter Szeredi, editors. Proceedings of the Seventh International Conference on Logic Programming, Jerusalem, 1990. The MIT Press.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abreu, S., Pereira, L.M. (1994). Design for AKL with intelligent pruning. In: Dyckhoff, R. (eds) Extensions of Logic Programming. ELP 1993. Lecture Notes in Computer Science, vol 798. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58025-5_46
Download citation
DOI: https://doi.org/10.1007/3-540-58025-5_46
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58025-6
Online ISBN: 978-3-540-48417-2
eBook Packages: Springer Book Archive