Handbook of logic in artificial intelligence and logic programming (vol. 3)
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
A requires/provides model for computer attacks
Proceedings of the 2000 workshop on New security paradigms
Constructing attack scenarios through correlation of intrusion alerts
Proceedings of the 9th ACM conference on Computer and communications security
Knowledge-Driven versus Data-Driven Logics
Journal of Logic, Language and Information
STATL: an attack language for state-based intrusion detection
Journal of Computer Security
Practical automated detection of stealthy portscans
Journal of Computer Security
Autonomous Agents and Multi-Agent Systems
Probabilistic Alert Correlation
RAID '00 Proceedings of the 4th International Symposium on Recent Advances in Intrusion Detection
Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Bipolarity in Possibilistic Logic and Fuzzy Rules
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Preferences; Putting More Knowledge into Queries
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Logic programming with ordered disjunction
Eighteenth national conference on Artificial intelligence
Alert Correlation in a Cooperative Intrusion Detection Framework
SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
Managing Alerts in a Multi-Intrusion Detection Environment
ACSAC '01 Proceedings of the 17th Annual Computer Security Applications Conference
Artificial Intelligence - Special issue: Fuzzy set and possibility theory-based methods in artificial intelligence
Clustering intrusion detection alarms to support root cause analysis
ACM Transactions on Information and System Security (TISSEC)
On the revision of preferences and rational inference processes
Artificial Intelligence
On Stratified Belief Base Compilation
Annals of Mathematics and Artificial Intelligence
Artificial Intelligence - Special issue on nonmonotonic reasoning
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Journal of Artificial Intelligence Research
Analyzing intensive intrusion alerts via correlation
RAID'02 Proceedings of the 5th international conference on Recent advances in intrusion detection
Bipolar preference problems: framework, properties and solving techniques
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Reasoning with conditional ceteris paribus preference statements
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
| Hi-index | 0.20 |
Reasoning about preferences is a major issue in many decision making problems. Recently, a new logic for handling preferences, called qualitative choice logic (QCL), was presented. This logic adds to classical propositional logic a new connective, called ordered disjunction symbolized by x@?. That new connective is used to express preferences between alternatives. Intuitively, if A and B are propositional formulas then Ax@?B means: ''if possible A, but if A is impossible then at least B''. One of the important limitations of QCL is that it does not correctly deal with negated and conditional preferences. Conditional rules that involve preferences are expressed using propositional implication. However, using QCL semantics, there is no difference between such material implication ''(KLMx@?AirFrance)@?HotelPackage'' and the purely propositional formula ''(AirFrance@?KLM)@?HotelPackage''. Moreover, the negation in QCL misses some desirable properties from propositional calculus. This paper first proposes an extension of QCL language to universally quantified first-order logic framework. Then, we propose two new logics that correctly address QCL's limitations. Both of them are based on the same QCL language, but define new non-monotonic consequence relations. The first logic, called PQCL (prioritized qualitative choice logic), is particularly adapted for handling prioritized preferences, while the second one, called QCL+ (positive qualitative choice logic), is appropriate for handling positive preferences. In both cases, we show that any set of preferences, can equivalently be transformed into a set of basic preferences from which efficient inferences can be applied. Lastly, we show how our logics can be applied to alert correlation.