Unsatisfiable core analysis and aggregates for optimum stable model search

DOI10.3233/FI-2020-1974zbMATH Open1497.68451MaRDI QIDQ4988946FDOQ4988946

Authors: M. Alviano, Carmine Dodaro 

Publication date: 20 May 2021

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Recommendations

• Optimum stable model search: algorithms and implementation
• Anytime answer set optimization via unsatisfiable core shrinking
• Unsatisfiability-based optimization in clasp
• Cautious reasoning in ASP via minimal models and unsatisfiable cores
• Max-ASP: Maximum Satisfiability of Answer Set Programs

zbMATH Keywords

answer set programmingweak constraintsunsatisfiable core analysis

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Cites Work

• 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 with IDP3
• Title not available (Why is that?)
• 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, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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 (3)

• Witnesses for Answer Sets of Logic Programs
• Anytime answer set optimization via unsatisfiable core shrinking
• Unsatisfiability-based optimization in clasp

Uses Software

• MiniSat
• Cmodels
• clasp
• WASP
• LMHS
• maxino
• DLV2

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)