This paper describes a deductive approach to "region use" planning problems. The planning task is viewed as one of devising a complete set of policy rules by iteratively modifying the rules and making their deductive consequences readily available to the planner. The application of this approach to a National Park region zoning problem is also described. Central to the system are the representa...

Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show that two constants (falsity and implication) suffice for denotational and deductive completeness. Denotational completeness means that every value of the full set-theoretic type hierarchy can be described by a closed t...

A sound and complete view update procedure for a probabilistic deductive database is formulated using SLDp derivation trees introduced by Ng and Subrahmanian in 8]. In order to reduce the number of valid translations that can satisfy an update request a preference criteria is proposed. Moreover, we introduce a method called-factor to minimize the change eeected by updates in the database.

The aim of this paper is to introduce the notion of fantastic deductive systems on generalizations of fuzzy structures, and to emphasize their role in the probability theory on these algebras. We give a characterization of commutative pseudo-BE algebras and we generalize an axiom system consisting of four identities to the case of commutative pseudo-BE algebras. We define the fantastic deductiv...

Deductive database systems have made major advances on eecient support for nonmonotonic reasoning. A rst generation of deductive database systems supported the notion of stratiication for programs with negation and set aggregates. Stratiication is simple to understand and eecient to implement but it is too restrictive; therefore, a second generation of systems seeks eecient support for more pow...