scientific article
From MaRDI portal
Publication:4016556
zbMath0755.68033MaRDI QIDQ4016556
Jorge Lobo, Arcot Rajasekar, Jack Minker
Publication date: 16 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
prioritized circumscriptiongeneralized closed world assumptionstratified disjunctive logic programsstratified disjunctive theories
Related Items
Expressiveness of Logic Programs under the General Stable Model Semantics, SATCHMOREBID: SATCHMO(RE) with BIDirectional relevancy, To Vladimir Lifschitz on His 65th Birthday, Disjunctive Programs with Set Constraints, An alternative approach to the semantics of disjunctive logic programs and deductive databases, SATCHMORE: SATCHMO with RElevancy, Generalized disjunctive well-founded semantics for logic programs., Jack Minker --- A profile, Dynamic maintenance of the transitive closure in disjunctive graphs, On the computational cost of disjunctive logic programming: Propositional case, Negation as failure for disjunctive logic programming, Logic programming and reasoning with incomplete information, Argumentation in disjunctive logic programming, Complexity results for abductive logic programming, Incremental methods for optimizing partial instantiation, Stable classes and operator pairs for disjunctive programs, Complexity results for answer set programming with bounded predicate arities and implications, Temporal disjunctive logic programming, Magic sets for disjunctive Datalog programs, A hybrid reasoning system for terminologies and first-order clauses in knowledge bases, Closed world assumption for disjunctive reasoning, An abductive framework for negation in disjunctive logic programming, Characterizing D-WFS: Confluence and iterated GCWA, Correspondences between classical, intuitionistic and uniform provability, Computing only minimal answers in disjunctive deductive databases, Clausal logic and logic programming in algebraic domains, Interpreting disjunctive logic programs based on a strong sense of disjunction
