scientific article
From MaRDI portal
Publication:3939270
zbMath0481.68087MaRDI QIDQ3939270
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The complexity of propositional closed world reasoning and circumscription ⋮ Querying incomplete information in RDF with SPARQL ⋮ Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete ⋮ Formalizing incomplete knowledge in incomplete databases ⋮ A semantics for a class of non-deterministic and causal production system programs ⋮ To Vladimir Lifschitz on His 65th Birthday ⋮ Ordered model trees: A normal form for disjunctive deductive databases ⋮ An alternative approach to the semantics of disjunctive logic programs and deductive databases ⋮ Negation as failure: careful closure procedure ⋮ 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 ⋮ 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 ⋮ On computing minimal models ⋮ Polynomial-time computable stable models ⋮ Answering atomic queries in indefinite deductive databases ⋮ Reasoning with minimal models: efficient algorithms and applications ⋮ 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 ⋮ A game semantics for disjunctive logic programming ⋮ Autoepistemic logic of knowledge and beliefs ⋮ Two simple characterizations of well-founded semantics ⋮ Abduction from logic programs: Semantics and complexity ⋮ On compact representations of propositional circumscription ⋮ Is intractability of nonmonotonic reasoning a real drawback? ⋮ Complexity results for abductive logic programming ⋮ Characterizations of the stable semantics by partial evaluation ⋮ Inductive equivalence in clausal logic and nonmonotonic logic programming ⋮ 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 ⋮ On measuring inconsistency in definite and indefinite databases with denial constraints ⋮ Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete ⋮ Brave induction: a logical framework for learning from incomplete information ⋮ Disjunctive closures for knowledge compilation ⋮ Closed world assumptions having precedence in predicates ⋮ Brave Induction ⋮ Semantics of Horn and disjunctive logic programs ⋮ An incremental algorithm for generating all minimal models ⋮ On the tractability of minimal model computation for some CNF theories ⋮ Paraconsistent disjunctive deductive databases ⋮ Query evaluation in probabilistic relational 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 ⋮ Semantics and complexity of recursive aggregates in answer set programming ⋮ On the equivalence of the static and disjunctive well-founded semantics and its computation ⋮ Disjunctive databases for representing repairs ⋮ Closed world assumption for disjunctive reasoning ⋮ Determining inference semantics for disjunctive logic programs ⋮ The semantics of incomplete databases as an expression of preferences ⋮ Expressive power and complexity of partial models for disjunctive deductive databases ⋮ Weak generalized closed world assumption ⋮ Strong and explicit negation in non-monotonic reasoning and logic programming ⋮ An abductive framework for negation in disjunctive logic programming ⋮ Characterizing D-WFS: Confluence and iterated GCWA ⋮ Approximate well-founded semantics, query answering and generalized normal logic programs over lattices ⋮ The theory of interval probabilistic logic programs ⋮ The complexity of belief update ⋮ Computing only minimal answers in disjunctive deductive databases ⋮ On the complexity of data disjunctions. ⋮ Preprocessing of intractable problems ⋮ Interpreting disjunctive logic programs based on a strong sense of disjunction ⋮ First-order syntactic characterizations of minimal entailment, domain- minimal entailment, and Herbrand entailment ⋮ Logic programming and knowledge representation---The A-Prolog perspective ⋮ View updates in stratified disjunctive databases ⋮ Enhancing disjunctive logic programming systems by SAT checkers
This page was built for publication:
