A TOOL FOR REMOVING UNUSED ARGUMENTS FROM LOGIC PROGRAMS AUTOMATICALLY

2010 ◽  
Vol 19 (01) ◽  
pp. 39-63
Author(s):  
EMMANUIL MARAKAKIS ◽  
KOSTAS VASSILAKIS ◽  
NIKOS PAPADAKIS
Keyword(s):  
Program Transformation ◽  
Logic Program ◽  
The Other ◽  
Logic Programs ◽  
Design Decisions ◽  
Other Hand

This paper studies the problem of removing unused arguments from logic programs which have been constructed by a schema-based method. Our schema-based method constructs logic programs semi-automatically. These programs have clear structure which depicts the design decisions that have been taken for their construction. On the other hand, these programs have unused arguments. We propose a method that automatically removes the unused arguments from such programs. This method is based on fold-unfold transformations. We have developed a tool which implements our method and evaluates the initial and the transformed programs. This logic program transformation tool is presented as well.

scholarly journals Speedup of logic programs by binarization and partial deduction

2004 ◽  
Vol 4 (3) ◽  
pp. 355-369
Author(s):  
JAN HRŮZA ◽  
PETER šTĚPÁNEK
Keyword(s):  
Program Transformation ◽  
Logic Program ◽  
Logic Programs ◽  
Binary Logic ◽  
Partial Deduction ◽  
Binary Program ◽  
Binary Programs

Binary logic programs can be obtained from ordinary logic programs by a binarizing transformation. In most cases, binary programs obtained this way are less efficient than the original programs. (Demoen, 1992) showed an interesting example of a logic program whose computational behaviour was improved when it was transformed to a binary program and then specialized by partial deduction. The class of B-stratifiable logic programs is defined. It is shown that for every B-stratifiable logic program, binarization and subsequent partial deduction produce a binary program which does not contain variables for continuations introduced by binarization. Such programs usually have a better computational behaviour than the original ones. Both binarization and partial deduction can be easily automated. A comparison with other related approaches to program transformation is given.

scholarly journals The Difficulties of Learning Logic Programs with Cut

1993 ◽  
Vol 1 ◽  
pp. 91-107 ◽  
Author(s):  
F. Bergadano ◽  
D. Gunetti ◽  
U. Trinchero
Keyword(s):  
Evaluation Method ◽  
Learning Systems ◽  
The Other ◽  
Alternative Solution ◽  
Logic Programs ◽  
Effective Learning ◽  
Other Hand ◽  
Learning Procedure ◽  
Learning Programs ◽  
Reasonable Approach

As real logic programmers normally use cut (!), an effective learning procedure for logic programs should be able to deal with it. Because the cut predicate has only a procedural meaning, clauses containing cut cannot be learned using an extensional evaluation method, as is done in most learning systems. On the other hand, searching a space of possible programs (instead of a space of independent clauses) is unfeasible. An alternative solution is to generate first a candidate base program which covers the positive examples, and then make it consistent by inserting cut where appropriate. The problem of learning programs with cut has not been investigated before and this seems to be a natural and reasonable approach. We generalize this scheme and investigate the difficulties that arise. Some of the major shortcomings are actually caused, in general, by the need for intensional evaluation. As a conclusion, the analysis of this paper suggests, on precise and technical grounds, that learning cut is difficult, and current induction techniques should probably be restricted to purely declarative logic languages.

scholarly journals On the Equivalence between Assumption-Based Argumentation and Logic Programming

2017 ◽  
Vol 60 ◽  
pp. 779-825 ◽  
Author(s):  
Martin Caminada ◽  
Claudia Schulz
Keyword(s):  
Logic Programming ◽  
Logic Program ◽  
The Other ◽  
Logic Programs ◽  
Special Cases ◽  
Reverse Translation ◽  
Normal Logic ◽  
The Relationship

Assumption-Based Argumentation (ABA) has been shown to subsume various other non-monotonic reasoning formalisms, among them normal logic programming (LP). We re-examine the relationship between ABA and LP and show that normal LP also subsumes (flat) ABA. More precisely, we specify a procedure that given a (flat) ABA framework yields an associated logic program with almost the same syntax whose semantics coincide with those of the ABA framework. That is, the 3-valued stable (respectively well-founded, regular, 2-valued stable, and ideal) models of the associated logic program coincide with the complete (respectively grounded, preferred, stable, and ideal) assumption labellings and extensions of the ABA framework. Moreover, we show how our results on the translation from ABA to LP can be reapplied for a reverse translation from LP to ABA, and observe that some of the existing results in the literature are in fact special cases of our work. Overall, we show that (flat) ABA frameworks can be seen as normal logic programs with a slightly different syntax. This implies that methods developed for one of these formalisms can be equivalently applied to the other by simply modifying the syntax.

