Pages that link to "Item:Q861709"
From MaRDI portal
The following pages link to Answer set programming based on propositional satisfiability (Q861709):
Displaying 16 items.
- Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search (Q4988946) (← links)
- (Q5020979) (← links)
- Backdoors to Normality for Disjunctive Logic Programs (Q5277908) (← links)
- (Q5282991) (← links)
- Answer Set Programming for Single-Player Games in General Game Playing (Q5325764) (← links)
- Logic Programming and Nonmonotonic Reasoning (Q5424888) (← links)
- Logic Programming and Nonmonotonic Reasoning (Q5424889) (← links)
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets (Q5445291) (← links)
- Answer Set Programming without Unstratified Negation (Q5504649) (← links)
- Detecting Inconsistencies in Large Biological Networks with Answer Set Programming (Q5504653) (← links)
- On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP (Q5504658) (← links)
- Abstract Answer Set Solvers (Q5504668) (← links)
- An abstract view on optimizations in propositional frameworks (Q6496423) (← links)
- Aspmc: new frontiers of algebraic answer set counting (Q6566624) (← links)
- Logic programming (Q6602251) (← links)
- Common equivalence and size of forgetting from Horn formulae (Q6661056) (← links)