In logic programs the argument sizes of derivable facts w.r.t. an n-ary predicate are viewed as a set of points in Rn, which are approximated by their convex hull. Interargument constraint w.r.t. a predicate is essentially a set of constraints that every derivable fact of the predicate satisfies. We formalize such constraints by a fixpoint of recursive transformation similar to immediate consequence operator. However, the transformation does not necessarily converge finitely. Approximating polycones to their affine hulls provides useful interargument constraints in many practical programs, guaranteeing finite convergence. For a class of linear recursive logic programs satisfying translativeness property, precise interargument constraints can be obtained by an analysis of structures of recursive transformations.

predictive search (APS) is a new method by which systems can improve their search performance through experience. It is believed that the development of such methods is critical, as currently a tremendous number of computational results are potentially wasted by not integrating search and partial search results into the knowledge of a problem-solving system. In the APS model, pattern formation and associative recall are used to improve or replace search. In this paper, the theory, background, and motivations behind the model are presented and its application to two-player game-playing programs is discussed. In these programs, the system develops a knowledge base of patterns (boolean features) coupled with weights and, using pattern-oriented evaluation, performs only 1-ply search, yet competes respectably with programs that search more. The learning mechanism is a hybrid of machine learning and artificial intelligence techniques that have been successful in other settings. Specific examples and performance results are taken from the domains of Hexapawn, Tic-Tac-Toe, Pente, Othello, and chess.

Article Free Access Share on Termination detection in logic programs using argument sizes (extended abstract) Authors: Kirack Sohn University of California, Santa Gruz University of California, Santa GruzView Profile , Allen Van Gelder University of California, Santa Gruz University of California, Santa GruzView Profile Authors Info & Claims PODS '91: Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systemsApril 1991 Pages 216–226https://doi.org/10.1145/113413.113433Published:01 April 1991Publication History 62citation272DownloadsMetricsTotal Citations62Total Downloads272Last 12 Months16Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF