References
- Baioletti, M., and A. Capotorti. 2015. “Efficient L1-Based Probability Assessments Correction: Algorithms and Applications to Belief Merging and Revision.” In ISIPTA'15 Proc. of the 9th International Symposium on Imprecise Probability: Theories and Applications, 37–46. Pescara (IT): ARACNE.
- Baioletti, M., and A. Capotorti. 2017. An Efficient Probabilistic Merging Procedure Applied to Statistical Matching. 10351: Lecture Notes in Computer Science. 65–74. LNCS.
- Coletti, G., and R. Scozzafava. 2002. Probabilistic Logic in a Coherent Setting. Series “Trends in Logic”, Dordrecht: Kluwer.
- Cozman, F. G., and L. Fargoni di Ianni. 2013. Probabilistic Satisfiability and Coherence Checking Through Integer Programming. Vol. 7958, 145–156.
- Cozman, F. G., and L. Fargoni di Ianni. 2015. “Probabilistic Satisfiability and Coherence Checking Through Integer Programming.” International Journal of Approximate Reasoning 58: 57–70. doi: 10.1016/j.ijar.2014.09.002
- Di Zio, M., and B. Vantaggi. 2017. “Partial Identification in Statistical Matching with Misclassification.” International Journal of Approximate Reasoning 82: 227–241. doi: 10.1016/j.ijar.2016.12.015
- D'Orazio, M., M. Di Zio, and M. Scanu. 2006a. Statistical Matching: Theory and Practice. New York: Wiley.
- D'Orazio, M., M. Di Zio, and M. Scanu. 2006b. “Statistical Matching for Categorical Data: Displaying Uncertainty and Using Logical Constraints.” Journal of Official Statistics 22: 137–157.
- GAMS Development Corporation. 2018. General Algebraic Modeling System (GAMS) Release 25.0.3. Washington, DC, USA.
- Georgakopoulos, G., D. Kavvadias, and C. H. Papadimitriou. 1988. “Probabilistic Satisfiability.” Journal of Complexity 4: 1–11. doi: 10.1016/0885-064X(88)90006-4
- Levi, I. 1980. The Enterprise of Knowledge. Cambridge, MA: MIT Press.
- Levi, I. 1986. Hard Choices: Decision Making Under Unresolved Conflict. Cambridge: Cambridge University Press.
- Vantaggi, B. 2008. “Statistical Matching of Multiple Sources: A Look Through Coherence.” International Journal of Approximate Reasoning 49 (3): 701–711. doi: 10.1016/j.ijar.2008.07.005