Unsatisfiable core analysis and aggregates for optimum stable model search
From MaRDI portal
(Redirected from Publication:4988946)
Recommendations
Cites work
- A Constructive semantic characterization of aggregates in answer set programming
- Advances in WASP
- Algorithms for Weighted Boolean Optimization
- Answer set programming and plan generation
- Answer set programming based on propositional satisfiability
- Answer set programming modulo acyclicity
- Anytime answer set optimization via unsatisfiable core shrinking
- Combining Heuristics for Configuration Problems Using Answer Set Programming
- Conflict-driven answer set solving: from theory to practice
- Cores in core based MaxSat algorithms: an analysis
- Evaluating Answer Set Programming with Non-Convex Recursive Aggregates
- Evaluation of disjunctive programs in WASP
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 1368933 (Why is no real title available?)
- scientific article; zbMATH DE number 1884390 (Why is no real title available?)
- scientific article; zbMATH DE number 1890629 (Why is no real title available?)
- Improving the normalization of weight rules in answer set programs
- LMHS: a SAT-IP hybrid MaxSat solver
- Logic Programming and Nonmonotonic Reasoning
- Logic programs with propositional connectives and aggregates
- Logic programs with stable model semantics as a constraint programming paradigm
- Normalizing cardinality rules using merging and sorting constructions
- On Solving the Partial MAX-SAT Problem
- On the relation among answer set solvers
- Optimizing phylogenetic supertrees using answer set programming
- Optimum stable model search: algorithms and implementation
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3
- Progress in clasp series 3
- Rewriting recursive aggregates in answer set programming: back to monotonicity
- Semantics and complexity of recursive aggregates in answer set programming
- Shared aggregate sets in answer set programming
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- Team-building with answer set programming in the Gioia-Tauro seaport
- The ASP system DLV2
- The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics
- The design of the Seventh Answer Set Programming Competition
- Theory and Applications of Satisfiability Testing
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
- Unsatisfiability-based optimization in clasp
- Web reasoning and rule systems. 9th international conference, RR 2015, Berlin, Germany, August 4--5, 2015. Proceedings
- Weight constraints as nested expressions
- Well-founded and stable semantics of logic programs with aggregates
Cited in
(3)
This page was built for publication: Unsatisfiable core analysis and aggregates for optimum stable model search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4988946)