Unsatisfiability-based optimization in clasp
From MaRDI portal
Publication:5398060
DOI10.4230/LIPIcs.ICLP.2012.211zbMath1281.68204OpenAlexW2274933339MaRDI QIDQ5398060
Benjamin Andres, Oliver Matheis, Torsten Schaub, Benjamin Kaufmann
Publication date: 25 February 2014
Full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2012/3623/pdf/21.pdf/
Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (27)
Best-effort inductive logic programming via fine-grained cost-based hypothesis generation. The Inspire system at the inductive logic programming competition ⋮ Advances in WASP ⋮ Progress in clasp Series 3 ⋮ Shared aggregate sets in answer set programming ⋮ An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem ⋮ WPM3: an (in)complete algorithm for weighted partial MaxSAT ⋮ Model enumeration in propositional circumscription via unsatisfiable core analysis ⋮ aspeed: Solver scheduling via answer set programming ⋮ Anytime answer set optimization via unsatisfiable core shrinking ⋮ Clingcon: The next generation ⋮ \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming ⋮ Paracoherent answer set computation ⋮ Exploiting subproblem optimization in SAT-based maxsat algorithms ⋮ Meta-interpretive learning: application to grammatical inference ⋮ Multi-shot ASP solving with clingo ⋮ Boosting Answer Set Optimization with Weighted Comparator Networks ⋮ Omission-Based Abstraction for Answer Set Programs ⋮ Train Scheduling with Hybrid Answer Set Programming ⋮ Abstraction for non-ground answer set programs ⋮ An abstract view on optimizations in SAT and ASP ⋮ Writing Declarative Specifications for Clauses ⋮ Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search ⋮ Backdoors to tractable answer set programming ⋮ On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving ⋮ RC2: an Efficient MaxSAT Solver ⋮ Iterative and core-guided maxsat solving: a survey and assessment ⋮ A proof builder for Max-SAT
Uses Software
This page was built for publication: Unsatisfiability-based optimization in clasp
