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

DOI10.1007/978-3-030-29007-8_4zbMath1435.68301OpenAlexW2969945018MaRDI 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

preferencemodel expansioncomputational problems

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

A general framework for preferences in answer set programming

This page was built for publication: A language-independent framework for reasoning about preferences for declarative problem solving