000			04149nam a22004455i 4500
999			_c387125 _d387125
001			387125
003			ES-MaUEC
005			20240111050230.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			220601s2016 sz | s |||| 0|eng d
020			_a9783031015731
024	7		_a10.1007/978-3-031-01573-1 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQ387 _b2016 EB
100	1		_aSanthanam, Ganesh Ram _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9686628
245	1	0	_aRepresenting and Reasoning with Qualitative Preferences : _bTools and Applications _cby Ganesh Ram Santhanam, Samik Basu, Vasant Honavar
250			_a1st edition 2016
264		1	_aCham _bSpringer International Publishing _c2016
300			_a1 recurso en línea (XV, 138 páginas)
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_aarchivo de texto _bPDF
490	0		_aSynthesis Lectures on Artificial Intelligence and Machine Learning _x1939-4616
505	0		_aAcknowledgments -- Qualitative Preferences -- Qualitative Preference Languages -- Model Checking and Computation Tree Logic -- Dominance Testing via Model Checking -- Verifying Preference Equivalence and Subsumption -- Ordering Alternatives With Respect to Preference -- CRISNER: A Practically Efficient Reasoner for Qualitative Preferences -- Postscript -- Bibliography -- Authors' Biographies .
520			_aThis book provides a tutorial introduction to modern techniques for representing and reasoning about qualitative preferences with respect to a set of alternatives. The syntax and semantics of several languages for representing preference languages, including CP-nets, TCP-nets, CI-nets, and CP-theories, are reviewed. Some key problems in reasoning about preferences are introduced, including determining whether one alternative is preferred to another, or whether they are equivalent, with respect to a given set of preferences. These tasks can be reduced to model checking in temporal logic. Specifically, an induced preference graph that represents a given set of preferences can be efficiently encoded using a Kripke Structure for Computational Tree Logic (CTL). One can translate preference queries with respect to a set of preferences into an equivalent set of formulae in CTL, such that the CTL formula is satisfied whenever the preference query holds. This allows us to use a model checker to reason about preferences, i.e., answer preference queries, and to obtain a justification as to why a preference query is satisfied (or not) with respect to a set of preferences. This book defines the notions of the equivalence of two sets of preferences, including what it means for one set of preferences to subsume another, and shows how to answer preferential equivalence and subsumption queries using model checking. Furthermore, this book demontrates how to generate alternatives ordered by preference, along with providing ways to deal with inconsistent preference specifications. A description of CRISNER-an open source software implementation of the model checking approach to qualitative preference reasoning in CP-nets, TCP-nets, and CP-theories is included, as well as examples illustrating its use.
988			_aSynthesis Collection of Technology_2016
650		7	_2embne _aInteligencia artificial _9413115
650		7	_2embne _9163512 _aInvestigación cualitativa
650		7	_2embne _9543538 _aRepresentación del conocimiento
700	1		_aBasu, Samik _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9686629
700	1		_aHonavar, Vasant _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9686630
776	0	8	_iPrinted edition: _z9783031004452
776	0	8	_iPrinted edition: _z9783031027017
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-01573-1 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b02/2023 _dz _esc _zSI