In this paper we introduce preference rules which allow us to specify preferences as an ordering among the possible solutions of a problem.
We introduce a general, flexible, and extensible framework for quantitative and qualitative preferences among the stable models of logic programs.
desires for general theories. We use Answer Set Program- ming as the formalism to develop our work. 1. Introduction. Preferences can be used to compare feasible ...
The paper describes a concrete implementation that leverages answer set programming for determining the evo- lution of an agent's “belief state”, based on ...
A general framework for preferences in answer set programming
dl.acm.org › doi › j.artint.2023.104023
Dec 1, 2023 · We introduce a general, flexible, and extensible framework for quantitative and qualitative preferences among the stable models of logic ...
Mar 3, 2015 · To a turn, we build upon these basic graph-theoretical characterizations for developing an operational framework for non-deterministic answer ...
• Answer set programming: general ideas and examples. • Application of answer ... contains preferences between defaults (prefer a conclusion/default).
Abstract. In this paper we describe asprin1, a general, flexible, and ex- tensible framework for handling preferences among the sta-.
Son, Planning with preferences using logic programming, Theory Pract. ... Eiter, Finding similar/diverse solutions in answer set programming, Theory Pract.
Abstract. An approach based on answer set programming (ASP) is proposed in this paper for representing knowledge generated from natural language text.