scholarly journals A General Framework for Static Cost Analysis of Parallel Logic Programs

2020 ◽  
pp. 19-35
Author(s):  
Maximiliano Klemen ◽  
Pedro López-García ◽  
John P. Gallagher ◽  
José F. Morales ◽  
Manuel V. Hermenegildo
Keyword(s):  
Cost Analysis ◽  
General Framework ◽  
Logic Programs

scholarly journals A General Framework for Automatic Termination Analysis of Logic Programs

2001 ◽  
Vol 12 (1-2) ◽  
pp. 117-156 ◽  
Author(s):  
Nachum Dershowitz ◽  
Naomi Lindenstrauss ◽  
Yehoshua Sagiv ◽  
Alexander Serebrenik
Keyword(s):  
General Framework ◽  
Logic Programs ◽  
Termination Analysis

Cost analysis of logic programs

1993 ◽  
Vol 15 (5) ◽  
pp. 826-875 ◽  
Author(s):  
Saumya K. Debray ◽  
Nai-Wei Lin
Keyword(s):  
Cost Analysis ◽  
Logic Programs

scholarly journals A general framework for equivalences in Answer-Set Programming by countermodels in the logic of Here-and-There

2011 ◽  
Vol 11 (2-3) ◽  
pp. 171-202 ◽  
Author(s):  
MICHAEL FINK
Keyword(s):  
General Framework ◽  
Answer Set Programming ◽  
Program Optimization ◽  
Logic Programs ◽  
Infinite Domains ◽  
General Semantics ◽  
Answer Set Semantics ◽  
Selection Of ◽  
Answer Set

AbstractDifferent notions of equivalence, such as the prominent notions of strong and uniform equivalence, have been studied in Answer-Set Programming, mainly for the purpose of identifying programs that can serve as substitutes without altering the semantics, for instance in program optimization. Such semantic comparisons are usually characterized by various selections of models in the logic of Here-and-There (HT). For uniform equivalence however, correct characterizations in terms of HT-models can only be obtained for finite theories, respectively programs. In this paper, we show that a selection of countermodels in HT captures uniform equivalence also for infinite theories. This result is turned into coherent characterizations of the different notions of equivalence by countermodels, as well as by a mixture of HT-models and countermodels (so-called equivalence interpretations). Moreover, we generalize the so-called notion of relativized hyperequivalence for programs to propositional theories, and apply the same methodology in order to obtain a semantic characterization which is amenable to infinite settings. This allows for a lifting of the results to first-order theories under a very general semantics given in terms of a quantified version of HT. We thus obtain a general framework for the study of various notions of equivalence for theories under answer-set semantics. Moreover, we prove an expedient property that allows for a simplified treatment of extended signatures, and provide further results for non-ground logic programs. In particular, uniform equivalence coincides under open and ordinary answer-set semantics, and for finite non-ground programs under these semantics, also the usual characterization of uniform equivalence in terms of maximal and total HT-models of the grounding is correct, even for infinite domains, when corresponding ground programs are infinite.

DEFINITION AND ADAPTATION OF WEIGHTED FUZZY LOGIC PROGRAMS

2009 ◽  
Vol 17 (01) ◽  
pp. 85-135 ◽  
Author(s):  
ALEXANDROS CHORTARAS ◽  
GIORGOS STAMOU ◽  
ANDREAS STAFYLOPATIS
Keyword(s):  
Fuzzy Logic ◽  
Logic Programming ◽  
General Framework ◽  
Logic Program ◽  
Logic Programs ◽  
Truth Value ◽  
The Individual ◽  
Logic Rule

