Determining inference semantics for disjunctive logic programs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5910656 (Why is no real title available?)
- scientific article; zbMATH DE number 440477 (Why is no real title available?)
- scientific article; zbMATH DE number 3755910 (Why is no real title available?)
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 25192 (Why is no real title available?)
- scientific article; zbMATH DE number 1368932 (Why is no real title available?)
- scientific article; zbMATH DE number 1368933 (Why is no real title available?)
- scientific article; zbMATH DE number 788030 (Why is no real title available?)
- A logic for default reasoning
- Answer Set Programming: A Primer
- Answer set programming and plan generation
- Answer sets for logic programs with arbitrary abstract constraint atoms
- Combining answer set programming with description logics for the semantic web
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- Embedding nonground logic programs into autoepistemic logic for knowledge-base combination
- Equilibrium logic
- Evaluating epistemic negation in answer set programming
- Extending and implementing the stable model semantics
- FLP answer set semantics without circular justifications for general logic programs
- Handbook of knowledge representation.
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Logic Programming and Nonmonotonic Reasoning
- Logic programs with stable model semantics as a constraint programming paradigm
- Logics in Artificial Intelligence
- Modular nonmonotonic logic programming revisited
- Nested expressions in logic programs
- New semantics for epistemic specifications
- On the computational cost of disjunctive logic programming: Propositional case
- On the query complexity of selecting minimal sets for monotone predicates
- Ordered completion for logic programs with aggregates
- Paraconsistent Stable Semantics for Extended Disjunctive Programs
- Reconciling description logics and rules
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- Revisiting Epistemic Specifications
- Semantical considerations on nonmonotonic logic
- Semantics and complexity of recursive aggregates in answer set programming
- Semi-equilibrium models for paracoherent answer set programs
- Stable models and circumscription
- The DLV system for knowledge representation and reasoning
- The Semantics of Predicate Logic as a Programming Language
- The complexity of selecting maximal solutions
- The well-founded semantics for general logic programs
- Twelve Definitions of a Stable Model
- Vicious circle principle and formation of sets in ASP based languages
- Well-founded and stable semantics of logic programs with aggregates
Cited in
(7)- Approximate Inference for Logic Programs with Annotated Disjunctions
- Default Negation as Explicit Negation plus Update
- Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
- scientific article; zbMATH DE number 2089454 (Why is no real title available?)
- Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics
- Witnesses for Answer Sets of Logic Programs
- Contrastive explanations for answer-set programs
This page was built for publication: Determining inference semantics for disjunctive logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289011)
