Propositional semantics for disjunctive logic programs
From MaRDI portal
Publication:1924819
DOI10.1007/BF01530761zbMath0858.68012MaRDI QIDQ1924819
Rina Dechter, Rachel Ben-Eliyahu
Publication date: 20 October 1996
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Related Items (61)
Backdoors to Normality for Disjunctive Logic Programs ⋮ Expressiveness of Logic Programs under the General Stable Model Semantics ⋮ Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs ⋮ On elementary loops of logic programs ⋮ Witnesses for Answer Sets of Logic Programs ⋮ Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies ⋮ Solving Disjunctive Fuzzy Answer Set Programs ⋮ Characterising equilibrium logic and nested logic programs: Reductions and complexity, ⋮ Deductive databases for computing certain and consistent answers from mediated data integration systems ⋮ Heuristics for planning with penalties and rewards formulated in logic and computed through circuits ⋮ Semantic forgetting in answer set programming ⋮ Outlier detection using default reasoning ⋮ Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation ⋮ Answer set programming based on propositional satisfiability ⋮ Default reasoning using classical logic ⋮ Polynomial-time computable stable models ⋮ Modular Paracoherent Answer Sets ⋮ Reasoning with minimal models: efficient algorithms and applications ⋮ On the computational cost of disjunctive logic programming: Propositional case ⋮ Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? ⋮ Model-based recasting in answer-set programming ⋮ Reasoning with stratified default theories ⋮ Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs ⋮ Knowledge compilation of logic programs using approximation fixpoint theory ⋮ Dual-normal logic programs – the forgotten class ⋮ Fuzzy answer set computation via satisfiability modulo theories ⋮ Stable-unstable semantics: Beyond NP with normal logic programs ⋮ Fixed-parameter tractability of disjunction-free default reasoning ⋮ A Logic Framework for P2P Deductive Databases ⋮ Complexity results for answer set programming with bounded predicate arities and implications ⋮ On look-ahead heuristics in disjunctive logic programming ⋮ Design and results of the Fifth Answer Set Programming Competition ⋮ Ordered completion for first-order logic programs on finite structures ⋮ Stepwise debugging of answer-set programs ⋮ Unnamed Item ⋮ Connections between default reasoning and partial constraint satisfaction ⋮ Unnamed Item ⋮ Restricted default theories: expressive power and outlier detection tasks ⋮ An incremental algorithm for generating all minimal models ⋮ On the tractability of minimal model computation for some CNF theories ⋮ Making sense of sensory input ⋮ Paracoherent answer set computation ⋮ Complexity of super-coherence problems in ASP ⋮ Finding Reductions Automatically ⋮ Optimizing Answer Set Computation via Heuristic-Based Decomposition ⋮ The Seventh Answer Set Programming Competition: Design and Results ⋮ Answer Set Programming: A Primer ⋮ Expressive power and complexity of partial models for disjunctive deductive databases ⋮ Stable models and difference logic ⋮ Some (in)translatability results for normal logic programs and propositional theories ⋮ On the complexity of identifying head-elementary-set-free programs ⋮ Forgetting auxiliary atoms in forks ⋮ Computing only minimal answers in disjunctive deductive databases ⋮ Detecting Inconsistencies in Large Biological Networks with Answer Set Programming ⋮ Graph-based construction of minimal models ⋮ Backdoors to tractable answer set programming ⋮ Assumption-based argumentation for extended disjunctive logic programming ⋮ Logic programming and knowledge representation---The A-Prolog perspective ⋮ Semi-equilibrium models for paracoherent answer set programs ⋮ Enhancing disjunctive logic programming systems by SAT checkers ⋮ ASSAT: computing answer sets of a logic program by SAT solvers
Cites Work
- Unnamed Item
- Unnamed Item
- Network-based heuristics for constraint-satisfaction problems
- Tree clustering for constraint networks
- A logic for default reasoning
- Hard problems for simple default logics
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- On the declarative and procedural semantics of logic programs
- A rational reconstruction of nonmonotonic truth maintenance systems
- A fixpoint semantics for disjunctive logic programs
- Complexity of Finding Embeddings in a k-Tree
- A sufficient condition for backtrack-bounded search
- Autoepistemic logic
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: Propositional semantics for disjunctive logic programs