Fuzzy logic programming has been lately used as a general framework for representing and handling imprecise knowledge. In this paper, we define the syntax and the semantics of definite weighted fuzzy logic programs, which extend definite fuzzy logic programs by allowing the inclusion of different significance weights in the individual atoms that make up the antecedent of a fuzzy logic rule. The weights add expressiveness to a fuzzy logic program and allow the determination of the level up to which an atom in the antecedent of a rule may affect the truth value of its consequent. In describing the semantics of definite weighted fuzzy logic programs we introduce the notion of the generalized weighted fuzzy conjunction operator, which can be regarded as a weighted t-norm based aggregation. We determine the properties of generalized weighted fuzzy conjunction operators and provide several examples. A methodology for constructing generalized weighted fuzzy conjunction operators using generator functions of existing t-norms is also introduced. Finally, a method for setting up a parametric weighted fuzzy logic program and automatically adapting the weights of its rules using a numerical dataset is developed.

A general framework for semantics-based bottom-up abstract interpretation of logic programs

1993 ◽  
Vol 15 (1) ◽  
pp. 133-181 ◽  
Author(s):  
Roberto Barbuti ◽  
Roberto Giacobazzi ◽  
Giorgio Levi
Keyword(s):  
General Framework ◽  
Abstract Interpretation ◽  
Logic Programs ◽  
Bottom Up

scholarly journals On the interaction between sharing and linearity

2009 ◽  
Vol 10 (1) ◽  
pp. 49-112 ◽  
Author(s):  
GIANLUCA AMATO ◽  
FRANCESCA SCOZZARI
Keyword(s):  
General Framework ◽  
Logic Programs ◽  
Infinite Domain ◽  
Abstract Domains ◽  
The Moment ◽  
Unification Algorithms

AbstractIn the analysis of logic programs, abstract domains for detecting sharing and linearity information are widely used. Devising abstract unification algorithms for such domains has proved to be rather hard. At the moment, the available algorithms are correct but not optimal; i.e., they cannot fully exploit the information conveyed by the abstract domains. In this paper, we define a new (infinite) domainShLinωwhich can be thought of as a general framework from which other domains can be easily derived by abstraction.ShLinωmakes the interaction between sharing and linearity explicit. We provide a constructive characterization of the optimal abstract unification operator onShLinω, and we lift it to two well-known abstractions ofShLinω, namely, to the classicalSharing×Linabstract domain and to the more preciseShLin2abstract domain by Andy King. In the case of single-binding substitutions, we obtain optimal abstract unification algorithms for such domains.

scholarly journals PROBABILISTIC COST ANALYSIS OF LOGIC PROGRAMS

2009 ◽  
Vol 17 (2) ◽  
Author(s):  
Héctor Juan Soza Pollman
Keyword(s):  
Cost Analysis ◽  
Logic Programs

scholarly journals Functional answer set programming

2011 ◽  
Vol 11 (2-3) ◽  
pp. 203-233 ◽  
Author(s):  
PEDRO CABALAR
Keyword(s):  
General Framework ◽  
Answer Set Programming ◽  
Direct Connection ◽  
Logic Programs ◽  
Safety Condition ◽  
Normal Logic ◽  
Answer Set

AbstractIn this paper we propose an extension of Answer Set Programming (ASP) to deal with (possibly partial) evaluable functions. To this aim, we start from the most general logical counterpart of ASP, Quantified Equilibrium Logic (QEL), and propose a variant QEL=ℱwhere the set of functions is partitioned into Herbrand functions (orconstructors) and evaluable functions (oroperations). We show how this extension has a direct connection to Scott'sLogic of Existence, and introduce several useful derived operators, some of them directly borrowed from Scott's formalisation. Using this general framework for arbitrary theories, we proceed to focus on a syntactic subclass that corresponds to normal logic programs with evaluable functions and equality. We provide a translation of this class into function-free normal programs and consider a safety condition so that the resulting program is also safe, under the usual meaning in ASP. Finally, we also establish a formal comparison to Lin and Wang's approach (FASP) dealing with evaluable total functions.

Cost Analysis: A Methodological Statement

1989 ◽  
Vol 7 (1) ◽  
pp. 27-41 ◽  
Author(s):  
Norman Keith Womer
Keyword(s):  
Cost Analysis
Sign in / Sign up

Export Citation Format

Share Document