Pages that link to "Item:Q5277741"
From MaRDI portal
The following pages link to Unfolding partiality and disjunctions in stable model semantics (Q5277741):
Displayed 27 items.
- Synonymous theories and knowledge representations in answer set programming (Q414849) (← links)
- Semantics and complexity of recursive aggregates in answer set programming (Q543600) (← links)
- Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results (Q645074) (← links)
- A first order nonmonotonic extension of constructive logic (Q813086) (← links)
- Logic programming as classical inference (Q898781) (← links)
- Design and results of the Fifth Answer Set Programming Competition (Q899444) (← links)
- Computing only minimal answers in disjunctive deductive databases (Q1040782) (← links)
- Magic sets for disjunctive Datalog programs (Q1761296) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- An incremental algorithm for generating all minimal models (Q2457647) (← links)
- On elementary loops of logic programs (Q2884258) (← links)
- The Intelligent Grounder of DLV (Q2900523) (← links)
- The Design of the Sixth Answer Set Programming Competition (Q3449235) (← links)
- Implementing Prioritized Circumscription by Computing Disjunctive Stable Models (Q3534658) (← links)
- Dual-normal logic programs – the forgotten class (Q4592993) (← links)
- Disjunctive answer set solvers via templates (Q4593037) (← links)
- The power of non-ground rules in Answer Set Programming (Q4593042) (← links)
- Stable-unstable semantics: Beyond NP with normal logic programs (Q4593043) (← links)
- Optimizing Answer Set Computation via Heuristic-Based Decomposition (Q4957190) (← links)
- Omission-Based Abstraction for Answer Set Programs (Q4957218) (← links)
- On the Semantics of Abstract Argumentation Frameworks: A Logic Programming Approach (Q5140009) (← links)
- Backdoors to Normality for Disjunctive Logic Programs (Q5277908) (← links)
- Parallel instantiation of ASP programs: techniques and experiments (Q5299587) (← links)
- Complexity of super-coherence problems in ASP (Q5418947) (← links)
- Detecting Inconsistencies in Large Biological Networks with Answer Set Programming (Q5504653) (← links)
- Program Correspondence under the Answer-Set Semantics: The Non-ground Case (Q5504682) (← links)
- Abstraction for non-ground answer set programs (Q5919127) (← links)