Advances in WASP
From MaRDI portal
Publication:3449189
DOI10.1007/978-3-319-23264-5_5zbMath1467.68021OpenAlexW2211798527WikidataQ62043819 ScholiaQ62043819MaRDI QIDQ3449189
Francesco Ricca, Nicola Leone, Carmine Dodaro, Mario Alviano
Publication date: 4 November 2015
Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-23264-5_5
Related Items
Interactive Debugging of Non-ground ASP Programs, The Design of the Sixth Answer Set Programming Competition, Shared aggregate sets in answer set programming, Cautious reasoning in ASP via minimal models and unsatisfiable cores, Model enumeration in propositional circumscription via unsatisfiable core analysis, Optimizing phylogenetic supertrees using answer set programming, Anytime answer set optimization via unsatisfiable core shrinking, Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper), ASP and subset minimality: enumeration, cautious reasoning and MUSes, Beyond NP: Quantifying over Answer Sets, Abstract Solvers for Computing Cautious Consequences of ASP programs, Better Paracoherent Answer Sets with Less Resources, Partial Compilation of ASP Programs, Inconsistency Proofs for ASP: The ASP - DRUPE Format, Incremental Answer Set Programming with Overgrounding, What is answer set programming to propositional satisfiability, Stepwise debugging of answer-set programs, Enumeration of minimal models and MUSes in WASP, Deep learning for the generation of heuristics in answer set programming: a case study of graph coloring, Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination, Solving problems in the polynomial hierarchy with ASP(Q), Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs, Rewriting optimization statements in answer-set programs, Managing caching strategies for stream reasoning with reinforcement learning, Incremental maintenance of overgrounded logic programs with tailored simplifications, Coalition formation in social environments with logic-based agents1, Paracoherent answer set computation, Multi-shot ASP solving with clingo, Introduction to the TPLP Special Issue on User-oriented Logic Programming and Reasoning Paradigms, Answering the “why” in answer set programming – A survey of explanation approaches, Debugging Non-ground ASP Programs: Technique and Graphical Tools, New models for generating hard random Boolean formulas and disjunctive logic programs, Optimizing Answer Set Computation via Heuristic-Based Decomposition, The Seventh Answer Set Programming Competition: Design and Results, Efficiently Coupling the I-DLV Grounder with ASP Solvers, The External Interface for Extending WASP, Boosting Answer Set Optimization with Weighted Comparator Networks, WASP, Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search
Cites Work
- Unnamed Item
- Unnamed Item
- SAT-based MaxSAT algorithms
- ASSAT: computing answer sets of a logic program by SAT solvers
- Extending and implementing the stable model semantics
- Conflict-driven answer set solving: from theory to practice
- Iterative and core-guided maxsat solving: a survey and assessment
- Improvements to Core-Guided Binary Search for MaxSAT
- Team-building with answer set programming in the Gioia-Tauro seaport
- Anytime Computation of Cautious Consequences in Answer Set Programming
- On Computing Backbones of Propositional Theories
- Optimum stable model search: algorithms and implementation
- Some (in)translatability results for normal logic programs and propositional theories
- GRASP: a search algorithm for propositional satisfiability
- Answer sets for consistent query answering in inconsistent databases
- The DLV system for knowledge representation and reasoning
- Consistent query answering via ASP from different perspectives: Theory and practice
- Unsatisfiability-based optimization in clasp
- Logic Programming and Nonmonotonic Reasoning
- Theory and Applications of Satisfiability Testing
