Progress in clasp Series 3

DOI10.1007/978-3-319-23264-5_31zbMath1467.68181OpenAlexW2401337862MaRDI QIDQ3449220

Torsten Schaub, Benjamin Kaufmann, Javier Romero, Roland Kaminski, Martin Gebser

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_31

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items

Shared aggregate sets in answer set programming, An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem, Lpopt: a rule optimization tool for answer set programming, Model enumeration in propositional circumscription via unsatisfiable core analysis, Anytime answer set optimization via unsatisfiable core shrinking, Stable-unstable semantics: Beyond NP with normal logic programs, Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper), Beyond NP: Quantifying over Answer Sets, Better Paracoherent Answer Sets with Less Resources, Partial Compilation of ASP Programs, Incremental Answer Set Programming with Overgrounding, 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, \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming, Coalition formation in social environments with logic-based agents1, Paracoherent answer set computation, 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, Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search

Uses Software

• clasp

Cites Work

• Unnamed Item
• Planning as satisfiability: heuristics
• Solving satisfiability problems with preferences
• Logic programming and nonmonotonic reasoning. 10th international conference, LPNMR 2009, Potsdam, Germany, September 14--18, 2009. Proceedings
• ASSAT: computing answer sets of a logic program by SAT solvers
• Answer set programming based on propositional satisfiability
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• Extending and implementing the stable model semantics
• Conflict-driven answer set solving: from theory to practice
• On the computational cost of disjunctive logic programming: Propositional case
• Multi-Criteria Optimization in Answer Set Programming
• Complex optimization in answer set programming
• Optimum stable model search: algorithms and implementation
• Computing Stable Models via Reductions to Difference Logic
• Knowledge Representation, Reasoning and Declarative Problem Solving
• ASP modulo CSP: The clingcon system
• Multi-threaded ASP solving with clasp
• Multi-shot ASP solving with clingo
• The DLV system for knowledge representation and reasoning
• Unsatisfiability-based optimization in clasp