SWISH: SWI-Prolog for Sharing

Recently, we see a new type of interfaces for programmers based on web technology. For example, JSFiddle, IPython Notebook and R-studio. Web technology enables cloud-based solutions, embedding in tutorial web pages, atractive rendering of results, web-scale cooperative development, etc. This article describes SWISH, a web front-end for Prolog. A public website exposes SWI-Prolog using SWISH, which is used to run small Prolog programs for demonstration, experimentation and education. We connected SWISH to the ClioPatria semantic web toolkit, where it allows for collaborative development of programs and queries related to a dataset as well as performing maintenance tasks on the running server and we embedded SWISH in the Learn Prolog Now! online Prolog book.Comment: International Workshop on User-Oriented Logic Programming (IULP 2015), co-located with the 31st International Conference on Logic Programming (ICLP 2015), Proceedings of the International Workshop on User-Oriented Logic Programming (IULP 2015), Editors: Stefan Ellmauthaler and Claudia Schulz, pages 99-113, August 201

Executable specifications for Java programs

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.Cataloged from PDF version of thesis.Includes bibliographical references (p. 55-57).In this thesis, we present a unified environment for running declarative specifications in the context of an imperative object-oriented programming language. Specifications are Alloy-like, written in first-order relational logic with transitive closure, and the imperative language for this purpose is Java. By being able to mix imperative code with executable declarative specifications, the user can easily express constraint problems in-place, i.e. in terms of the existing data structures and objects on the heap. After a solution is found, our framework will automatically update the heap to reflect the solution, so the user can continue to manipulate the program heap in the usual imperative way, without ever having to manually translate the problem back and forth between the host programming environment and the solver language. We show that this approach is not only convenient, but, for certain problems, like puzzles or NP-complete graph algorithms, it can also outperform the manual implementation. We also present an optimization technique that allowed us to run our tool on heaps with almost 2000 objects.by Aleksandar Milicevic.S.M

The Relative Effects of Logistics, Coordination and Human Resource on Humanitarian Aid and Disaster Relief Mission Performance

Most studies on humanitarian aid and disaster relief (HADR) missions suggest that the quality of logistics, coordination and human resource management will affect their performance. However, studies in developing countries are mainly conceptual and lack the necessary empirical evidence to support these contentions. The current paper thereby aimed to fill this knowledge gap by statistically examining the effects of the abovementioned factors on such missions. Focusing on the Malaysian army due to its extensive experience in HADR operations, the paper opted for a quantitative approach to allow for a more objective analysis of the issues. The results show that there are other potential determinants of mission success which deserve due attention in future studies. They also suggest that human resource is not easily measured as a construct, and that this limitation in methodology must be overcome to derive more accurate conclusions regarding its effect on HADR mission performance.&nbsp

An assertion language for constraint logic programs

In an advanced program development environment, such as that discussed in the introduction of this book, several tools may coexist which handle both the program and information on the program in different ways. Also, these tools may interact among themselves and with the user. Thus, the different tools and the user need some way to communicate. It is our design principie that such communication be performed in terms of assertions. Assertions are syntactic objects which allow expressing properties of programs. Several assertion languages have been used in the past in different contexts, mainly related to program debugging. In this chapter we propose a general language of assertions which is used in different tools for validation and debugging of constraint logic programs in the context of the DiSCiPl project. The assertion language proposed is parametric w.r.t. the particular constraint domain and properties of interest being used in each different tool. The language proposed is quite general in that it poses few restrictions on the kind of properties which may be expressed. We believe the assertion language we propose is of practical relevance and appropriate for the different uses required in the tools considered

The PITA System: Tabling and Answer Subsumption for Reasoning under Uncertainty

