scientific article; zbMATH DE number 25192

zbMATH Open0796.68053MaRDI QIDQ3983045FDOQ3983045

Teodor C. Przymusinski

Publication date: 26 June 1992

Title of this publication is not available (Why is that?)

Recommendations

• On the partial semantics for disjunctive deductive databases
• Characterizations of the disjunctive stable semantics by partial evaluation
• Characterizations of the stable semantics by partial evaluation
• Static semantics for normal and disjunctive logic programs
• scientific article; zbMATH DE number 1453064

zbMATH Keywords

disjunctive logic programsdeductive databasesstable model semanticsautoepistemic theory

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Cited In (77)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3983045)