{"type":"ScholarlyArticle","title":"A Methodology for Proving Termination of General Logic Programs","authors":[{"name":"Elena Marchiori","slug":"elena-marchiori","given":"Elena","family":"Marchiori","affiliation":"CWI P.O. Box 94079 , 1090 GB Amsterdam , The Netherlands"}],"abstract":"This paper introduces a methodology for proving termination of general logic programs, when the Prolog selection rule is considered. This methodology combines the approaches by Apt and Bezem [1] and Apt and Pedreschi [2J, and provides a simple and flexible tool for proving termination .","doi":null,"url":"https://ijcai.org/proceedings/1995/47","pdf":"https://ijcai.org/proceedings/1995/0047.pdf","markdown":"https://ijcai.org/proceedings/1995/47.md","bibtex":"https://ijcai.org/proceedings/1995/bibtex/47","volume":{"slug":"1995","title":"Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1995","url":"https://ijcai.org/proceedings/1995/","year":1995,"location":"Montréal, Québec, Canada","dates":"","editors":"Chris S. Mellish","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automated Reasoning","track":"Automated Reasoning","number":47,"pages":{"first":356,"last":360},"keywords":[],"videos":[],"references":[{"position":1,"raw":"K. R. Apt, M. Bezem. Acyclic Programs. New Genera- tion Computing, Vol. 9, 335-363, 1991.","title":"Acyclic Programs","authors":"K R Apt, M Bezem","year":"1991","venue":"New Generation Computing","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"K. R. Apt, D. Pedreschi. Proving Termination of Gen- eral Prolog Programs. In Proc. TACS'91, LNCS 526, pp.265-289, 1991, Springer Verlag.","title":"Proving Termination of General Prolog Programs","authors":"K R Apt, D Pedreschi","year":"1991","venue":"Proc. TACS'91","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"K. R. Apt, D. Pedreschi. Modular Termination Proofs for Logic and Pure Prolog Programs. In G. Levi, editor, Advances in logic programming theory. Oxford Univer- sity Press, 1994.","title":"Modular Termination Proofs for Logic and Pure Prolog Programs","authors":"K R Apt, D Pedreschi","year":"1994","venue":"Advances in logic programming theory","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"D.Chan. Constructive Negation Based on the Com- pleted Database. In Proc. of the 5th Int. Conf. and Symp . on Logic Programming, pp. 111-125, 1988.","title":"Constructive Negation Based on the Completed Database","authors":"D Chan","year":"1988","venue":"Proc. of the 5th Int. Conf. and Symp . on Logic Programming","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"K.L. Clark. Negation as Failure. In H. Gallaire and J. Minker eds., Logic and Databases, pp. 293-322. Plenum Press, NY, 1978.","title":"Negation as Failure","authors":"K L Clark","year":"1978","venue":"Logic and Databases","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"N. Dershowitz. Termination of Rewriting. Journal of Symbolic Computation, 3, pp. 69-116, 1987.","title":"Termination of Rewriting","authors":"N Dershowitz","year":"1987","venue":"Journal of Symbolic Computation","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"D. De Schreye, S. Decorte. Termination of Logic Pro- grams: The Never-Ending Story. Journal of Logic Pro- gramming, 19,20, 1994.","title":"Termination of Logic Programs: The Never-Ending Story","authors":"D De Schreye, S Decorte","year":"1994","venue":"Journal of Logic Programming","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"C. Evans. Negation as Failure as an Approach to the Hanks and McDermott Problem. Proc. of the 2nd Int. Symp. on AI, pp. 23-27, 1990.","title":"Negation as Failure as an Approach to the Hanks and McDermott Problem","authors":"C Evans","year":"1990","venue":"Proc. of the 2nd Int. Symp. on AI","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"R. Kowalski, M. Sergot. A Logic Based Calculus of Events. New Generation Computing, 4, pp. 67-95, 1986.","title":"A Logic Based Calculus of Events","authors":"R Kowalski, M Sergot","year":"1986","venue":"New Generation Computing","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"E. Marchiori. On Termination of General Logic Pro- grams w.r.t. Constructive Negation. Journal of Logic Programming, 1995, to appear.","title":"On Termination of General Logic Programs w.r.t. Constructive Negation","authors":"E Marchiori","year":"1995","venue":"Journal of Logic Programming","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"N.J. Nilsson. Principles of Artificial Intelligence. Springer-Verlag, 1982.","title":"Principles of Artificial Intelligence","authors":"N J Nilsson","year":"1982","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"raw":"L. Sterling and E . Shapiro. The Art of Prolog. MIT Press, 1994. 2nd edition.","title":"The Art of Prolog","authors":"L Sterling, E Shapiro","year":"1994","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}