Progress in clasp series 3

DOI10.1007/978-3-319-23264-5_31MaRDI QIDQ3449220zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Multi-threaded ASP solving with clasp
• ASP modulo CSP: the clingcon system
• claspfolio2: Advances in Algorithm Selection for Answer Set Programming
• A tutorial on hybrid answer set solving with \textit{clingo}
• \textit{clingcon}: the next generation

Cites work

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

Cited in

(29)

• \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
• Paracoherent answer set computation
• Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination
• Solving problems in the polynomial hierarchy with ASP(Q)
• An application of clasp in the study of logics
• Shared aggregate sets in answer set programming
• An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
• 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)
• Multi-threaded ASP solving with clasp
• Optimizing answer set computation via heuristic-based decomposition
• The Seventh Answer Set Programming Competition: Design and Results
• Technical note. Efficiently coupling the \(\mathscr{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
• Beyond NP: quantifying over answer sets
• Better paracoherent answer sets with less resources
• Partial compilation of ASP programs
• Incremental answer set programming with overgrounding
• Coalition formation in social environments with logic-based agents1
• Treewidth in non-ground answer set solving and alliance problems in graphs
• Short Boolean formulas as explanations in practice
• New encodings of the (Euclidean) travelling salesperson problem in constraint answer set programming on difference logic
• Comparison of SAT-based and ASP-based algorithms for inconsistency measurement
• Capturing (optimal) relaxed plans with stable and supported models of logic programs
• Body-decoupled grounding via reduction: a novel approach on the \textsc{Asp} bottleneck

Describes a project that uses

Uses Software

• clasp

This page was built for publication: Progress in clasp series 3

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449220)