Evaluation of disjunctive programs in WASP
From MaRDI portal
Publication:2326731
Recommendations
Cited in
(20)- New models for generating hard random Boolean formulas and disjunctive logic programs
- Algorithm selection for paracoherent answer set computation
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
- Advances in WASP
- A logic-based framework leveraging neural networks for studying the evolution of neurological disorders
- Manipulation of articulated objects using dual-arm robots via answer set programming
- Unsatisfiable core analysis and aggregates for optimum stable model search
- scientific article; zbMATH DE number 7455719 (Why is no real title available?)
- Enhancing magic sets with an application to ontological reasoning
- Beyond NP: quantifying over answer sets
- Abstract Solvers for Computing Cautious Consequences of ASP programs
- Better paracoherent answer sets with less resources
- New encodings of the (Euclidean) travelling salesperson problem in constraint answer set programming on difference logic
- ASP-based approaches for solving the nuclear medicine scheduling problem
- Operating room scheduling via answer set programming: improved encoding and test on real data
- Scheduling pre-operative assessment clinic with answer set programming
- A simple proof-theoretic characterization of stable models: reduction to difference logic and experiments
- Declarative approaches to counterfactual explanations for classification
- Aggregate semantics for propositional answer set programs
- Body-decoupled grounding via reduction: a novel approach on the \textsc{Asp} bottleneck
This page was built for publication: Evaluation of disjunctive programs in WASP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2326731)