Arrow Research search

Author name cluster

Jack Minker

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

12 papers
2 author rows

Possible papers

12

LPAR Conference 1992 Conference Paper

Disjunctive Deductive Databases

  • José Alberto Fernández
  • Jack Minker

Abstract Background material is presented on deductive and normal deductive databases. A historical review is presented of work in disjunctive deductive databases, starting from 1982. The semantics of alternative classes of disjunctive databases is reviewed with their model and fixpoint characterizations. Algorithms are developed to compute answers to queries in the alternative theories using the concept of a model tree. Open problems in this area are discussed.

Details

TCS Journal 1991 Journal Article

Semantics of Horn and disjunctive logic programs

  • Jorge Lobo
  • Arcot Rajasekar
  • Jack Minker

Van Emden and Kowalski proposed a fixpoint semantics based on model-theory and an operational semantics based on proof-theory for Horn logic programs. They prove the equivalence of these semantics using fixpoint techniques. The main goal of this paper is to present a unified theory for the semantics of Horn and disjunctive logic programs. For this, we extend the fixpoint semantics and the operational or procedural semantics to the class of disjunctive logic programs and prove their equivalence using techniques similar to the ones used for Horn programs.

Details DOI

KER Journal 1989 Journal Article

Deductive database theories

  • John Grant
  • Jack Minker

Abstract This paper surveys a variety of deductive database theories. Such theories differ from one another in the set of axioms and metarules that they allow and use. The following theories are discussed: relational, Horn, and stratified in the text; protected, disjunctive, typed, extended Horn, and normal in the appendix. Connections with programming in terms of the declarative, fixpoint, and procedural semantics are explained. Negation is treated in several different ways: closed world, completed database, and negation as failure. For each theory examples are given and implementation issues are considered.

Details DOI

AAAI Conference 1986 Conference Paper

A Parallel Self-Modifying Default Reasoning System

  • Jack Minker

As a step in our efforts toward the study of real-time monitoring of the inferential process in reasoning systems, we have devised a method of representing knowledge for the purpose of default reasoning. A meta-level implementation that permits effective monitoring of the deductive process as it proceeds, providing information on the state of the answer procurement process, has been developed on the Parallel Inference System (PRISM) at the University of Maryland. Also described is an implementation in PRO- LOG (and to be incorporated in the above) of a learning feature used to calculate, for purposes of issuing default answers, the current depth of inference for a query from that obtained from similar queries posed earlier.

PDF Details

AIJ Journal 1986 Journal Article

Completeness results for circumscription

  • Donald Perlis
  • Jack Minker

We investigate the model theory of the notion of circumscription, and find completeness theorems that provide a partial converse to a result of McCarthy. We show that the circumscriptive theorems are precisely the truths of the minimal models, in the case of various classes of theories, and for various versions of circumscription. We also present an example of commonsense reasoning in which first-order circumscription does not achieve the intuitive and desired minimization.

Details DOI

TCS Journal 1985 Journal Article

Inferences for numerical dependencies

  • John Grant
  • Jack Minker

We introduce and motivate the study of numerical dependencies which are a generalization of functional dependencies. We prove that there does not exist a finite set of sound and complete inference rules for numerical dependencies in contrast to the case of functional dependencies. We also prove that nontrivial numerical dependencies which are not functional dependencies cannot be expressed by Horn formulas in first-order logic, and show some applications of numerical dependencies.

Details DOI