Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
From MaRDI portal
Cites work
- A Computing Procedure for Quantification Theory
- A fixpoint characterization of abductive logic programs
- A fixpoint semantics for disjunctive logic programs
- A rational reconstruction of nonmonotonic truth maintenance systems
- Autoepistemic logic
- Bottom-up computation of perfect models for disjunctive theories
- Disjunctive \(LP+\) integrity constraints = stable model semantics.
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- scientific article; zbMATH DE number 4199656 (Why is no real title available?)
- scientific article; zbMATH DE number 4147555 (Why is no real title available?)
- scientific article; zbMATH DE number 4166904 (Why is no real title available?)
- scientific article; zbMATH DE number 4094866 (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 1114053 (Why is no real title available?)
- scientific article; zbMATH DE number 1158758 (Why is no real title available?)
- Logic programming and knowledge representation
- Logic programming and negation: A survey
- Mixed integer programming methods for computing nonmonotonic deductive databases
- Model generation and state generation for disjunctive logic programs
- Modular stratification and magic sets for Datalog programs with negation
- On the computational cost of disjunctive logic programming: Propositional case
- On the partial semantics for disjunctive deductive databases
- Propositional semantics for disjunctive logic programs
- Reasoning with minimal models: efficient algorithms and applications
- Safe computation of the well-founded semantics of datalog queries
- SATCHMORE: SATCHMO with RElevancy
- Stable models and their computation for logic programming with inheritance and true negation
- The family of stable models
- The relationship between stable, supported, default and autoepistemic semantics for general logic programs
- The well-founded semantics for general logic programs
Cited in
(48)- On the relation among answer set solvers
- Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
- Computing only minimal answers in disjunctive deductive databases
- Reasoning with minimal models: efficient algorithms and applications
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- Logic programming and knowledge representation---The A-Prolog perspective
- Extending and implementing the stable model semantics
- What is answer set programming to propositional satisfiability
- Conflict-driven answer set solving: from theory to practice
- Magic sets for disjunctive Datalog programs
- Autoepistemic answer set programming
- Graph-based construction of minimal models
- Determining inference semantics for disjunctive logic programs
- Backdoors to tractable answer set programming
- Deductive databases for computing certain and consistent answers from mediated data integration systems
- On look-ahead heuristics in disjunctive logic programming
- Any-world assumptions in logic programming
- Epistemic logic programs: a study of some properties
- Iteratively-supported formulas and strongly supported models for Kleene answer set programs (extended abstract)
- On elementary loops of logic programs
- Stepwise debugging of description-logic programs
- Exploiting unfounded sets for HEX-program evaluation
- Transition systems for model generators -- a unifying approach
- Bottom-up computation of perfect models for disjunctive theories
- Progress in clasp series 3
- A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption
- Disjunctive ASP with functions: decidable queries and effective computation
- Catching the Ouroboros: on debugging non-ground answer-set programs
- Answer Set Programming: A Primer
- Well-founded operators for normal hybrid MKNF knowledge bases
- Disjunctive answer set solvers via templates
- Computing loops with at most one external support rule for disjunctive logic programs
- On the tractability of minimal model computation for some CNF theories
- Omission-based abstraction for answer set programs
- Splitting epistemic logic programs
- Founded (auto)epistemic equilibrium logic satisfies epistemic splitting
- Incremental answer set programming with overgrounding
- Incremental maintenance of overgrounded logic programs with tailored simplifications
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
- Abstract Answer Set Solvers
- Witnesses for Answer Sets of Logic Programs
- Abstraction for non-ground answer set programs
- Thirty years of Epistemic Specifications
- Signed dual tableaux for Kleene answer set programs
- Epistemic logic programs: a study of some properties
- Enhancing disjunctive logic programming systems by SAT checkers
- Logic programming in tensor spaces
- A generalization of the Lin-Zhao theorem
This page was built for publication: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363783)
