دانلود کتاب Representing and Reasoning with Qualitative Preferences: Tools and Applications

فهرست مطالب :

Cover
Copyright Page
Title Page
Dedication
Contents
Acknowledgments
Qualitative Preferences
Motivating Examples
Cyberdefense Policy
Education
Software Engineering
Countermeasures for Network Security
Minimizing Credential Disclosure
Organization of the Book
Qualitative Preference Languages
Preliminaries
Notation
Succinct Preference Specification
Qualitative Preference Languages
Representing Qualitative Preferences
Preference Semantics
CP-nets
TCP-nets
CP-Theories
CI-nets
Relative Expressive Power
Reasoning with Qualitative Preferences
Ceteris Paribus Preference Semantics
Semantics for a Preference Specification as Induced Preference Graphs
Dominance and Consistency in Qualitative Preference Languages
Complexity of Reasoning
Model Checking and Computation Tree Logic
Introduction
Kripke Structure
Computation Tree Temporal Logic
Syntax
Semantics
Model Checking Algorithm
NuSMV Model Checker
NuSMV Language & Counterexamples
Dominance Testing via Model Checking
Dominance Testing of Unconditional Preferences
Syntax of L
Semantics of L
Properties of Unconditional Dominance Relation
Complexity of Dominance Testing in L
Expressiveness
Preference Reasoning via Model Checking
Kripke Structure Encoding of Induced Preference Graph
Correctness of the Construction of K(P)
Answering Dominance Queries via Model Checking
Verifying Dominance
Extracting a Proof of Dominance
Summary and Discussion
Verifying Preference Equivalence and Subsumption
Preference Equivalence and Preference Subsumption
Data Structures to Represent Semantics of Two Sets of Preference
Inverse Induced Preference Graph
Combined Induced Preference Graph
Kripke Structure Encoding for Preference Equivalence and Subsumption
Modeling of Preference Semantics: Extension for Preference Equivalence and Preference Subsumption Reasoning
Encoding Combined Induced Preference Graph as Kripke Structure
Querying K(P_1,P_2) for Subsumption
Extracting a Proof of Non-subsumption
Verifying Preference Equivalence
Discussion
Ordering Alternatives With Respect to Preference
Overview
Kripke Encoding
Objective: Computing an Ordered Sequence
Computation of Ordered alternative Sequence
Dealing with SCCs in Induced Preference Graph
Iterative Model Refinement and Property Relaxation
Sample Run of the Algorithm on Example in Figure 6.1(b)
Number of Model Checking Calls
Properties of Next-Pref
Summary
CRISNER: A Practically Efficient Reasoner for Qualitative Preferences
Overview
Justification of Query Answers
Tool Architecture
Preference Queries
XML Input Language
Defining Preference Variables
Specifying Conditional Preference Statements
Specifying Relative Importance Preferences
Encoding Preferences as SMV Models
Encoding Preference Variables & Auxiliary Variables
Encoding Preference Statements
Justification of Query Results
Architecture
Extending CRISNER
Scalability
Concluding Remarks
Postscript
SMV Model Listings
SMV Model Listing for PCP
Dominance Query and NuSMV Output for PCP
SMV Model Listing for PTCP
Dominance Query and NuSMV Output for PTCP
SMV Model Listing for PCPT
Dominance Query and NuSMV Output for PCPT
Providing XML Input to CRISNER
XML Input Listing for PCP
XML Input Listing for PTCP
XML Input Listing for PCPT
SMV Models & CTL Queries for Preference Equivalence and Subsumption
SMV Model for K(PCP,PTCP)
SMV Model for K(PTCP,PCPT)
SMV Model for K(PCPT,PCP)
Preference Subsumption Query PTCP PCP on K(PTCP,PCP)
Preference Subsumption Query PCP PTCP on K(PCP,PTCP)
Preference Subsumption Query PTCP PCPT on K(PTCP,PCPT)
Preference Subsumption Query PCPT PTCP on K(PCPT,PTCP)
Preference Subsumption Query PCP PCPT on K(PCPT,PTCP)
Preference Subsumption Query PCPT PTCP on K(PCPT,PCP)
Bibliography
Authors\' Biographies