Propositional semantics for disjunctive logic programs

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Depth-First Search and Linear Graph Algorithms
Complexity of Finding Embeddings in a k-Tree
Network-based heuristics for constraint-satisfaction problems
Autoepistemic logic
A logic for default reasoning
Tree clustering for constraint networks
A sufficient condition for backtrack-bounded search
On the complexity of propositional knowledge base revision, updates, and counterfactuals
On the declarative and procedural semantics of logic programs
Hard problems for simple default logics
A fixpoint semantics for disjunctive logic programs
A rational reconstruction of nonmonotonic truth maintenance systems

Cited In (73)

Detecting Inconsistencies in Large Biological Networks with Answer Set Programming
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
A Logic Framework for P2P Deductive Databases
Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Witnesses for Answer Sets of Logic Programs
Title not available (Why is that?)
LATIN 2004: Theoretical Informatics
How to split a logic program
Complexity of super-coherence problems in ASP
Semi-equilibrium models for paracoherent answer set programs
Comparisons and computation of well-founded semantics for disjunctive logic programs
Assumption-based argumentation for extended disjunctive logic programming
Model-based recasting in answer-set programming
Making sense of sensory input
Outlier detection using default reasoning
Title not available (Why is that?)
Answer Set Programming: A Primer
Some (in)translatability results for normal logic programs and propositional theories
Stepwise debugging of answer-set programs
Expressiveness of Logic Programs under the General Stable Model Semantics
Characterising equilibrium logic and nested logic programs: Reductions and complexity,
On elementary loops of logic programs
Stable-unstable semantics: Beyond NP with normal logic programs
DiMo -- discrete modelling using propositional logic
Optimizing Answer Set Computation via Heuristic-Based Decomposition
Ordered completion for first-order logic programs on finite structures
Title not available (Why is that?)
An incremental algorithm for generating all minimal models
Solving Disjunctive Fuzzy Answer Set Programs
Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
Partial deduction in disjunctive logic programming
Title not available (Why is that?)
Expressive power and complexity of partial models for disjunctive deductive databases
Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
Paracoherent answer set computation
Stable models and difference logic
Answer set programming based on propositional satisfiability
The Seventh Answer Set Programming Competition: Design and Results
On the complexity of identifying head-elementary-set-free programs
Knowledge compilation of logic programs using approximation fixpoint theory
Fuzzy answer set computation via satisfiability modulo theories
On the computational cost of disjunctive logic programming: Propositional case
Reasoning with minimal models: efficient algorithms and applications
Dual-normal logic programs – the forgotten class
Backdoors to Normality for Disjunctive Logic Programs
Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
Design and results of the Fifth Answer Set Programming Competition
Forgetting auxiliary atoms in forks
Deductive databases for computing certain and consistent answers from mediated data integration systems
Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
Modular Paracoherent Answer Sets
Reasoning with stratified default theories
Restricted default theories: expressive power and outlier detection tasks
Computing only minimal answers in disjunctive deductive databases
ASSAT: computing answer sets of a logic program by SAT solvers
Polynomial-time computable stable models
On the tractability of minimal model computation for some CNF theories
Backdoors to tractable answer set programming
Logic programming and knowledge representation---The A-Prolog perspective
Default reasoning using classical logic
Connections between default reasoning and partial constraint satisfaction
Semantic forgetting in answer set programming
Finding Reductions Automatically
Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
Fixed-parameter tractability of disjunction-free default reasoning
Enhancing disjunctive logic programming systems by SAT checkers
Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs
Graph-based construction of minimal models
On look-ahead heuristics in disjunctive logic programming
Complexity results for answer set programming with bounded predicate arities and implications

This page was built for publication: Propositional semantics for disjunctive logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1924819)