Pages that link to "Item:Q1127346"
From MaRDI portal
The following pages link to Reasoning with minimal models: efficient algorithms and applications (Q1127346):
Displaying 14 items.
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies (Q286087) (← links)
- On the tractability of minimal model computation for some CNF theories (Q490649) (← links)
- Enhancing disjunctive logic programming systems by SAT checkers (Q814529) (← links)
- Reasoning under minimal upper bounds in propositional logic (Q861253) (← links)
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation (Q1363783) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- Graph-based construction of minimal models (Q2093381) (← links)
- Paracoherent answer set computation (Q2238696) (← links)
- Complexity results for answer set programming with bounded predicate arities and implications (Q2426101) (← links)
- An incremental algorithm for generating all minimal models (Q2457647) (← links)
- (Q2723419) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- On the complexity of identifying head-elementary-set-free programs (Q3400962) (← links)
- Optimizing Answer Set Computation via Heuristic-Based Decomposition (Q4957190) (← links)
