Now showing items 1-9 of 9

    • A comparison of logical and physical parallel I/O patterns 

      Simitci, H.; Reed, D. A. (SAGE Publications Inc., 1998)
      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 ...
    • Correct-schema-guided synthesis of steadfast programs 

      Flener, P.; Lau, K. K.; Ornaghi, M. (IEEE Comp Soc, Los Alamitos, CA, United States, 1997)
      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 ...
    • A fundamental and theoretical framework for an intelligent CAD system 

      Akman, V.; Hagen, P. J. W. T.; Tomiyama, T. (Pergamon Press, 1990)
      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 ...
    • Generalised logic program transformation schemas 

      Büyükyıldız, H.; Flener, P. (Springer, 1998)
      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 ...
    • Induction of logical relations based on specific generalization of strings 

      Uzun, Y.; Cicekli I. (2007)
      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 ...
    • Inductive logic program synthesis with dialogs 

      Flener, P. (Springer, 1997)
      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 ...
    • Modeling interestingness of streaming classification rules as a classification problem 

      Aydın, T.; Güvenir, H. A. (Springer, 2006)
      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 ...
    • On correct program schemas 

      Flener, P.; Lau, K. K.; Ornaghi, M. (Springer Verlag, 1998)
      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 ...
    • Using criticalities as a heuristic for answer set programming 

      Sabuncu, O.; Alpaslan, F. N.; Akman, V. (Springer, 2004)
      Answer Set Programming is a new paradigm based on logic programming. The main component of answer set programming is a system that finds the answer sets of logic programs. During the computation of an answer set, systems ...