scientific article
From MaRDI portal
Publication:3983045
zbMath0796.68053MaRDI QIDQ3983045
Publication date: 26 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Characterising and Explaining Inconsistency in Logic Programs, An alternative approach to the semantics of disjunctive logic programs and deductive databases, Querying disjunctive databases through nonmonotonic logics, Assumption-based argumentation is logic programming with projection, Disjunctive \(LP+\) integrity constraints = stable model semantics., Deductive databases for computing certain and consistent answers from mediated data integration systems, Equilibrium logic, Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation, Disjunctive logic and semantics of disjunctive logic programs, Argumentation-Based Semantics for Logic Programs with First-Order Formulae, Labellings for assumption-based and abstract argumentation, Modular Paracoherent Answer Sets, Reasoning with minimal models: efficient algorithms and applications, Static semantics for normal and disjunctive logic programs, Well-founded and stationary models of logic programs, On the computational cost of disjunctive logic programming: Propositional case, Model-based recasting in answer-set programming, Many-valued dynamic object-oriented inheritance and approximations, Two simple characterizations of well-founded semantics, Abduction from logic programs: Semantics and complexity, On compact representations of propositional circumscription, Complexity results for abductive logic programming, Characterizations of the stable semantics by partial evaluation, Loop checking and the well-founded semantics, Embedding circumscriptive theories in general disjunctive programs, Stable classes and operator pairs for disjunctive programs, Dual-normal logic programs – the forgotten class, A model building framework for answer set programming with external computations, Paracoherent Answer Set Semantics meets Argumentation Frameworks, Better Paracoherent Answer Sets with Less Resources, On look-ahead heuristics in disjunctive logic programming, Enhancing DLV instantiator by backjumping techniques, Interlinking logic programs and argumentation frameworks, Implementing Prioritized Circumscription by Computing Disjunctive Stable Models, Finding explanations of inconsistency in multi-context systems, Unnamed Item, Partial equilibrium logic, Paracoherent answer set computation, Stability, Supportedness, Minimality and Kleene Answer Set Programs, Preference-Based Diagnosis Selection in Multi-Context Systems, Equivalence for the \(G_3^\prime\)-stable models semantics, Bounded treewidth as a key to tractability of knowledge representation and reasoning, Closed world assumption for disjunctive reasoning, Determining inference semantics for disjunctive logic programs, A Logic-Based Framework Leveraging Neural Networks for Studying the Evolution of Neurological Disorders, Tractable reasoning using logic programs with intensional concepts, Well-Founded and Partial Stable Semantics Logical Aspects, Expressive power and complexity of partial models for disjunctive deductive databases, Normal Form Nested Programs, Strong and explicit negation in non-monotonic reasoning and logic programming, Characterizing D-WFS: Confluence and iterated GCWA, Computing only minimal answers in disjunctive deductive databases, Prioritized logic programming and its application to commonsense reasoning, On the equivalence between logic programming semantics and argumentation semantics, Assumption-based argumentation for extended disjunctive logic programming, Extending and implementing the stable model semantics, Semi-equilibrium models for paracoherent answer set programs, Enhancing disjunctive logic programming systems by SAT checkers
