Practical Methods for Proving Termination of General Logic Programs
E. Marchiori
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.r.t. the Prolog selection rule. 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.
Create a lesson
Related papers
BEAKER: An Expert-Curated Benchmark for Embodied Brains in Self-Driving Chemical Laboratories
Fei Lin, Tengchao Zhang, Ziyang Gong et al.
FrontierPhysics: Evaluating Agents for End-to-End Physics Research
Bingran You, Wenjun Ke, Ria Rosenauer et al.
Dull, Dirty, Dangerous? Working Conditions and the Limits of Occupational AI Exposure
Siyi Yu
Learning to Decode Linear Codes with Generalized Belief Propagation Network
Samira Malek
On Turn-Level Best-of-N Sampling for Scaling LLM Agents
Jalaj Bhandari, Dhawal Gupta, Hongli Zhan et al.
CompressionBench: How can your coding agents compress LLMs?
Xinrui Zhong, Zhifeng Li, Zhiming Wang et al.