scholarly journals Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting

2019 ◽  
Vol 19 (5-6) ◽  
pp. 671-687 ◽  
Author(s):  
JORGE FANDINNO
Keyword(s):  
Modal Logic ◽  
Logic Programming ◽  
Epistemic Logic ◽  
The Other ◽  
Stable Model ◽  
Logic Programs ◽  
Splitting Property ◽  
Other Hand ◽  
The Many ◽  
Programming Semantics

AbstractIn a recent line of research, two familiar concepts from logic programming semantics (unfounded sets and splitting) were extrapolated to the case of epistemic logic programs. The property of epistemic splitting provides a natural and modular way to understand programs without epistemic cycles but, surprisingly, was only fulfilled by Gelfond’s original semantics (G91), among the many proposals in the literature. On the other hand, G91 may suffer from a kind of self-supported, unfounded derivations when epistemic cycles come into play. Recently, the absence of these derivations was also formalised as a property of epistemic semantics called foundedness. Moreover, a first semantics proved to satisfy foundedness was also proposed, the so-called Founded Autoepistemic Equilibrium Logic (FAEEL). In this paper, we prove that FAEEL also satisfies the epistemic splitting property something that, together with foundedness, was not fulfilled by any other approach up to date. To prove this result, we provide an alternative characterisation of FAEEL as a combination of G91 with a simpler logic we called Founded Epistemic Equilibrium Logic (FEEL), which is somehow an extrapolation of the stable model semantics to the modal logic S5.

CONCURRENT ABDUCTIVE LOGIC PROGRAMMING IN PANDORA

2001 ◽  
Vol 10 (03) ◽  
pp. 387-406
Author(s):  
REEM BAHGAT ◽  
OSAMA MOSTAFA ◽  
GEORGE A. PAPADOPOULOS
Keyword(s):  
Logic Programming ◽  
Logic Program ◽  
The Other ◽  
Logic Programs ◽  
Hypothetical Reasoning ◽  
Concurrent Logic Programming ◽  
Programming Technique ◽  
Abductive Logic ◽  
Abductive Logic Programming ◽  
Distributed Execution

The extension of logic programming with abduction (ALP) allows a form of hypothetical reasoning. The advantages of abduction lie in the ability to reason with incomplete information and the enhancement of the declarative representation of problems. On the other hand, concurrent logic programming is a framework which explores AND-parallelism and/or OR-parallelism in logic programs in order to efficiently execute them on multi-processor / distributed machines. The aim of our work is to study a way to model abduction within the framework of concurrent logic programming, thus taking advantage of the latter's potential for parallel and/or distributed execution. In particular, we describe Abductive Pandora, a syntactic sugar on top of the concurrent logic programming language Pandora, which provides the user with an abductive behavior for a concurrent logic program. Abductive Pandora programs are then transformed into Pandora programs which support the concurrent abductive behavior through a simple programming technique while at the same time taking advantage of the underlying Pandora machine infrastructure.

A study of cometary eruptions through OH radio-lines

1999 ◽  
Vol 173 ◽  
pp. 249-254
Author(s):  
A.M. Silva ◽  
R.D. Miró
Keyword(s):  
Short Duration ◽  
Growth Curves ◽  
The Other ◽  
Initial Mass ◽  
Radio Lines ◽  
Other Hand ◽  
Sudden Rise

AbstractWe have developed a model for theH2OandOHevolution in a comet outburst, assuming that together with the gas, a distribution of icy grains is ejected. With an initial mass of icy grains of 108kg released, theH2OandOHproductions are increased up to a factor two, and the growth curves change drastically in the first two days. The model is applied to eruptions detected in theOHradio monitorings and fits well with the slow variations in the flux. On the other hand, several events of short duration appear, consisting of a sudden rise ofOHflux, followed by a sudden decay on the second day. These apparent short bursts are frequently found as precursors of a more durable eruption. We suggest that both of them are part of a unique eruption, and that the sudden decay is due to collisions that de-excite theOHmaser, when it reaches the Cometopause region located at 1.35 × 105kmfrom the nucleus.

Closing the GAP—A 5Å Scanning Microscope

