Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation

DOI10.1006/inco.1997.2630zbMath0879.68019OpenAlexW2036241121MaRDI QIDQ1363783

Pasquale Rullo, Nicola 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

zbMATH Keywords

knowledge representationcommonsense reasoning

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17)

Related Items (max. 100)

On elementary loops of logic programs ⋮ Witnesses for Answer Sets of Logic Programs ⋮ Progress in clasp Series 3 ⋮ Stepwise Debugging of Description-Logic Programs ⋮ Deductive databases for computing certain and consistent answers from mediated data integration systems ⋮ Exploiting Unfounded Sets for HEX-Program Evaluation ⋮ A generalization of the Lin-Zhao theorem ⋮ Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation ⋮ Reasoning with minimal models: efficient algorithms and applications ⋮ Well-founded operators for normal hybrid MKNF knowledge bases ⋮ Disjunctive answer set solvers via templates ⋮ Thirty years of Epistemic Specifications ⋮ Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting ⋮ Incremental Answer Set Programming with Overgrounding ⋮ On look-ahead heuristics in disjunctive logic programming ⋮ What is answer set programming to propositional satisfiability ⋮ Epistemic logic programs: a study of some properties ⋮ A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption ⋮ Incremental maintenance of overgrounded logic programs with tailored simplifications ⋮ On the tractability of minimal model computation for some CNF theories ⋮ Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs ⋮ Conflict-driven answer set solving: from theory to practice ⋮ Magic sets for disjunctive Datalog programs ⋮ Disjunctive ASP with functions: Decidable queries and effective computation ⋮ Catching the Ouroboros: On debugging non-ground answer-set programs ⋮ Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets ⋮ Determining inference semantics for disjunctive logic programs ⋮ Omission-Based Abstraction for Answer Set Programs ⋮ Splitting Epistemic Logic Programs ⋮ Autoepistemic answer set programming ⋮ Abstraction for non-ground answer set programs ⋮ Transition systems for model generators—A unifying approach ⋮ Answer Set Programming: A Primer ⋮ 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 ⋮ Any-world assumptions in logic programming ⋮ Abstract Answer Set Solvers ⋮ Graph-based construction of minimal models ⋮ Backdoors to tractable answer set programming ⋮ Logic programming and knowledge representation---The A-Prolog perspective ⋮ Extending and implementing the stable model semantics ⋮ Enhancing disjunctive logic programming systems by SAT checkers

Uses Software

• SATCHMO
• Datalog

Cites Work

• Reasoning with minimal models: efficient algorithms and applications
• Safe computation of the well-founded semantics of datalog queries
• The relationship between stable, supported, default and autoepistemic semantics for general logic programs
• Disjunctive \(LP+\) integrity constraints = stable model semantics.
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• On the partial semantics for disjunctive deductive databases
• SATCHMORE: SATCHMO with RElevancy
• On the computational cost of disjunctive logic programming: Propositional case
• Propositional semantics for disjunctive logic programs
• A rational reconstruction of nonmonotonic truth maintenance systems
• Bottom-up computation of perfect models for disjunctive theories
• Stable models and their computation for logic programming with inheritance and true negation
• A fixpoint characterization of abductive logic programs
• A fixpoint semantics for disjunctive logic programs
• The family of stable models
• Autoepistemic logic
• The well-founded semantics for general logic programs
• Logic programming and negation: A survey
• Logic programming and knowledge representation
• Mixed integer programming methods for computing nonmonotonic deductive databases
• Modular stratification and magic sets for Datalog programs with negation
• Model generation and state generation for disjunctive logic programs
• A Computing Procedure for Quantification Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation