Efficient recursion termination for function-free horn logic

We present an efficient scheme to terminate infinite recursion in function-free Horn logic. In [BW84], Brough and Walker show that a preorder linear resolution with a goal termination strategy is incomplete, i.e. it must miss some answers. Their theory is true if left-recursion is allowed. The crucial assumption underlying Brough and Walker's theory is that the order of literals in a clause should not be altered. This assumption, however, is not necessary in programs that do not contain any extra-logical features such as the 'cut' symbol of Prolog. This is because the order of literals does not affect the correctness of such programs, only their efficiency. In this paper, we show that left-recursion can always be eliminated. The idea is to transform loops of the input set into safe loops, that are left-recursion free. Consequently, the goal termination strategy guarantees to always terminate properly with all possible answers; thus, it is complete in the domain of safe loops. We further show that all rules in a safe loop can be transformed into rules that begin with a base literal. This permits the implementation of a simple scheme to carry out the goal termination strategy more efficiently. The basic idea of this scheme is to distribute the history containing all executed goals over assertions, rather than maintaining it as a centralized data structure. This reduces the amount of work performed during execution

Performance analysis of a message-oriented knowledge-base

First-order Horn logic is a useful formalism to design knowledge-based systems. When implemented on a sequential von Neumann computer, the main limitation of such systems is performance. We present a message-driven model for function-free Horn logic, where the knowledge base is represented as a network of logical processing elements communicating with one another exclusively through messages. The lack of centralized control and centralized memory makes this model suitable to implementation on a highly-parallel asynchronous computer architecture.The primary contribution of this paper is a performance analysis of this message-driven system and a comparison with a sequential resolution scheme using backtracking. For both approaches, closed form expressions for the performance results are derived and compared

A unifying approach for queries and updates in deductive databases

This dissertation presents a unifying approach to process (recursive) queries and updates in a deductive database. To improve query performance, a combined top-down and bottom-up evaluation method is used to compile rules into iterative programs that contain relational algebra operators. This method is based on the lemma resolution that retains previous results to guarantee termination.Due to locality in database processing, it is desirable to materialize frequently used queries against views of the database. Unfortunately, if updates are allowed, maintaining materialized view tables becomes a major problem. We propose to materialize views incrementally, as queries are being answered. Hence views in our approach are only partially materialized. For such views, we design algorithms to perform updates only when the underlying view tables are actually affected.We compare our approach to two conventional methods for dealing with views: total materialization and query-modification. The first method materializes the entire view when it is defined while the second recomputes the view on the fly without maintaining any physical view tables. We demonstrate that our approach is a compromise between these two methods and performs better than either one in many situations.It is also desirable to be able to update views just like updating base tables. However, view updates are inherently ambiguous and the semantics of update propagation on recursively defined views were not well understood in the past. Using dynamic logic programming and lemma resolution, we are able to define the semantics of recursive view updates. These are expressed in the form of update translators specified by the database administrator when the view is defined. To guarantee completeness, we identify a subset of safe update translators. We prove that this subset of translators always terminate and are complete

A Collaborative B2E Based on A P2P Platform

Companies, large and small, are rapidly adopting Business-to-Employee (B2E) applications hoping to improve productivity of their work force. However, most B2E applications do not provide a good sense of community and lack of collaboration and interaction among its users. Consequently, employees are not motivated to fully utilize the contents and information provided by these applications. Peer-to-peer (P2P) computing is proven to be a good platform that provides and supports community by empowering users to collaborate and interact with one another. In this paper, we propose an approach to provide collaboration in B2E applications based on a P2P platform

Distributive Join Strategy Based on Tuple Inversion

In this paper, we propose a new direction for distributive join operations. We assume that there will be a scalable distributed computer system in which many computers (processors) are connected through a communication network that can be in a LAN or as part of the Internet with sufficient bandwidth. A relational database is then distributed across this network of processors. However, in our approach, the distribution of the database is very fine-grained and is based on the Distributed Hash Table (DHT) concept. A tuple of a table is assigned to a specific processor by using a fair hash function applied to its key value. For each joinable attribute, an inverted file list is further generated and distributed again based on the DHT. This pre-distribution is done when the tuple enters the system and therefore does not require any distribution of data tuples on the fly when the join is executed. When a join operation request is broadcast, each processor performs a local join and the results are sent back to a query processor which, in turn, merges the join results and returns them to the user. Note that the distribution of the DHT of the inverted file lists can be either pre-processed or distributed on the fly. If the lists are pre-processed and distributed, they have to be maintained. We evaluate our approach by comparing it empirically to two other approaches: the naive join method and the fully distributed join method. The results show a significantly higher performance of our method for a wide range of possible parameter

A Knowledge Assimilation Schema for Acquiring Technical Knowledge

It has always been a challenge for business students to acquire technical knowledge. Such challenges are more pronounced at urban minority universities where many returning students often have additional obstacles that prevent them from learning as traditional students do. In response to the situation, we have developed a learning tool, called the Knowledge Assimilation Schema (KAS), that guides students to focus on the development of their knowledge structures rather than the collection of isolated knowledge entities. The learning tool has two major components: a knowledge representation framework that facilitates structural understanding and a knowledge acquisition process that steers deeper learning. Initial feedback and results from KAS have shown a noticeable improvement in conceptual learning of technical subjects, especially among nontraditional students

Modulation of Ca2+-dependent anion secretion by protein kinase C in normal and cystic fibrosis pancreatic duct cells

AbstractThe study investigated the role of protein kinase C (PKC) in the modulation of agonist-induced Ca2+-dependent anion secretion by pancreatic duct cells. The short-circuit current (ISC) technique was used to examine the effect of PKC activation and inhibition on subsequent ATP, angiotensin II and ionomycin-activated anion secretion by normal (CAPAN-1) and cystic fibrosis (CFPAC-1) pancreatic duct cells. The ISC responses induced by the Ca2+-mobilizing agents, which had been previously shown to be attributed to anion secretion, were enhanced in both CAPAN-1 and CFPAC-1 cells by PKC inhibitors, staurosporine, calphostin C or chelerythrine. On the contrary, a PKC activator, phorbol 12-myristate 13-acetate (PMA), was found to suppress the agonist-induced ISC in CFPAC-1 cells and the ionomycin-induced ISC in CAPAN-1 cells. An inactive form of PMA, 4αd-phorbol 12,13-didecanote (4αD), was found to exert insignificant effect on the agonist-induced ISC, indicating a specific effect of PMA. Our data suggest a role of PKC in modulating agonist-induced Ca2+-dependent anion secretion by pancreatic duct cells. Therapeutic strategy to augment Ca2+-activated anion secretion by cystic fibrosis pancreatic duct cells may be achieved by inhibition or down-regulation of PKC

Assuring E-Commerce Business Activities

Trust is imperative for conducting online transactions. To reduce online risks and foster trust, assurance service providers, such as TRUSTe, BBBonline, and WebTrust, audit online businesses to assure their compliance with principles and criteria for e-commerce business activities. Of these assurance service providers, WebTrust offers the most comprehensive services, including programs for business to consumer and business to business transactions, certification authorities (CA) and service providers. WebTrust jointly developed by the American Institute of Certified Public Accountants (AICPA) and the Canadian Institute of Chartered Accountants (CICA) offers best practices and a framework of measurable controls for electronic businesses, and thus, fosters online trust and confidence that are critical to the success of electronic commerce. As e-commerce matures, WebTrust will play an increasingly important role in CA-based e-commerce as well as in the applications service provider industry