A language-independent framework for reasoning about preferences for declarative problem solving

DOI10.1007/978-3-030-29007-8_4zbMath1435.68301MaRDI QIDQ2180217

Alireza Ensan, Eugenia Ternovska

Publication date: 13 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-29007-8_4

zbMATH Keywords

preference; model expansion; computational problems

Mathematics Subject Classification ID

68Q60: Specification and verification (program logics, model checking, etc.)

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

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Related Items

A general framework for preferences in answer set programming