Many real world domains require the representation of a measure of uncertainty. The most common such representation is probability, and the combination of probability with logic programs has given rise to the field of Probabilistic Logic Programming (PLP), leading to languages such as the Independent Choice Logic, Logic Programs with Annotated Disjunctions (LPADs), Problog, PRISM and others. These languages share a similar distribution semantics, and methods have been devised to translate programs between these languages. The complexity of computing the probability of queries to these general PLP programs is very high due to the need to combine the probabilities of explanations that may not be exclusive. As one alternative, the PRISM system reduces the complexity of query answering by restricting the form of programs it can evaluate. As an entirely different alternative, Possibilistic Logic Programs adopt a simpler metric of uncertainty than probability. Each of these approaches -- general PLP, restricted PLP, and Possibilistic Logic Programming -- can be useful in different domains depending on the form of uncertainty to be represented, on the form of programs needed to model problems, and on the scale of the problems to be solved. In this paper, we show how the PITA system, which originally supported the general PLP language of LPADs, can also efficiently support restricted PLP and Possibilistic Logic Programs. PITA relies on tabling with answer subsumption and consists of a transformation along with an API for library functions that interface with answer subsumption

Investigating the role of knowledge management in driving the development of an effective business process architecture

Business Process Architecture (BPA) modelling methods are not dynamic and flexible enough to effectively respond to changes. This may create a barrier that contributes to a lack of knowledge and learning capabilities which can affect the BPA regarding its support for a sustainable competitive advantage in an organisation. New business challenges are driving business enterprises to adopt Knowledge Management (KM) as one means of making a positive difference to their performance and competitiveness. However, shortcomings still remain in utilising knowledge management in business processes where efforts were mostly directed towards the integration of knowledge management with business process management but not including BPAs. The idea of applying KM as a memory to be timely retrieved and updated as needed is no longer sufficient. The resource-based view suggests a number of key factors to be investigated and taken into consideration during the development of knowledge management systems. These key factors are known as Knowledge Management Enablers (KMEs). KMEs are crucial for representing KM and understanding how knowledge is created, shared and disseminated. They are also essential to identify available assets and resources, and to clarify how organisational capabilities are created and utilised.This research is aimed at investigating the role of the knowledge management enablers in the development of an effective process architecture. An effective process architecture needs to be dynamic and supports a sustainable competitive advantage in an organisation. Identifying the KMEs, selecting an appropriate BPA method, aligning these KMEs with this method as well as undertaking a critical evaluation of this alignment are the main objectives set for this research. In order to accomplish the research aim and objectives, a resource-based and semantic-enriched framework, namely the KMEOntoBPA has been designed using KMEs to drive the process of BPA development. Organisational structure, culture, information technology, leadership, knowledge context and business repository have been selected as representatives of the KMEs. The object-based BPA modelling, specifically the semantically enriched Riva BPA (srBPA) method, has been adopted in order to embrace the knowledge resources generated by KMEs and utilise them in the derivation and re-configuration of its constitutional elements. These knowledge resources are employed as business objects. They are considered as Candidate Essential Business Entities (CEBEs) in the Riva method, that characterise or represent a form of business of an organisation. The Design Science Research Methodology (DSRM) is used to guide the research phases with an emphasis on the design and development, demonstration and evaluation of the research framework. The KMEOntoBPA has been demonstrated using sufficient and representative core banking case studies of the Treasury, Deposits and Financing. These case studies have been applied to the DSRM iterations beginning with the Treasury as the 1st case study, followed by the Deposits and the Financing case studies.The results have revealed that KMEs utilisation provides an agile generation of representative CEBEs and their corresponding Riva BPA elements, which reflect the real business in each of the core banking business studies. This research also demonstrated the semantic Riva BPA method as an appropriate object-based method that is well aligned with KMEs in exploiting knowledge resources for the development of a dynamic BPA with reference to robustness and learning capabilities. In addition to these results, the research framework, i.e, the KMEOntoBPA has shown an understanding of the flow of knowledge in the bank and has provided several possible advantages such as the accuracy of service delivery and the improvement of the financial control. It also supports the sources of sustainable competitive advantage (SCA): technical capabilities, core competences and social capital.Finally, a number of significant contributions and artefacts have been attained. For example, there is the aKMEOnt which is the abstract ontology that utilises six KMEs in this research to investigate the effectiveness of using such KMEs in driving the development of the BPA. These contributions along with the research results provide a guide to future research directions such as using the aKMEOnt in the development of different business process modelling and deriving the Enterprise Information Architecture (EIA) and Service Oriented Architecture (SOA)