Propositional semantics for disjunctive logic programs
From MaRDI portal
Redirect page
Recommendations
Cites work
- A fixpoint semantics for disjunctive logic programs
- A logic for default reasoning
- A rational reconstruction of nonmonotonic truth maintenance systems
- A sufficient condition for backtrack-bounded search
- Autoepistemic logic
- Complexity of Finding Embeddings in a k-Tree
- Depth-First Search and Linear Graph Algorithms
- Hard problems for simple default logics
- scientific article; zbMATH DE number 3688740 (Why is no real title available?)
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- Network-based heuristics for constraint-satisfaction problems
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- On the declarative and procedural semantics of logic programs
- Tree clustering for constraint networks
Cited in
(80)- Stable models and difference logic
- Computing only minimal answers in disjunctive deductive databases
- Reasoning with minimal models: efficient algorithms and applications
- Expressive power and complexity of partial models for disjunctive deductive databases
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- Polynomial-time computable stable models
- Fixed-parameter tractability of disjunction-free default reasoning
- Logic programming and knowledge representation---The A-Prolog perspective
- On the computational cost of disjunctive logic programming: Propositional case
- Connections between default reasoning and partial constraint satisfaction
- Graph-based construction of minimal models
- Assumption-based argumentation for extended disjunctive logic programming
- DiMo -- discrete modelling using propositional logic
- Default reasoning using classical logic
- Making sense of sensory input
- Paracoherent answer set computation
- Forgetting auxiliary atoms in forks
- Backdoors to tractable answer set programming
- 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
- Complexity results for answer set programming with bounded predicate arities and implications
- On look-ahead heuristics in disjunctive logic programming
- An incremental algorithm for generating all minimal models
- Semi-equilibrium models for paracoherent answer set programs
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
- Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
- On elementary loops of logic programs
- Modular paracoherent answer sets
- Characterising equilibrium logic and nested logic programs: Reductions and complexity,
- On the complexity of identifying head-elementary-set-free programs
- scientific article; zbMATH DE number 5079838 (Why is no real title available?)
- Solving disjunctive fuzzy answer set programs
- Finding Reductions Automatically
- Answer Set Programming: A Primer
- Some (in)translatability results for normal logic programs and propositional theories
- Ordered completion for first-order logic programs on finite structures
- scientific article; zbMATH DE number 1267566 (Why is no real title available?)
- Partial deduction in disjunctive logic programming
- scientific article; zbMATH DE number 1538058 (Why is no real title available?)
- Model-based recasting in answer-set programming
- 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
- Stepwise debugging of answer-set programs
- scientific article; zbMATH DE number 1884387 (Why is no real title available?)
- scientific article; zbMATH DE number 2111988 (Why is no real title available?)
- Restricted default theories: expressive power and outlier detection tasks
- On the tractability of minimal model computation for some CNF theories
- Optimizing answer set computation via heuristic-based decomposition
- The Seventh Answer Set Programming Competition: Design and Results
- scientific article; zbMATH DE number 7455719 (Why is no real title available?)
- Reasoning with stratified default theories
- A logic framework for P2P deductive databases
- scientific article; zbMATH DE number 6440890 (Why is no real title available?)
- Comparisons and computation of well-founded semantics for disjunctive logic programs
- Backdoors to normality for disjunctive logic programs
- Expressiveness of logic programs under the general stable model semantics
- Logic Programming
- Complexity of super-coherence problems in ASP
- Logic Programming and Nonmonotonic Reasoning
- Head-Elementary-Set-Free Logic Programs
- scientific article; zbMATH DE number 5043340 (Why is no real title available?)
- Detecting Inconsistencies in Large Biological Networks with Answer Set Programming
- Witnesses for Answer Sets of Logic Programs
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- LATIN 2004: Theoretical Informatics
- Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs
- A fixpoint characterization of three-valued disjunctive hybrid MKNF knowledge bases
- How to split a logic program
- A simple proof-theoretic characterization of stable models: reduction to difference logic and experiments
- Declarative approaches to counterfactual explanations for classification
- Aggregate semantics for propositional answer set programs
- Enhancing disjunctive logic programming systems by SAT checkers
- ASSAT: computing answer sets of a logic program by SAT solvers
- Answer set programming based on propositional satisfiability
- Design and results of the Fifth Answer Set Programming Competition
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)
