Publication:3939270
From MaRDI portal
zbMath0481.68087MaRDI QIDQ3939270
Publication date: 1982
68P20: Information storage and retrieval of data
Related Items
On the equivalence of the static and disjunctive well-founded semantics and its computation, Closed world assumption for disjunctive reasoning, Query evaluation in probabilistic relational databases, The semantics of incomplete databases as an expression of preferences, Enhancing disjunctive logic programming systems by SAT checkers, Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete, Closed world assumptions having precedence in predicates, Approximate well-founded semantics, query answering and generalized normal logic programs over lattices, The theory of interval probabilistic logic programs, Computing only minimal answers in disjunctive deductive databases, Negation as failure: careful closure procedure, Inferring negative information from disjunctive databases, On the relationship between circumscription and negation as failure, An algorithm to compute circumscription, Stratification and knowledge base management, Minimalism, justification and non-monotonicity in deductive databases, Reasoning with minimal models: efficient algorithms and applications, Semantics of Horn and disjunctive logic programs, Paraconsistent disjunctive deductive databases, An efficient method for eliminating varying predicates from a circumscription, On the complexity of propositional knowledge base revision, updates, and counterfactuals, Relating minimal models and pre-requisite-free normal defaults, Expressive power and complexity of partial models for disjunctive deductive databases, Interpreting disjunctive logic programs based on a strong sense of disjunction, First-order syntactic characterizations of minimal entailment, domain- minimal entailment, and Herbrand entailment, View updates in stratified disjunctive databases, The complexity of propositional closed world reasoning and circumscription, Formalizing incomplete knowledge in incomplete databases, A semantics for a class of non-deterministic and causal production system programs, Ordered model trees: A normal form for disjunctive deductive databases, An alternative approach to the semantics of disjunctive logic programs and deductive databases, Deontic logic as founded on nonmonotonic logic, Generalized disjunctive well-founded semantics for logic programs., On stratified disjunctive programs, Incomplete deductive databases, Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation, On computing minimal models, Polynomial-time computable stable models, Autoepistemic logic of knowledge and beliefs, Abduction from logic programs: Semantics and complexity, On compact representations of propositional circumscription, Is intractability of nonmonotonic reasoning a real drawback?, The complexity of belief update, Logic programming and knowledge representation---The A-Prolog perspective, Weak generalized closed world assumption, On the complexity of data disjunctions., Preprocessing of intractable problems, Jack Minker --- A profile, ECWA made easy, Static semantics for normal and disjunctive logic programs, Well-founded and stationary models of logic programs, Complexity and undecidability results for logic programming, On the computational cost of disjunctive logic programming: Propositional case, Complexity of computing with extended propositional logic programs, Negation as failure for disjunctive logic programming, Logic programming and reasoning with incomplete information, Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete, Complexity results for answer set programming with bounded predicate arities and implications, On look-ahead heuristics in disjunctive logic programming, Enhancing DLV instantiator by backjumping techniques, An incremental algorithm for generating all minimal models, Answering atomic queries in indefinite deductive databases, Brave Induction
