Minimal model generation has received great attention as people have deeper and deeper understanding in the semantics of the logic programming, deductive database, non monotonic reasoning and the relationships among them. But most proposed minimal model generation procedures in the literature are inappropriate in the sense that while generating minimal model, they also generate non-minimal mode...

The first part of this paper provides a comprehensive and self-contained account of the interrelationships between algebraic properties of varieties and properties of their free algebras and equational consequence relations. In particular, proofs are given of known equivalences between the amalgamation property and the Robinson property, the congruence extension property and the extension prope...

An early version of the Z Standard included the deductive system W for reasoning about Z specifications. Later versions contain a different deductive system. In this paper we sketch a proof that W is relatively sound with respect to this new deductive system. We do this by demonstrating a semantic basis for a correspondence between the two systems, then showing that each of the inference rules ...

We present the Hyper system that implements a new approach to knowledge compilation, where function-free rst-order Horn theories are transformed to propositional logic. The compilation method integrates techniques from deductive databases (relevance reasoning) and theory transformation via unfold/fold transformations, to obtain a compact propositional representation. The transformed theory is m...

We present the Hyper system that implements a new approach to knowledge compilation, where function-free rst-order acyclic Horn theories are transformed to propositional logic. The compilation method integrates techniques from deductive databases (relevance reasoning) and theory transformation via unfold/fold transformations, to obtain a compact propositional representation. The transformed the...

This paper highlights the limits of current implementations of SQL and shows how they can be overcome with deductive approaches. Deductive query languages subsuming relational ones must include constructors to allow users for submitting queries semantically equivalent to their relational counterparts. As deductive languages are based on first order predicate logic, they are able to capture rela...

This paper presents an experiment in the use of a deductive database system for computer network maintenance. There are relatively few practical applications of deductive databases. Takagi et.al. applied deductive databases to a practical problem. They utilized an indirect connectivity search capability of a deductive database system for a retrieval of complex con gurations in petrochemical pip...

We present the Hyper system that implements a new approach to knowledge compilation, where function-free rst-order acyclic Horn theories are transformed to propositional logic. The compilation method integrates techniques from deductive databases (relevance reasoning) and theory transformation via unfold/fold transformations, to obtain a compact propositional representation. The transformed the...

The promise of rule-based computing was to allow end users to create, modify, and maintain applications without the need to engage programmers. But experience has shown that rule sets often interact in subtle ways, making them difficult to understand and reason about. This has impeded the wide-spread adoption of rule-based computing. This paper describes the design and implementation of XcelLog...