Tabling with Support for Relational Features in a Deductive Database

Tabling has been acknowledged as a useful technique in the logic programming arena for enhancing both performance and declarative properties of programs. As well, deductive database implementations benefit from this technique for implementing query solving engines. In this paper, we show how unusual operations in deductive systems can be integrated with tabling.Such operations come from relational database systems in the form of null-related (outer) joins, duplicate support and duplicate elimination. The proposal has been implemented as a proof of concept rather than an efficient system in the Datalog Educational System (DES) using Prolog as a development language and its dynamic database

Online Resources for Identifying Evidence-Based, Out-of-School Time Programs: A User's Guide

Summarizes general information, select program outcomes, and evidence levels of searchable databases, interactive summaries, and documents online on evidence-based intervention programs. Outlines considerations and assessments for selecting programs

State-of-the-art on evolution and reactivity

This report starts by, in Chapter 1, outlining aspects of querying and updating resources on the Web and on the Semantic Web, including the development of query and update languages to be carried out within the Rewerse project. From this outline, it becomes clear that several existing research areas and topics are of interest for this work in Rewerse. In the remainder of this report we further present state of the art surveys in a selection of such areas and topics. More precisely: in Chapter 2 we give an overview of logics for reasoning about state change and updates; Chapter 3 is devoted to briefly describing existing update languages for the Web, and also for updating logic programs; in Chapter 4 event-condition-action rules, both in the context of active database systems and in the context of semistructured data, are surveyed; in Chapter 5 we give an overview of some relevant rule-based agents frameworks

Upside-down Deduction

Over the recent years, several proposals were made to enhance database systems with automated reasoning. In this article we analyze two such enhancements based on meta-interpretation. We consider on the one hand the theorem prover Satchmo, on the other hand the Alexander and Magic Set methods. Although they achieve different goals and are based on distinct reasoning paradigms, Satchmo and the Alexander or Magic Set methods can be similarly described by upside-down meta-interpreters, i.e., meta-interpreters implementing one reasoning principle in terms of the other. Upside-down meta-interpretation gives rise to simple and efficient implementations, but has not been investigated in the past. This article is devoted to studying this technique. We show that it permits one to inherit a search strategy from an inference engine, instead of implementing it, and to combine bottom-up and top-down reasoning. These properties yield an explanation for the efficiency of Satchmo and a justification for the unconventional approach to top-down reasoning of the Alexander and Magic Set methods

Dental Professionals in Non-Dental Settings

This report focuses on nine oral health innovations seeking to increase access to preventive oral health care in nondental settings. Two additional reports in this series describe the remaining programs that provide care in dental settings and care to young children. The nine innovations described here integrate service delivery and workforce models in order to reduce or eliminate socioeconomic, geographic, and cultural barriers to care. Although the programs are diverse in their approaches as well as in the specific characteristics of the communities they serve, a common factor among them is the implementation of multiple strategies to increase the number of children from low-income families who access preventive care, and also to engage families and communities in investing in and prioritizing oral health. For low-income children and their families, the barriers that must be addressed to increase access to preventive oral health care are numerous. For example, even children covered by public insurance programs face a shortage of dentists that accept Medicaid and who specialize in pediatric dentistry. The effects of poverty intersect with other barriers such as living in remote geographic areas and having a community-wide history of poor access to dental care in populations such as recent immigrants. Overcoming these barriers requires creative strategies that address transportation barriers, establish welcoming environments for oral health care, and are linguistically and culturally relevant. Each of these nine programs is based on such strategies, including:-Expanding the dental workforce through training new types of providers or adding new providers to the workforce toincrease reach and community presence;-Implementing new strategies to increase the cost-effectiveness of care so that more oral health care services are available and accessible;-Providing training and technical assistance that increase opportunities for and competence in delivering oral health education and care to children;-Offering oral health care services in existing, familiar community venues such as schools, Head Start programs and senior centers;-Developing creative service delivery models that address transportation and cultural barriers as well as the fear and stigma associated with dental care that may arise in communities with historically poor access.The findings from the EAs of these programs are synthesized to highlight diverse and innovative strategies for overcoming barriers to access. These strategies have potential for rigorous evaluation and could emerge as best practices. If proven effective, these innovative program elements could then be disseminated and replicated to increase access for populations in need of preventive oral health care

Logic Programming Applications: What Are the Abstractions and Implementations?

This article presents an overview of applications of logic programming, classifying them based on the abstractions and implementations of logic languages that support the applications. The three key abstractions are join, recursion, and constraint. Their essential implementations are for-loops, fixed points, and backtracking, respectively. The corresponding kinds of applications are database queries, inductive analysis, and combinatorial search, respectively. We also discuss language extensions and programming paradigms, summarize example application problems by application areas, and touch on example systems that support variants of the abstractions with different implementations

A Generic Module System forWeb Rule Languages: Divide and Rule

An essential feature in practically usable programming languages is the ability to encapsulate functionality in reusable modules. Modules make large scale projects tractable by humans. For Web and Semantic Web programming, many rule-based languages, e.g. XSLT, CSS, Xcerpt, SWRL, SPARQL, and RIF Core, have evolved or are currently evolving. Rules are easy to comprehend and specify, even for non-technical users, e.g. business managers, hence easing the contributions to the Web. Unfortunately, those contributions are arguably doomed to exist in isolation as most rule languages are conceived without modularity, hence without an easy mechanism for integration and reuse. In this paper a generic module system applicable to many rule languages is presented. We demonstrate and apply our generic module system to a Datalog-like rule language, close in spirit to RIF Core. The language is gently introduced along the EU-Rent use case. Using the Reuseware Composition Framework, the module system for a concrete language can be achieved almost for free, if it adheres to the formal notions introduced in this paper

On the practicality of global flow analysis of logic programs

This paper addresses the issue of the practicality of global flow analysis in logic program compilation, in terms of both speed and precision of analysis. It discusses design and implementation aspects of two practical abstract interpretation-based flow analysis systems: MA3, the MOO Andparallel Analyzer and Annotator; and Ms, an experimental mode inference system developed for SB-Prolog. The paper also provides performance data obtained from these implementations. Based on these results, it is concluded that the overhead of global flow analysis is not prohibitive, while the results of analysis can be quite precise and useful