Propositional Distances and Preference Representation-Reference-Cited by-同舟云学术

Propositional Distances and Preference Representation

Published:2001 Issue: Volume: Page:48-59
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Lafage Céline,Lang JérΩe

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44652-4_6

Reference22 articles.

1. O. Bailleux, P. Marquis. DISTANCE-SAT: complexity and algorithms. Proceedings of AAAI’99, pages 642–647, 1999.

2. S. Benferhat, D. Dubois, S. Kaci and H. Prade. Encoding information fusion in possibilistic logic: a general framework for rational syntactic merging. Proceedings of ECAI’2000, 3–7.

3. I Blochand J. Lang. Towards mathematical morphologics. Proceedings of IPMU’2000.

4. B. Benhamou, L. Sais and P. Siegel. Two proof procedures for a cardinality-based language in propositional calculus. Proceedings of STACS’94.

5. C. Cayrol. Un mod`ele logique pour le raisonnement révisable (in French). Revue d’Intelligence Artificielle 6, 255–284, Hermés, 1992.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Boosting Distance-Based Revision Using SAT Encodings;Logic, Rationality, and Interaction;2017

2. A dissimilarity-based framework for generating inconsistency-tolerant logics;Annals of Mathematics and Artificial Intelligence;2013-02-14

3. Distance-Based Measures of Inconsistency;Lecture Notes in Computer Science;2013

4. Semantic Distance Measure between Ontology Concept’s Attributes;Knowledge-Based and Intelligent Information and Engineering Systems;2011

5. Preference Representation Languages;Working with Preferences: Less Is More;2011