Abstract
By classical results of Abadi and Halpern, validity for probabilistic first-order logic of type 2 (ProbFO) is \(\Pi^2_1\)-complete and thus not recursively enumerable, and even small fragments of ProbFO are undecidable. In temporal first-order logic, which has similar computational properties, these problems have been addressed by imposing monodicity, that is, by allowing temporal operators to be applied only to formulas with at most one free variable. In this paper, we identify a monodic fragment of ProbFO and show that it enjoys favorable computational properties. Specifically, the valid sentences of monodic ProbFO are recursively enumerable and a slight variation of Halpern’s axiom system for type-2 ProbFO on bounded domains is sound and complete for monodic ProbFO. Moreover, decidability can be obtained by restricting the FO part of monodic ProbFO to any decidable FO fragment. In some cases, which notably include the guarded fragment, our general constructions result in tight complexity bounds.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abadi, M., Halpern, J.: Decidability and expressiveness for first-order logics of probability. Inf. Comput. 112, 1–36 (1994)
Andréka, H., van Benthem, J., Németi, I.: Back and forth between modal logic and classical logic. Logic J. IGPL 3, 685–720 (1995)
Artin, E., Schreier, O.: Algebraische Konstruktion reeller Körper. Abh. Math. Sem. Univ. Hamburg 5, 85–99 (1927)
Bacchus, F.: Representing and reasoning with probabilistic knowledge - a logical approach to probabilities. MIT Press (1990)
Bacchus, F., Grove, A., Koller, D., Halpern, J.: From statistics to beliefs. In: Artificial Intelligence, AAAI 1992, pp. 602–608. AAAI Press/The MIT Press (1992)
Bárány, V., ten Cate, B., Segoufin, L.: Guarded negation. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 356–367. Springer, Heidelberg (2011)
Enderton, H.B.: A mathematical introduction to logic. Academic Press (1972)
Gabbay, D., Kurucz, A., Wolter, F., Zakharyaschev, M.: Many-dimensional modal logics: theory and applications. Studies in Logic, vol. 148. Elsevier (2003)
Getoor, L., Taskar, B.: Introduction to Statistical Relational Learning. MIT Press (2007)
Grädel, E., Kolaitis, P., Vardi, M.: On the decision problem for two-variable first-order logic. Bull. Symb. Log. 3, 53–69 (1997)
Gutiérrez-Basulto, V., Jung, J., Lutz, C., Schröder, L.: A closer look at the probabilistic description logic prob-\(\mathcal{EL}\). In: Artificial Intelligence, AAAI 2011. AAAI Press (2011)
Halpern, J.: An analysis of first-order logics of probability. Artif. Intell. 46, 311–350 (1990)
Harel, D.: Recurring dominoes: making the highly undecidable highly understandable. Ann. Discrete Math. 24, 51–72 (1985)
Hodkinson, I.: Monodic packed fragment with equality is decidable. Stud. Log. 72, 185–197 (2002)
Hodkinson, I.: Complexity of monodic guarded fragments over linear and real time. Ann. Pure Appl. Logic 138, 94–125 (2006)
Hodkinson, I., Kontchakov, R., Kurucz, A., Wolter, F., Zakharyaschev, M.: On the computational complexity of decidable fragments of first-order linear temporal logics. In: Proc. TIME-ICTL 2003, pp. 91–98. IEEE Computer Society (2003)
Hodkinson, I., Wolter, F., Zakharyaschev, M.: Decidable fragment of first-order temporal logics. Ann. Pure Appl. Logic 106, 85–134 (2000)
Hodkinson, I., Wolter, F., Zakharyaschev, M.: Monodic fragments of first-order temporal logics: 2000-2001 A.D. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 1–23. Springer, Heidelberg (2001)
Koller, D., Halpern, J.: Irrelevance and conditioning in first-order probabilistic logic. In: Proc. AAAI/IAAI 1096, pp. 569–576. AAAI Press / The MIT Press (1996)
Lutz, C., Schröder, L.: Probabilistic description logics for subjective uncertainty. In: Principles of Knowledge Representation and Reasoning, KR 2010. AAAI Press (2010)
Richardson, M., Domingos, P.: Markov logic networks. Machine Learning 62, 107–136 (2006)
Schaefer, M.: Complexity of some geometric and topological problems. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 334–344. Springer, Heidelberg (2010)
Wolter, F., Zakharyaschev, M.: Axiomatizing the monodic fragment of first-order temporal logic. Ann. Pure Appl. Logic 118, 133–145 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jung, J.C., Lutz, C., Goncharov, S., Schröder, L. (2014). Monodic Fragments of Probabilistic First-Order Logic. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds) Automata, Languages, and Programming. ICALP 2014. Lecture Notes in Computer Science, vol 8573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43951-7_22
Download citation
DOI: https://doi.org/10.1007/978-3-662-43951-7_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-43950-0
Online ISBN: 978-3-662-43951-7
eBook Packages: Computer ScienceComputer Science (R0)