Combining approaches for solving satisfiability problems with qualitative preferences

DOI10.3233/AIC-130575MaRDI QIDQ3191110zbMATH OpenOpenAlexFDO

Authors Emanuele Di Rosa, Enrico Giunchiglia

Publication date 24 September 2014

Published in AI Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/aic-130575

zbMATH Keywords

experimental evaluationpreferencessatisfiabilitysearch

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Algorithms for Solving Satisfiability Problems with Qualitative Preferences
• Solving satisfiability problems with preferences
• Introducing preferences in planning as satisfiability
• Planning as satisfiability with IPC simple preferences and action costs
• Hard and soft constraints for reasoning about qualitative conditional preferences

Cited in

(12)

• An abstract view on optimizations in SAT and ASP
• Fast, flexible MUS enumeration
• Combining preorder and postorder resolution in a satisfiability solver
• MCS Extraction with Sublinear Oracle Queries
• Algorithms for Solving Satisfiability Problems with Qualitative Preferences
• Implementing preferences with asprin
• Efficient MUS enumeration of Horn formulae with applications to axiom pinpointing
• scientific article; zbMATH DE number 2016106 (Why is no real title available?)
• Polarity and variable selection heuristics for SAT-based anytime MaxSAT
• A general framework for preferences in answer set programming
• Solving satisfiability problems with preferences
• An abstract view on optimizations in propositional frameworks

This page was built for publication: Combining approaches for solving satisfiability problems with qualitative preferences

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