Bounded Nondeterminism of Logic Programs

Pedreschi, Dino; Ruggieri, Salvatore

doi:10.1023/b:amai.0000038175.53999.3a

Cited by 4 publications

(11 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If the upper bound is known, then we can syntactically transform P and Q into an equivalent program and query that strongly terminate. As shown by Pedreschi & Ruggieri [58], such an upper bound is related to the natural number k of Def. 9.3 of bounded queries.…”

Section: From Bounded Nondeterminism To Strong Terminationmentioning

confidence: 82%

“…Pedreschi & Ruggieri [58] propose the notion of bounded nondeterminism to model programs and queries with finitely many refutations. Definition 9.2.…”

Section: Operational Definitionmentioning

confidence: 99%

“…Approaches to the automatic inference of level mappings and models are briefly recalled in the next section. Pedreschi & Ruggieri [58] give an example showing how the approach of Decorte et al [29] could be rephrased to infer boundedness.…”

Section: From Bounded Nondeterminism To Strong Terminationmentioning

confidence: 99%

“…Namely, there is the class of programs for which there are only finitely many successful derivations (although there could also be infinite derivations). We say that these programs have bounded nondeterminism, a notion studied by Pedreschi & Ruggieri [58]. Such programs can be transformed into equivalent programs which strongly terminate, as indicated in the figure and stated in Theorem 10.11.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Characterisations of Termination in Logic Programming

Pedreschi

Ruggieri

Smaus

2004

Program Development in Computational Logic

Self Cite

View full text Add to dashboard Cite

Abstract. 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 sufficient, and in most cases even necessary, declarative characterisation for determining that a program is in that class. By unifying different formalisms and making appropriate assumptions, we are able to establish a formal hierarchy between the different classes and their respective declarative characterisations.

show abstract

Section: From Bounded Nondeterminism To Strong Terminationmentioning

confidence: 82%

“…Pedreschi & Ruggieri [58] propose the notion of bounded nondeterminism to model programs and queries with finitely many refutations. Definition 9.2.…”

Section: Operational Definitionmentioning

confidence: 99%

Section: From Bounded Nondeterminism To Strong Terminationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Characterisations of Termination in Logic Programming

Pedreschi

Ruggieri

Smaus

2004

Program Development in Computational Logic

Self Cite

View full text Add to dashboard Cite

show abstract

“…Finally, we mention some recent works on termination of logic programs via alternative strategies, including fair selection rules [Gori 2000;Ruggieri 2001], input-consuming derivations [Smaus 1999;Bossi et al 2001], bounded nondeterminism [Pedreschi and Ruggieri 1999], dynamic selection rules [Martin and King 1997;Marchiori and Teusink 1999]. A survey of such classes can be found in Pedreschi et al [2002].…”

Section: Characterizations Of Left Termination Of Logic Programsmentioning

confidence: 99%

On proving left termination of constraint logic programs

Mesnard

Ruggieri

2003

ACM Trans. Comput. Logic

Self Cite

View full text Add to dashboard Cite

The Constraint Logic Programming (CLP) Scheme merges logic programming with constraint solving over predefined domains. In this article, 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 well suited 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

show abstract

ChoiceGAPs: Competitive Diffusion as a Massive Multi-player Game in Social Networks

Serra

Spezzano

Subrahmanian

2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

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 Saccà 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 multi-player 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 multi-player Nash equilibrium for such programs -but because they require some conditions that are hard to satisfy in the real world, we introduce a new model-theoretic 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 real-world 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.

show abstract

Bounded Nondeterminism of Logic Programs

Cited by 4 publications

References 28 publications

Characterisations of Termination in Logic Programming

Characterisations of Termination in Logic Programming

On proving left termination of constraint logic programs

ChoiceGAPs: Competitive Diffusion as a Massive Multi-player Game in Social Networks

Contact Info

Product

Resources

About