The following pages link to Advances in WASP (Q3449189):
Displaying 41 items.
- WASP (Q21546) (← links)
- What is answer set programming to propositional satisfiability (Q1699519) (← links)
- Paracoherent answer set computation (Q2238696) (← links)
- New models for generating hard random Boolean formulas and disjunctive logic programs (Q2287195) (← links)
- Enumeration of minimal models and MUSes in WASP (Q2694547) (← links)
- Deep learning for the generation of heuristics in answer set programming: a case study of graph coloring (Q2694562) (← links)
- Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination (Q2694569) (← links)
- Solving problems in the polynomial hierarchy with ASP(Q) (Q2694590) (← links)
- Interactive Debugging of Non-ground ASP Programs (Q3449213) (← links)
- The Design of the Sixth Answer Set Programming Competition (Q3449235) (← links)
- Shared aggregate sets in answer set programming (Q4559794) (← links)
- Cautious reasoning in ASP via minimal models and unsatisfiable cores (Q4559795) (← links)
- Model enumeration in propositional circumscription via unsatisfiable core analysis (Q4592705) (← links)
- Optimizing phylogenetic supertrees using answer set programming (Q4593001) (← links)
- Anytime answer set optimization via unsatisfiable core shrinking (Q4593041) (← links)
- Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper) (Q4593048) (← links)
- Stepwise debugging of answer-set programs (Q4603428) (← links)
- Optimizing Answer Set Computation via Heuristic-Based Decomposition (Q4957190) (← links)
- The Seventh Answer Set Programming Competition: Design and Results (Q4957192) (← links)
- Efficiently Coupling the I-DLV Grounder with ASP Solvers (Q4957193) (← links)
- The External Interface for Extending WASP (Q4957194) (← links)
- Boosting Answer Set Optimization with Weighted Comparator Networks (Q4957202) (← links)
- Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search (Q4988946) (← 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)
- Partial Compilation of ASP Programs (Q5108506) (← links)
- Inconsistency Proofs for ASP: The ASP - DRUPE Format (Q5108508) (← links)
- Incremental Answer Set Programming with Overgrounding (Q5108513) (← links)
- Managing caching strategies for stream reasoning with reinforcement learning (Q5140004) (← links)
- Incremental maintenance of overgrounded logic programs with tailored simplifications (Q5140010) (← links)
- Coalition formation in social environments with logic-based agents1 (Q5145446) (← links)
- Multi-shot ASP solving with clingo (Q5197744) (← links)
- Introduction to the TPLP Special Issue on User-oriented Logic Programming and Reasoning Paradigms (Q5197746) (← links)
- Answering the “why” in answer set programming – A survey of explanation approaches (Q5197747) (← links)
- Debugging Non-ground ASP Programs: Technique and Graphical Tools (Q5197755) (← links)
- Rewriting optimization statements in answer-set programs (Q5240209) (← links)
- Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs (Q5240230) (← links)
- ASP and subset minimality: enumeration, cautious reasoning and MUSes (Q6103676) (← links)
- Short Boolean formulas as explanations in practice (Q6545522) (← links)
- Adaptive large-neighbourhood search for optimisation in answer-set programming (Q6665706) (← links)
