Pages that link to "Item:Q2326731"
From MaRDI portal
The following pages link to Evaluation of disjunctive programs in WASP (Q2326731):
Displaying 10 items.
- New models for generating hard random Boolean formulas and disjunctive logic programs (Q2287195) (← links)
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835) (← links)
- A Logic-Based Framework Leveraging Neural Networks for Studying the Evolution of Neurological Disorders (Q4957216) (← links)
- Manipulation of Articulated Objects Using Dual-arm Robots via Answer Set Programming (Q4957224) (← links)
- Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search (Q4988946) (← links)
- (Q5020979) (← links)
- Enhancing Magic Sets with an Application to Ontological Reasoning (Q5108494) (← links)
- Beyond NP: Quantifying over Answer Sets (Q5108497) (← links)
- Abstract Solvers for Computing Cautious Consequences of ASP programs (Q5108499) (← links)
- Better Paracoherent Answer Sets with Less Resources (Q5108500) (← links)
