Combining approaches for solving satisfiability problems with qualitative preferences

DOI10.3233/AIC-130575zbMath1296.68164OpenAlexW2160345156MaRDI QIDQ3191110

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

preferencessatisfiabilitysearchexperimental evaluation

Mathematics Subject Classification ID

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

Related Items (7)

Fast, flexible MUS enumeration ⋮ Implementing Preferences with asprin ⋮ Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing ⋮ A general framework for preferences in answer set programming ⋮ MCS Extraction with Sublinear Oracle Queries ⋮ An abstract view on optimizations in SAT and ASP ⋮ Polarity and Variable Selection Heuristics for SAT-Based Anytime MaxSAT

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