Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search
From MaRDI portal
Publication:4988946
DOI10.3233/FI-2020-1974zbMATH Open1497.68451MaRDI QIDQ4988946
Publication date: 20 May 2021
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory and Applications of Satisfiability Testing
- Advances in WASP
- The ASP system DLV2
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems withIDP3
- Weight constraints as nested expressions
- Semantics and complexity of recursive aggregates in answer set programming
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Algorithms for Weighted Boolean Optimization
- On Solving the Partial MAX-SAT Problem
- On the relation among answer set solvers
- Answer set programming and plan generation
- Conflict-driven answer set solving: from theory to practice
- Logic programs with stable model semantics as a constraint programming paradigm
- Well-founded and stable semantics of logic programs with aggregates
- Solving SAT and SAT Modulo Theories
- Answer set programming based on propositional satisfiability
- Cores in Core Based MaxSat Algorithms: An Analysis
- A Constructive semantic characterization of aggregates in answer set programming
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
- Team-building with answer set programming in the Gioia-Tauro seaport
- Unsatisfiability-based optimization in clasp
- Logic Programming and Nonmonotonic Reasoning
- Logic programs with propositional connectives and aggregates
- The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics
- The design of the Seventh Answer Set Programming Competition
- Normalizing Cardinality Rules Using Merging and Sorting Constructions
- Optimum stable model search: algorithms and implementation
- LMHS: A SAT-IP Hybrid MaxSAT Solver
- Progress in clasp Series 3
- Answer Set Programming Modulo Acyclicity
- Shared aggregate sets in answer set programming
- Evaluating Answer Set Programming with Non-Convex Recursive Aggregates
- Rewriting recursive aggregates in answer set programming: back to monotonicity
- Web reasoning and rule systems. 9th international conference, RR 2015, Berlin, Germany, August 4--5, 2015. Proceedings
- Improving the Normalization of Weight Rules in Answer Set Programs
- Evaluation of disjunctive programs in WASP
- Anytime answer set optimization via unsatisfiable core shrinking
- Optimizing phylogenetic supertrees using answer set programming
- Combining Heuristics for Configuration Problems Using Answer Set Programming
Cited In (1)
Uses Software
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)
