Pages that link to "Item:Q1924819"
From MaRDI portal
The following pages link to Propositional semantics for disjunctive logic programs (Q1924819):
Displaying 50 items.
- Semi-equilibrium models for paracoherent answer set programs (Q253992) (← links)
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies (Q286087) (← links)
- Ordered completion for first-order logic programs on finite structures (Q420824) (← links)
- Restricted default theories: expressive power and outlier detection tasks (Q483301) (← links)
- On the tractability of minimal model computation for some CNF theories (Q490649) (← links)
- Enhancing disjunctive logic programming systems by SAT checkers (Q814529) (← links)
- ASSAT: computing answer sets of a logic program by SAT solvers (Q814607) (← links)
- Answer set programming based on propositional satisfiability (Q861709) (← links)
- Design and results of the Fifth Answer Set Programming Competition (Q899444) (← links)
- Stable models and difference logic (Q1028651) (← links)
- Computing only minimal answers in disjunctive deductive databases (Q1040782) (← links)
- Reasoning with minimal models: efficient algorithms and applications (Q1127346) (← links)
- Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974) (← links)
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation (Q1363783) (← links)
- Polynomial-time computable stable models (Q1380428) (← links)
- Fixed-parameter tractability of disjunction-free default reasoning (Q1400063) (← links)
- Logic programming and knowledge representation---The A-Prolog perspective (Q1603731) (← links)
- On the computational cost of disjunctive logic programming: Propositional case (Q1924780) (← links)
- Connections between default reasoning and partial constraint satisfaction (Q1961815) (← links)
- Graph-based construction of minimal models (Q2093381) (← links)
- Assumption-based argumentation for extended disjunctive logic programming (Q2103901) (← links)
- DiMo -- discrete modelling using propositional logic (Q2118304) (← links)
- Default reasoning using classical logic (Q2171265) (← links)
- Making sense of sensory input (Q2238610) (← links)
- Paracoherent answer set computation (Q2238696) (← links)
- Forgetting auxiliary atoms in forks (Q2321342) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Deductive databases for computing certain and consistent answers from mediated data integration systems (Q2386182) (← links)
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits (Q2389669) (← links)
- Semantic forgetting in answer set programming (Q2389674) (← links)
- Outlier detection using default reasoning (Q2389688) (← links)
- Complexity results for answer set programming with bounded predicate arities and implications (Q2426101) (← links)
- On look-ahead heuristics in disjunctive logic programming (Q2426102) (← links)
- An incremental algorithm for generating all minimal models (Q2457647) (← links)
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835) (← links)
- Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs (Q2884255) (← links)
- On elementary loops of logic programs (Q2884258) (← links)
- Modular Paracoherent Answer Sets (Q2938513) (← links)
- Characterising equilibrium logic and nested logic programs: Reductions and complexity, (Q3181745) (← links)
- On the complexity of identifying head-elementary-set-free programs (Q3400962) (← links)
- (Q3413498) (← links)
- Solving Disjunctive Fuzzy Answer Set Programs (Q3449229) (← links)
- Finding Reductions Automatically (Q3586003) (← links)
- Answer Set Programming: A Primer (Q3638997) (← links)
- Some (in)translatability results for normal logic programs and propositional theories (Q3647255) (← links)
- (Q4235437) (← links)
- Partial deduction in disjunctive logic programming (Q4365083) (← links)
- Model-based recasting in answer-set programming (Q4583308) (← links)
- Knowledge compilation of logic programs using approximation fixpoint theory (Q4592990) (← links)
- Dual-normal logic programs – the forgotten class (Q4592993) (← links)
