Abstract
We study probabilistic-logic reasoning in a context that allows for “partial truths”, focusing on computational and algorithmic properties of non-classical Łukasiewicz Infinitely-valued Probabilistic Logic. In particular, we study the satisfiability of joint probabilistic assignments, which we call ŁIPSAT. Although the search space is initially infinite, we provide linear algebraic methods that guarantee polynomial size witnesses, placing ŁIPSAT complexity in the NP-complete class. An exact satisfiability decision algorithm is presented which employs, as a subroutine, the decision problem for Łukasiewicz Infinitely-valued (non probabilistic) logic, that is also an NP-complete problem. We investigate efficient representation of rational McNaughton functions in Łukasiewicz Infinitely-valued Logic modulo satisfiability.
Similar content being viewed by others
Notes
By the term “partial truth” we refer to the concept usually referred in the literature as “degree of truth”, not to be confused with partial valuations or models.
An earlier version of this paper has appeared in [15]. In this work we present proofs of lemmas and theorems that were omitted. Section 5 on representation of rational McNaughton functions is totally new; on the other hand, due to space limitations, implementational and experimental issues have been omitted.
Thus C is more restrictive than the full class of states of an MV-algebra, in the sense of [26], which will not be discussed here.
We abuse the notation by using the same symbols for the propositional variables and for the metavariables in the functions description.
These functions are only different from the Schauder hats in [24] on the values \(\beta _i\in {\mathbb {Q}}\).
Of course, since such classes are identified with rational McNaughton functions, that was already a consequence of Theorem 5.
References
Aguzzoli, S., Mundici, D.: Weierstrass Approximation Theorem and Łukasiewicz Formulas with One Quantified Variable, pp. 315–335. Physica-Verlag HD, Heidelberg (2003)
Bertsimas, D., Tsitsiklis, J.: Introduction to Linear Optimization. Athena Scientific Series in Optimization and Neural Computation. Athena Scientific, Belmont (1997)
Bofill, M., Manya, F., Vidal, A., Villaret, M.: Finding hard instances of satisfiability in Łukasiewicz logics. In: ISMVL. IEEE, pp. 30–35 (2015)
Boole, G.: An Investigation on the Laws of Thought. Macmillan, London (1854). http://www.gutenberg.org/etext/15114
Borgward, K.H.: The Simplex Method: A Probabilistic Analysis. Algorithms and Combinatorics, vol. 1. Springer, Berlin (1986)
Bova, S., Flaminio, T.: The coherence of Łukasiewicz assessments is NP-complete. Int. J. Approx. Reason. 51(3), 294–304 (2010). https://doi.org/10.1016/j.ijar.2009.10.002
Cignoli, R., d’Ottaviano, I., Mundici, D.: Algebraic Foundations of Many-Valued Reasoning. Trends in Logic. Springer, Berlin (2000)
de Finetti, B.: La prévision: Ses lois logiques, ses sources subjectives (1937)
de Finetti, B.: Sul significato soggettivo della probabilità. Fundam. Math. 17(1), 298–329 (1931)
de Finetti, B.: Theory of Probability: A Critical Introductory Treatment. Translated by Antonio Machí and Adrian Smith. Wiley, Hoboken (2017)
Eckhoff, J.: Helly, Radon, and Caratheodory type theorems. In: Gruber, P.M., Wills, J.M. (eds.) Handbook of Convex Geometry, pp. 389–448. Elsevier Science Publishers (1993)
Esteva, F., Godo, L., Montagna, F.: The Ł\(\Pi \) and Ł\(\Pi \frac{1}{2}\) logics: two complete fuzzy systems joining Łukasiewicz and product logics. Arch. Math. Logic 40(1), 39–67 (2001)
Finger, M., Bona, G.D.: Probabilistic satisfiability: logic-based algorithms and phase transition. In: Walsh, T. (ed.) IJCAI, IJCAI/AAAI, pp. 528–533 (2011)
Finger, M., De Bona, G.: Probabilistic satisfiability: algorithms with the presence and absence of a phase transition. AMAI 75(3), 351–379 (2015). https://doi.org/10.1007/s10472-015-9466-6
Finger, M., Preto, S.: Probably half true: probabilistic satisfiability over Łukasiewicz infinitely-valued logic. In: Galmiche, D., Schulz, S., Sebastiani, R. (eds.) Automated Reasoning, pp. 194–210. Springer, Cham (2018)
Georgakopoulos, G., Kavvadias, D., Papadimitriou, C.H.: Probabilistic satisfiability. J. Complex. 4(1), 1–11 (1988). https://doi.org/10.1016/0885-064X(88)90006-4
Gerla, B.: Rational Łukasiewicz logic and DMV-algebras. Neural Netw. World 11(6), 579–594 (2001)
Hähnle, R.: Towards an efficient tableau proof procedure for multiple-valued logics. In: Börger, E., Kleine Büning, H., Richter, M.M., Schönfeld, W. (eds.) Computer Science Logic, pp. 248–260. Springer, Heidelberg (1991)
Hansen, P., Jaumard, B.: Algorithms for the maximum satisfiability problem. Computing 44, 279–303 (1990). https://doi.org/10.1007/BF02241270
Hansen, P., Jaumard, B.: Probabilistic satisfiability. In: Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol. 5, p. 321. Springer (2000)
Kavvadias, D., Papadimitriou, C.H.: A linear programming approach to reasoning about probabilities. AMAI 1, 189–205 (1990). https://doi.org/10.1007/BF01531078
McNaughton, R.: A theorem about infinite-valued sentential logic. J. Symb. Logic 16, 1–13 (1951)
Mundici, D.: Satisfiability in many-valued sentential logic is NP-complete. Theor. Comput. Sci. 52(1–2), 145–153 (1987)
Mundici, D.: A constructive proof of McNaughton’s theorem in infinite-valued logics. J. Symb. Logic 59(2), 596–602 (1994)
Mundici, D.: Bookmaking over infinite-valued events. Int. J. Approx. Reason. 43(3), 223–240 (2006). https://doi.org/10.1016/j.ijar.2006.04.004
Mundici, D.: Advanced Łukasiewicz Calculus and MV-Algebras. Trends in Logic. Springer, Dordrecht (2011)
Nilsson, N.: Probabilistic logic. Artif. Intell. 28(1), 71–87 (1986)
Papadimitriou, C., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover, New York (1998)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This study was financed in part by the Coordenação de Aperfeiçoamento de Pessoal de Nível Superior—Brasil (CAPES)— Finance Code 001; M. Finger—Partially supported by Fapesp Projects 2015/21880-4 and 2014/12236-1 and CNPq Grant PQ 303609/2018-4.
Rights and permissions
About this article
Cite this article
Finger, M., Preto, S. Probably Partially True: Satisfiability for Łukasiewicz Infinitely-Valued Probabilistic Logic and Related Topics. J Autom Reasoning 64, 1269–1286 (2020). https://doi.org/10.1007/s10817-020-09558-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10817-020-09558-9