Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
From MaRDI portal
Publication:1363783
DOI10.1006/INCO.1997.2630zbMATH Open0879.68019OpenAlexW2036241121MaRDI QIDQ1363783
Pasquale Rullo, N. Leone, Francesco Scarcello
Publication date: 12 January 1998
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5a637b487b7b1efc7f9a550f8c76b226c027d8b2
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the partial semantics for disjunctive deductive databases
- On the computational cost of disjunctive logic programming: Propositional case
- Propositional semantics for disjunctive logic programs
- The well-founded semantics for general logic programs
- Reasoning with minimal models: efficient algorithms and applications
- Autoepistemic logic
- A Computing Procedure for Quantification Theory
- Logic programming and negation: A survey
- Logic programming and knowledge representation
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- A fixpoint semantics for disjunctive logic programs
- The relationship between stable, supported, default and autoepistemic semantics for general logic programs
- Safe computation of the well-founded semantics of datalog queries
- Disjunctive \(LP+\) integrity constraints = stable model semantics.
- A rational reconstruction of nonmonotonic truth maintenance systems
- Stable models and their computation for logic programming with inheritance and true negation
- The family of stable models
- Mixed integer programming methods for computing nonmonotonic deductive databases
- Modular stratification and magic sets for Datalog programs with negation
- SATCHMORE: SATCHMO with RElevancy
- Bottom-up computation of perfect models for disjunctive theories
- A fixpoint characterization of abductive logic programs
- Model generation and state generation for disjunctive logic programs
Cited In (46)
- Exploiting Unfounded Sets for HEX-Program Evaluation
- Disjunctive answer set solvers via templates
- Omission-Based Abstraction for Answer Set Programs
- Epistemic logic programs: a study of some properties
- Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting
- Answer Set Programming: A Primer
- Catching the Ouroboros: On debugging non-ground answer-set programs
- Incremental Answer Set Programming with Overgrounding
- On elementary loops of logic programs
- Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
- Abstraction for non-ground answer set programs
- Splitting Epistemic Logic Programs
- A generalization of the Lin-Zhao theorem
- Thirty years of Epistemic Specifications
- Extending and implementing the stable model semantics
- Signed dual tableaux for Kleene answer set programs
- Transition systems for model generators—A unifying approach
- On the relation among answer set solvers
- Reasoning with minimal models: efficient algorithms and applications
- Incremental maintenance of overgrounded logic programs with tailored simplifications
- Witnesses for Answer Sets of Logic Programs
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
- Bottom-up computation of perfect models for disjunctive theories
- Progress in clasp Series 3
- Disjunctive ASP with functions: Decidable queries and effective computation
- Conflict-driven answer set solving: from theory to practice
- Magic sets for disjunctive Datalog programs
- Any-world assumptions in logic programming
- Autoepistemic answer set programming
- Deductive databases for computing certain and consistent answers from mediated data integration systems
- Stepwise Debugging of Description-Logic Programs
- Computing only minimal answers in disjunctive deductive databases
- A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption
- Abstract Answer Set Solvers
- On the tractability of minimal model computation for some CNF theories
- Determining inference semantics for disjunctive logic programs
- Backdoors to tractable answer set programming
- Epistemic logic programs: a study of some properties
- Logic programming and knowledge representation---The A-Prolog perspective
- What is answer set programming to propositional satisfiability
- Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- Enhancing disjunctive logic programming systems by SAT checkers
- Well-founded operators for normal hybrid MKNF knowledge bases
- Graph-based construction of minimal models
- On look-ahead heuristics in disjunctive logic programming
Uses Software
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)
