Browsing by Subject "Logic programming"

Now showing 1 - 8 of 8

Open Access
A comparison of logical and physical parallel I/O patterns
(SAGE Publications Inc., 1998) Simitci, H.; Reed, D. A.
Although there are several extant studies of parallel scientific application request patterns, there is little experimental data on the correlation of physical I/O patterns with application I/O stimuli. To understand these correlations, the authors have instrumented the SCSI device drivers of the Intel Paragon OSF/1 operating system to record key physical I/O activities, and have correlated this data with the I/O patterns of scientific applications captured via the Pablo analysis toolkit. This analysis shows that disk hardware features profoundly affect the distribution of request delays and that current parallel file systems respond to parallel application I/O patterns in nonscalable ways.
Open Access
Correct-schema-guided synthesis of steadfast programs
(IEEE, 1997-11) Flener, Pierre; Lau, K. K.; Ornaghi, M.
It can be argued that for (semi-)automated software development, program schemas are indispensable, since they capture not only structured program design principles, but also domain knowledge, both of which are of crucial importance for hierarchical program synthesis. Most researchers represent schemas purely syntactically (as higher-order expressions). This means that the knowledge captured by a schema is not formalized. We take a semantic approach and show that a schema can be formalized as an open (first-order) logical theory that contains an open logic program. By using a special kind of correctness for open programs, called steadfastness, we can define and reason about the correctness of schemas. We also show how to use correct schemas to synthesize steadfast programs.
Open Access
A fundamental and theoretical framework for an intelligent CAD system
(Pergamon Press, 1990) Akman, V.; Hagen, P. J. W. T.; Tomiyama, T.
Currently, there exists a line of research in mechanical CAD that is directed towards using AI and knowledge engineering ideas, but truly unifying approaches in this respect are lacking. The authors hope to fill this gap via a logic-based, theoretical approach. A formulation is given for how a designer's apprentice (or a design workbench) can be established. The relevance of naive physics and commonsense reasoning in machine design are demonstrated. As for the software development methodology several aspects of software engineering are considered. A design base language which is built upon logic programming and object-oriented programming paradigm is proposed. © 1990.
Open Access
Generalised logic program transformation schemas
(Springer, 1998-07) Büyükyıldız, Halime; Flener, Pierre
Schema-based logic program transformation has proven to be an eective technique for the optimisation of programs. This paper results from the research that began by investigating the suggestions in [11] to construct a more general database of transformation schemas for optimising logic programs at the declarative level. The proposed transformation schemas fully automate accumulator introduction (also known as descending computational generalisation), tupling generalisation (a special case of structural generalisation), and duality laws (which are extensions to relational programming of the rst duality law of the fold operators in functional programming). The schemas are proven correct. A prototype schema-based transformation system is evaluated. © Springer-Verlag Berlin Heidelberg 1998.
Open Access
Induction of logical relations based on specific generalization of strings
(IEEE, 2007-11) Uzun, Yasin; Çiçekli, İlyas
Learning logical relations from examples expressed as first order facts has been studied extensively by the Inductive Logic Programming research. Learning with positive-only data may cause over generalization of examples leading to inconsistent resulting hypotheses. A learning heuristic inferring specific generalization of strings based on unique match sequences is shown to be capable of learning predicates with string arguments. This paper describes an inductive learner based on the idea of specific generalization of strings, and the given clauses are generalized by considering the background knowledge. ©2007 IEEE.
Open Access
Inductive logic program synthesis with dialogs
(Springer, 1996-08) Flener, Pierre
DIALOGS (Dialogue-based Inductive and Abductive LOGic program Synthesizer) is a schema-guided synthesizer of recursive logic programs; it takes the initiative and queries a (possibly computationally naive) specifier for evidence in her/his conceptual language. The specifier must know the answers to such simple queries, because otherwise s/he wouldn't even feel the need for the synthesized program. DIALOGS call be used by any learner (including itself) that detects, or merely conjectures, the necessity of invention of a new predicate. Due to its foundation on a powerful codification of a “recursion-theory” (by means of the template and constraints of a divide-and-conquer schema), DIALOGS needs very little evidence and is very fast. © Springer-Vertag Berlin Heidelberg 1997.
Open Access
Modeling interestingness of streaming classification rules as a classification problem
(Springer, 2005-06) Aydın, Tolga; Güvenir, Halil Altay
Inducing classification rules on domains from which information is gathered at regular periods lead the number of such classification rules to be generally so huge that selection of interesting ones among all discovered rules becomes an important task. At each period, using the newly gathered information from the domain, the new classification rules are induced. Therefore, these rules stream through time and are so called streaming classification rules. In this paper, an interactive classification rules' interestingness learning algorithm (ICRIL) is developed to automatically label the classification rules either as "interesting" or "uninteresting" with limited user interaction. In our study, VFFP (Voting Fuzzified Feature Projections), a feature projection based incremental classification algorithm, is also developed in the framework of ICRIL. The concept description learned by the VFFP is the interestingness concept of streaming classification rules. © Springer-Verlag Berlin Heidelberg 2006.
Open Access
On correct program schemas
(Springer, Berlin, Heidelberg, 1998) Flener, Pierre; Lau, K. K.; Ornaghi, M.
We present our work on the representation and correctness of program schemas, in the context of logic program synthesis. Whereas most researchers represent schemas purely syntactically as higher-order expressions, we shall express a schema as an open rst-order theory that axiomatises a problem domain, called a specication framework, containing an open program that represents the template of the schema. We will show that using our approach we can dene a meaningful notion of correctness for schemas, viz. that correct program schemas can be expressed as parametric specication frameworks containing templates that are steadfast, i.e. programs that are always correct provided their open relations are computed correctly. © Springer-Verlag Berlin Heidelberg 1998.