Properties and Modeling of Partial Conjunction/Disjunction
The partial conjunction/disjunction function (PCD) integrates conjunctive and disjunctive features in a single function. It is used as a mathematical model of simultaneity and replaceability of inputs. Special cases of this function include the full (pure) conjunction, the partial conjunction, the arithmetic mean, the partial disjunction, and the full (pure) disjunction. PCD enables a continuous transition from the full conjunction to the full disjunction, using a parameter that specifies a desired level of conjunction (andness) or disjunction (orness). In this paper, we investigate and compare various versions of PCD and other mathematical models that are applicable in the areas of system evaluation, and information retrieval.
Jozo Dujmovic was born in Dubrovnik, and received his BSEE, MS, and Sc.D. degrees from the University of Belgrade. He is a Professor of Computer Science at San Francisco State University, where he served for four years as Chairman of Computer Science Department. His teaching and research activities are in the areas of software metrics, decision analysis, and computer performance evaluation. He is the author of the LSP method for system evaluation and more than 100 refereed publications, recipient of three best paper awards, and a Senior Member of IEEE. He served as General Chair of IEEE MASCOTS 2000 and as General Chair of ACM WOSP 2004
Henrik Legind Larsen is Professor of Computer Science at Aalborg University Esbjerg and the founder of XSIS, a company that develops intelligent software for security applications. His main research areas are fuzzy systems, information retrieval and knowledge engineering. He is the author of the AIWA operator that is successfully used in search engines. He published numerous papers in leading fuzzy systems and knowledge engineering journals.