Now showing items 1-9 of 9

    • Correct-schema-guided synthesis of steadfast programs 

      Flener, Pierre; Lau, K. K.; Ornaghi, M. (IEEE, 1997-11)
      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 ...
    • Generalised logic program transformation schemas 

      Büyükyıldız, Halime; Flener, Pierre (Springer, 1998-07)
      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 ...
    • Hypersolver: a graphical tool for commonsense set theory 

      Pakkan, M.; Akman, V. (Elsevier, 1995)
      This paper investigates an alternative set theory (due to Aczel) called the Hyperset Theory. Aczel uses a graphical representation for sets and thereby allows the representation of non-well-founded sets. A program, called ...
    • Inductive logic program synthesis with dialogs 

      Flener, Pierre (Springer, 1996-08)
      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 ...
    • Information-based approach to punctuation 

      Say, Bilge (AAAI, 1997-07)
      This thesis analyzes, in an information-based framework, the semantic and discourse aspects of punctuation, drawing computational implications for Natural Language Processing (NLP) systems. The Discourse Representation ...
    • Issues in commonsense set theory 

      Pakkan, M.; Akman, V. (Springer/Kluwer Academic Publishers, 1994)
      The success of set theory as a foundation for mathematics inspires its use in artificial intelligence, particularly in commonsense reasoning. In this survey, we briefly review classical set theory from an AI perspective, ...
    • On correct program schemas 

      Flener, Pierre; Lau, K. K.; Ornaghi, M. (Springer, Berlin, Heidelberg, 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 constrained intuitionistic linear logic for hybrid robotic planning problems 

      Saranlı, Uluç; Pfenning F. (IEEE, 2007)
      Synthesis of robot behaviors towards nontrivial goals often requires reasoning about both discrete and continuous aspects of the underlying domain. Existing approaches in building automated tools for such synthesis problems ...
    • V. Lifschitz, ed., formalizing common sense: papers by John McCarthy 

      Akman, V. (Elsevier BV, 1995)
      A review is presented of Lifschitz's collection of seventeen papers written by McCarthy on the subject of common sense. The book opens with a fine overview of McCarthy's research in artificial intelligence (AI). Lifschitz ...