Practical Methods for Proving Termination of General Logic Programs. Abstract: Termination of logic programs with negated body atoms (here called general logic programs) is an important topic. One reason is that many computational mechanisms used to process negated atoms, like Clark's negation as failure and Chan's constructive negation, are based on termination conditions. This paper introduces a methodology for proving termination of general logic programs w. The idea is to distinguish parts of the program depending on whether or not their termination depends on the selection rule. To this end, the notions of low- , weakly up- , and up- acceptable program are introduced. We use these notions to develop a methodology for proving termination of general logic programs, and show how interesting problems in non- monotonic reasoning can be formalized and implemented by means of terminating general logic programs. Abstract: We propose a modular method for proving termination of general logic programs (i.e., logic programs with negation). It is based on the notion of acceptable programs, but it allows us to prove termination in a truly. Termination Prediction for General Logic Programs Yi-Dong Shen State Key Laboratory of Computer Science, Institute of Software Chinese Academy of Sciences, Beijing 100190, China E. The Well-Founded Semantics for General Logic Programs ALLEN VAN GELDER University of California at Santa Cruz, Santa Cruz, Cahyornia KENNETH A. ROSS Stanford University, Stanford, Cal~ornia AND JOHN S. SCHLIPF University of. CiteSeerX - Scientific documents that cite the following paper: Programming by combining general logic programs. Unfounded sets and well-founded semantics for general logic programs,10.1145/308386.308444,Allen Van Gelder,Kenneth A. General logic programs. Jump to: navigation, search. Researchers using keyword general logic programs. Papers using keyword general logic programs. Title Authors Year Venue PR Cited By A Temporal Access Control. Termination Analysis of General Logic Programs for Moded Queries: A Dynamic Approach: Termination analysis of logic programs using acceptability with general term orders. The early works of Plotkin, and his 'relative least general generalization (rlgg)', had an. CiteSeerX - Scientific documents that cite the following paper: Negation as Failure Using Tight Derivations for General Logic Programs. The notions of acyclicity and acceptability fail to characterize termination of general logic programs adequately under sldnf-resolution, as termination due to floundering is not captured. In this paper we establish the.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. Archives
January 2017
Categories |