The Ecce and Logen Partial Evaluators and their Web Interfaces

We present Ecce and Logen, two partial evaluators for Prolog using the online and offline approach respectively. We briefly present the foundations of these tools and discuss various applications. We also present new implementations of these tools, carried out in Ciao Prolog. In addition to a command-line interface new user-friendly web interfaces were developed. These enable non-expert users to specialise logic programs using a web browser, without the need for a local installation

Homeomorphic Embedding for Online Termination of Symbolic Methods

Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure the termination of techniques for program analysis, specialisation, transformation, and verification. In this paper we survey and discuss this use of homeomorphic embedding and clarify the advantages of such an approach over one using well-founded orders. We also discuss various extensions of the homeomorphic embedding relation. We conclude with a study of homeomorphic embedding in the context of metaprogramming, presenting some new (positive and negative) results and open problems

Theorising and practitioners in HRD: the role of abductive reasoning

Purpose – The purpose of this paper is to argue that abductive reasoning is a typical but usually unrecognised process used by HRD scholars and practitioners alike. Design/methodology/approach – This is a conceptual paper that explores recent criticism of traditional views of theory-building, based on the privileging of scientific theorising, which has led to a relevance gap between scholars and practitioners. The work of Charles Sanders Peirce and the varieties of an abductive reasoning process are considered. Findings – Abductive reasoning, which precedes induction and deduction, provide a potential connection with HRD practitioners who face difficult problems. Two types of abductive reasoning are explored – existential and analogic. Both offer possibilities for theorising with HRD practitioners. A range of methods for allowing abduction to become more evident with practitioners are presented. The authors consider how abduction can be used in engaged and participative research strategies. Research limitations/implications – While this is a conceptual paper, it does suggest implications for engagement and participation in theorising with HRD practitioners. Practical implications – Abductive reasoning adds to the repertoire of HRD scholars and practitioners. Originality/value – The paper elucidates the value of abductive reasoning and points to how it can become an integral element of theory building in HRD

Design thinking support: information systems versus reasoning

Numerous attempts have been made to conceive and implement appropriate information systems to support architectural designers in their creative design thinking processes. These information systems aim at providing support in very diverse ways: enabling designers to make diverse kinds of visual representations of a design, enabling them to make complex calculations and simulations which take into account numerous relevant parameters in the design context, providing them with loads of information and knowledge from all over the world, and so forth. Notwithstanding the continued efforts to develop these information systems, they still fail to provide essential support in the core creative activities of architectural designers. In order to understand why an appropriately effective support from information systems is so hard to realize, we started to look into the nature of design thinking and on how reasoning processes are at play in this design thinking. This investigation suggests that creative designing rests on a cyclic combination of abductive, deductive and inductive reasoning processes. Because traditional information systems typically target only one of these reasoning processes at a time, this could explain the limited applicability and usefulness of these systems. As research in information technology is increasingly targeting the combination of these reasoning modes, improvements may be within reach for design thinking support by information systems

Towards an Intelligent Tutor for Mathematical Proofs

Computer-supported learning is an increasingly important form of study since it allows for independent learning and individualized instruction. In this paper, we discuss a novel approach to developing an intelligent tutoring system for teaching textbook-style mathematical proofs. We characterize the particularities of the domain and discuss common ITS design models. Our approach is motivated by phenomena found in a corpus of tutorial dialogs that were collected in a Wizard-of-Oz experiment. We show how an intelligent tutor for textbook-style mathematical proofs can be built on top of an adapted assertion-level proof assistant by reusing representations and proof search strategies originally developed for automated and interactive theorem proving. The resulting prototype was successfully evaluated on a corpus of tutorial dialogs and yields good results.Comment: In Proceedings THedu'11, arXiv:1202.453

Optimization Modulo Theories with Linear Rational Costs

In the contexts of automated reasoning (AR) and formal verification (FV), important decision problems are effectively encoded into Satisfiability Modulo Theories (SMT). In the last decade efficient SMT solvers have been developed for several theories of practical interest (e.g., linear arithmetic, arrays, bit-vectors). Surprisingly, little work has been done to extend SMT to deal with optimization problems; in particular, we are not aware of any previous work on SMT solvers able to produce solutions which minimize cost functions over arithmetical variables. This is unfortunate, since some problems of interest require this functionality. In the work described in this paper we start filling this gap. We present and discuss two general procedures for leveraging SMT to handle the minimization of linear rational cost functions, combining SMT with standard minimization techniques. We have implemented the procedures within the MathSAT SMT solver. Due to the absence of competitors in the AR, FV and SMT domains, we have experimentally evaluated our implementation against state-of-the-art tools for the domain of linear generalized disjunctive programming (LGDP), which is closest in spirit to our domain, on sets of problems which have been previously proposed as benchmarks for the latter tools. The results show that our tool is very competitive with, and often outperforms, these tools on these problems, clearly demonstrating the potential of the approach.Comment: Submitted on january 2014 to ACM Transactions on Computational Logic, currently under revision. arXiv admin note: text overlap with arXiv:1202.140