1969 ◽  
Vol 27 ◽  
pp. 6-7
Author(s):  
A. V. Crewe
Keyword(s):  
Normal Form ◽  
The Other ◽  
Resolving Power ◽  
Scanning Microscope ◽  
Conventional Microscope ◽  
Other Hand ◽  
Closing The Gap ◽  
Thermal Sources ◽  
Better Than ◽  
Transmission Microscope

We have become accustomed to differentiating between the scanning microscope and the conventional transmission microscope according to the resolving power which the two instruments offer. The conventional microscope is capable of a point resolution of a few angstroms and line resolutions of periodic objects of about 1Å. On the other hand, the scanning microscope, in its normal form, is not ordinarily capable of a point resolution better than 100Å. Upon examining reasons for the 100Å limitation, it becomes clear that this is based more on tradition than reason, and in particular, it is a condition imposed upon the microscope by adherence to thermal sources of electrons.

Life Beyond 1MeV

1980 ◽  
Vol 38 ◽  
pp. 30-33
Author(s):  
K.H. Westmacott
Keyword(s):  
Electron Microscopy ◽  
Past Experience ◽  
The Other ◽  
Good Case ◽  
Other Hand ◽  
The U.S

Life beyond 1MeV – like life after 40 – is not too different unless one takes advantage of past experience and is receptive to new opportunities. At first glance, the returns on performing electron microscopy at voltages greater than 1MeV diminish rather rapidly as the curves which describe the well-known advantages of HVEM often tend towards saturation. However, in a country with a significant HVEM capability, a good case can be made for investing in instruments with a range of maximum accelerating voltages. In this regard, the 1.5MeV KRATOS HVEM being installed in Berkeley will complement the other 650KeV, 1MeV, and 1.2MeV instruments currently operating in the U.S. One other consideration suggests that 1.5MeV is an optimum voltage machine – Its additional advantages may be purchased for not much more than a 1MeV instrument. On the other hand, the 3MeV HVEM's which seem to be operated at 2MeV maximum, are much more expensive.

Can the Academic Self-Concept be Positive and Realistic?

2005 ◽  
Vol 19 (3) ◽  
pp. 129-132 ◽  
Author(s):  
Reimer Kornmann
Keyword(s):  
Academic Performance ◽  
Opposite Effect ◽  
Self Esteem ◽  
Point Of View ◽  
The Other ◽  
Self Concept ◽  
High Ability ◽  
Self Image ◽  
Other Hand

Summary: My comment is basically restricted to the situation in which less-able students find themselves and refers only to literature in German. From this point of view I am basically able to confirm Marsh's results. It must, however, be said that with less-able pupils the opposite effect can be found: Levels of self-esteem in these pupils are raised, at least temporarily, by separate instruction, academic performance however drops; combined instruction, on the other hand, leads to improved academic performance, while levels of self-esteem drop. Apparently, the positive self-image of less-able pupils who receive separate instruction does not bring about the potential enhancement of academic performance one might expect from high-ability pupils receiving separate instruction. To resolve the dilemma, it is proposed that individual progress in learning be accentuated, and that comparisons with others be dispensed with. This fosters a self-image that can in equal measure be realistic and optimistic.

Stories and the Self

2020 ◽  
Vol 32 (2) ◽  
pp. 47-58 ◽  
Author(s):  
Stefan Krause ◽  
Markus Appel
Keyword(s):  
Meta Analysis ◽  
The Self ◽  
The Other ◽  
Lower Degree ◽  
Contrast Effects ◽  
Self Perception ◽  
Self Perceptions ◽  
Other Hand ◽  
The One ◽  
Implicit And Explicit

Abstract. Two experiments examined the influence of stories on recipients’ self-perceptions. Extending prior theory and research, our focus was on assimilation effects (i.e., changes in self-perception in line with a protagonist’s traits) as well as on contrast effects (i.e., changes in self-perception in contrast to a protagonist’s traits). In Experiment 1 ( N = 113), implicit and explicit conscientiousness were assessed after participants read a story about either a diligent or a negligent student. Moderation analyses showed that highly transported participants and participants with lower counterarguing scores assimilate the depicted traits of a story protagonist, as indicated by explicit, self-reported conscientiousness ratings. Participants, who were more critical toward a story (i.e., higher counterarguing) and with a lower degree of transportation, showed contrast effects. In Experiment 2 ( N = 103), we manipulated transportation and counterarguing, but we could not identify an effect on participants’ self-ascribed level of conscientiousness. A mini meta-analysis across both experiments revealed significant positive overall associations between transportation and counterarguing on the one hand and story-consistent self-reported conscientiousness on the other hand.

Sign in / Sign up

Export Citation Format

Share Document