Results 1 
6 of
6
On Proving Left Termination of Constraint Logic Programs
 ACM Transaction on Computational Logic
, 2001
"... The Constraint Logic Programming (CLP) Scheme merges logic programming with constraint solving over predefined domains. In this paper, we study proof methods for universal left termination of constraint logic programs. We provide a sound and complete characterization of left termination for ideal CL ..."
Abstract

Cited by 21 (8 self)
 Add to MetaCart
(Show Context)
The Constraint Logic Programming (CLP) Scheme merges logic programming with constraint solving over predefined domains. In this paper, we study proof methods for universal left termination of constraint logic programs. We provide a sound and complete characterization of left termination for ideal CLP languages which generalizes acceptability of logic programs. The characterization is then refined to the notion of partial acceptability, which is wellsuited for automatic modular inference. We describe a theoretical framework for automation of the approach, which is implemented. For nonideal CLP languages and without any assumption on their incomplete constraint solvers, even the most basic sound termination criterion from logic programming does not lift. We focus on a specific system, namely CLP(R), by proposing some additional conditions that make (partial) acceptability sound
Characterisations of Termination in Logic Programming
 Theoretical Computer Science
, 2001
"... The procedural interpretation of logic programs and queries is parametric to the selection rule, i.e. the rule that determines which atom is selected in each resolution step. Termination of logic programs and queries depends critically on the selection rule. In this survey, we present a unified ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
The procedural interpretation of logic programs and queries is parametric to the selection rule, i.e. the rule that determines which atom is selected in each resolution step. Termination of logic programs and queries depends critically on the selection rule. In this survey, we present a unified view and comparison of seven notions of universal termination considered in the literature, and the corresponding classes of programs. For each class, we focus on a su#cient, and in most cases even necessary, declarative characterisation for determining that a program is in that class. By unifying di#erent formalisms and making appropriate assumptions, we are able to establish a formal hierarchy between the di#erent classes and their respective declarative characterisations.
IOS Press Control Generation by Program Transformation
"... Abstract. The objective of control generation in logic programming is to derive a computation rule for a program that is efficient and yet does not compromise program correctness. Progress in solving this fundamental problem in logic programming has been slow and, to date, only partial solutions hav ..."
Abstract
 Add to MetaCart
Abstract. The objective of control generation in logic programming is to derive a computation rule for a program that is efficient and yet does not compromise program correctness. Progress in solving this fundamental problem in logic programming has been slow and, to date, only partial solutions have been proposed. Previously proposed schemes are either inefficient, incomplete (incorrect) or difficult to apply for programs consisting of many components (the scheme is not modular). This paper shows how the control generation problem can be tackled by program transformation. The transformation relies on information about the depths of derivations to derive delay declarations which orchestrate the control. To prove correctness of the transformation, the notion of semidelay recurrency is introduced, which generalises previous ideas in the termination literature for reasoning about logic programs with delay declarations. In contrast to previous work, semidelay recurrency does not require an atom to be completely resolved before another is selected for reduction. This enhancement permits the transformation to introduce control which is flexible and relatively efficient.
On Logic Programs That Always Succeed
"... We introduce a generalized definition of SLDresolution admitting restrictions on atom and/or clause selectability. Instances of these restrictions include delay declarations, inputconsuming unification and guarded clauses. In the context of such a generalization of SLDresolution, we offer a t ..."
Abstract
 Add to MetaCart
(Show Context)
We introduce a generalized definition of SLDresolution admitting restrictions on atom and/or clause selectability. Instances of these restrictions include delay declarations, inputconsuming unification and guarded clauses. In the context of such a generalization of SLDresolution, we offer a theoretical framework to reason about programs and queries such that all derivations are successful. We provide a characterization of those programs and queries which allows to reuse existing methods from the literature on termination and verification of Prolog programs.
ChoiceGAPs: Competitive Diffusion as a Massive MultiPlayer Game in Social Networks
"... We consider the problem of modeling competitive diffusion in real world social networks via the notion of ChoiceGAPs which combine choice logic programs due to Sacca ̀ and Zaniolo and Generalized Annotated Programs due to Kifer and Subrahmanian. We assume that each vertex in a social network is a pl ..."
Abstract
 Add to MetaCart
(Show Context)
We consider the problem of modeling competitive diffusion in real world social networks via the notion of ChoiceGAPs which combine choice logic programs due to Sacca ̀ and Zaniolo and Generalized Annotated Programs due to Kifer and Subrahmanian. We assume that each vertex in a social network is a player in a multiplayer game (with a huge number of players) — the choice part of the ChoiceGAPs describe utilities of players for acting in various ways based on utilities of their neighbors in those and other situations. We define multiplayer Nash equilibrium for such programs — but because they require some conditions that are hard to satisfy in the real world, we introduce a new modeltheoretic concept of strong equilibrium. We show that stable equilibria can capture all Nash equilibria. We prove a host of complexity (intractability) results for checking existence of strong equilibria (as well as related counting complexity results), together with algorithms to find them. We then identify a class of ChoiceGAPs for which stable equilibria can be polynomially computed. We develop algorithms for computing these equilibria under various restrictions. We come up with the important concept of an estimation query which can compute quantities w.r.t. a given strong equilibrium, and approximate ranges of values (answers) across the space of strong equilibria. Even though we show that computing range answers to estimation queries exactly is intractable, we are able to identify classes of estimation queries that can be answered in polynomial time. We report on experiments we conducted with a realworld FaceBook data set surrounding the 2013 Italian election showing that our algorithms have good predictive accuracy with an Area Under a ROC Curve that, on average, is over 0.76. NOTE: The paper is currently submitted to a journal suggesting parallel submission to the CoRR repository.