scientific article; zbMATH DE number 25192
From MaRDI portal
Publication:3983045
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
Cited in
(97)- Computing only minimal answers in disjunctive deductive databases
- Reasoning with minimal models: efficient algorithms and applications
- Semantics of Horn and disjunctive logic programs
- Credolous argumentation with the disjunctive stable semantics
- Expressive power and complexity of partial models for disjunctive deductive databases
- An alternative approach to the semantics of disjunctive logic programs and deductive databases
- Querying disjunctive databases through nonmonotonic logics
- Disjunctive \(LP+\) integrity constraints = stable model semantics.
- On stratified disjunctive programs
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- Disjunctive logic and semantics of disjunctive logic programs
- On the partial semantics for disjunctive deductive databases
- Abduction from logic programs: Semantics and complexity
- On compact representations of propositional circumscription
- Prioritized logic programming and its application to commonsense reasoning
- Extending and implementing the stable model semantics
- Non-monotonic extensions of logic programming. ICLP '94 Workshop, Santa Margherita Ligure, Italy, June 17, 1994. Selected papers
- The expressive powers of the logic programming semantics
- 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
- Propositional semantics for disjunctive logic programs
- Tractable reasoning using logic programs with intensional concepts
- Assumption-based argumentation for extended disjunctive logic programming
- Assumption-based argumentation is logic programming with projection
- Paracoherent answer set computation
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- Determining inference semantics for disjunctive logic programs
- On the equivalence between logic programming semantics and argumentation semantics
- Deductive databases for computing certain and consistent answers from mediated data integration systems
- Labellings for assumption-based and abstract argumentation
- On look-ahead heuristics in disjunctive logic programming
- Enhancing DLV instantiator by backjumping techniques
- Partial equilibrium logic
- Semi-equilibrium models for paracoherent answer set programs
- Many-valued dynamic object-oriented inheritance and approximations
- Interlinking logic programs and argumentation frameworks
- Constructing interpretations of deductive databases using reduction and dynamic stratification
- Modular paracoherent answer sets
- A fixpoint semantics for disjunctive logic programs
- scientific article; zbMATH DE number 4200183 (Why is no real title available?)
- Well-Founded and Partial Stable Semantics Logical Aspects
- Characterising and explaining inconsistency in logic programs
- scientific article; zbMATH DE number 4155872 (Why is no real title available?)
- scientific article; zbMATH DE number 4160107 (Why is no real title available?)
- Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
- On stable-like semantics for logic programs
- scientific article; zbMATH DE number 591001 (Why is no real title available?)
- On the equivalence of semantics for normal logic programs
- scientific article; zbMATH DE number 978240 (Why is no real title available?)
- Characterizations of the disjunctive stable semantics by partial evaluation
- Expressiveness of stable model semantics for disjunctive logic programs with functions
- scientific article; zbMATH DE number 1114053 (Why is no real title available?)
- scientific article; zbMATH DE number 1114054 (Why is no real title available?)
- scientific article; zbMATH DE number 1123619 (Why is no real title available?)
- scientific article; zbMATH DE number 1507287 (Why is no real title available?)
- Argumentation-based semantics for logic programs with first-order formulae
- Model-based recasting in answer-set programming
- Dual-normal logic programs -- the forgotten class
- A model building framework for answer set programming with external computations
- Stable-unstable semantics: Beyond NP with normal logic programs
- Finding explanations of inconsistency in multi-context systems
- scientific article; zbMATH DE number 1926616 (Why is no real title available?)
- Stable generated models, partial temporal logic and disjunctive defaults
- scientific article; zbMATH DE number 749936 (Why is no real title available?)
- scientific article; zbMATH DE number 1884399 (Why is no real title available?)
- scientific article; zbMATH DE number 2090537 (Why is no real title available?)
- Minimal founded semantics for disjunctive logic programs and deductive databases
- scientific article; zbMATH DE number 1407680 (Why is no real title available?)
- scientific article; zbMATH DE number 1416104 (Why is no real title available?)
- scientific article; zbMATH DE number 1453064 (Why is no real title available?)
- scientific article; zbMATH DE number 1453068 (Why is no real title available?)
- A logic-based framework leveraging neural networks for studying the evolution of neurological disorders
- Two simple characterizations of well-founded semantics
- 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
- Paracoherent answer set semantics meets argumentation frameworks
- Better paracoherent answer sets with less resources
- Stability, supportedness, minimality and Kleene answer set programs
- Preference-Based Diagnosis Selection in Multi-Context Systems
- Strong and explicit negation in non-monotonic reasoning and logic programming
- Characterizing D-WFS: confluence and iterated GCWA
- Unfolding partiality and disjunctions in stable model semantics
- Expressiveness of logic programs under the general stable model semantics
- Disjunctive logic programs with existential quantification in rule heads
- Logic Programming and Nonmonotonic Reasoning
- A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation
- Normal Form Nested Programs
- Closed world assumption for disjunctive reasoning
- A fixpoint characterization of three-valued disjunctive hybrid MKNF knowledge bases
- On logics and semantics for general logic programs
- Enhancing disjunctive logic programming systems by SAT checkers
- Equilibrium logic
- Equivalence for the G₃^-stable models semantics
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)
