{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T08:11:56Z","timestamp":1767773516357,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439500"},{"type":"electronic","value":"9783662439517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43951-7_22","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T08:37:49Z","timestamp":1402475869000},"page":"256-267","source":"Crossref","is-referenced-by-count":0,"title":["Monodic Fragments of Probabilistic First-Order Logic"],"prefix":"10.1007","author":[{"given":"Jean Christoph","family":"Jung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Lutz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Goncharov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lutz","family":"Schr\u00f6der","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1994.1049","volume":"112","author":"M. Abadi","year":"1994","unstructured":"Abadi, M., Halpern, J.: Decidability and expressiveness for first-order logics of probability. Inf. Comput.\u00a0112, 1\u201336 (1994)","journal-title":"Inf. Comput."},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1093\/jigpal\/3.5.685","volume":"3","author":"H. Andr\u00e9ka","year":"1995","unstructured":"Andr\u00e9ka, H., van Benthem, J., N\u00e9meti, I.: Back and forth between modal logic and classical logic. Logic J. IGPL\u00a03, 685\u2013720 (1995)","journal-title":"Logic J. IGPL"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/BF02952512","volume":"5","author":"E. Artin","year":"1927","unstructured":"Artin, E., Schreier, O.: Algebraische Konstruktion reeller K\u00f6rper. Abh. Math. Sem. Univ. Hamburg\u00a05, 85\u201399 (1927)","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"22_CR4","unstructured":"Bacchus, F.: Representing and reasoning with probabilistic knowledge - a logical approach to probabilities. MIT Press (1990)"},{"key":"22_CR5","unstructured":"Bacchus, F., Grove, A., Koller, D., Halpern, J.: From statistics to beliefs. In: Artificial Intelligence, AAAI 1992, pp. 602\u2013608. AAAI Press\/The MIT Press (1992)"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-642-22012-8_28","volume-title":"Automata, Languages and Programming","author":"V. B\u00e1r\u00e1ny","year":"2011","unstructured":"B\u00e1r\u00e1ny, V., ten Cate, B., Segoufin, L.: Guarded negation. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 356\u2013367. Springer, Heidelberg (2011)"},{"key":"22_CR7","unstructured":"Enderton, H.B.: A mathematical introduction to logic. Academic Press (1972)"},{"key":"22_CR8","unstructured":"Gabbay, D., Kurucz, A., Wolter, F., Zakharyaschev, M.: Many-dimensional modal logics: theory and applications. Studies in Logic, vol.\u00a0148. Elsevier (2003)"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Getoor, L., Taskar, B.: Introduction to Statistical Relational Learning. MIT Press (2007)","DOI":"10.7551\/mitpress\/7432.001.0001"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/421196","volume":"3","author":"E. Gr\u00e4del","year":"1997","unstructured":"Gr\u00e4del, E., Kolaitis, P., Vardi, M.: On the decision problem for two-variable first-order logic. Bull. Symb. Log.\u00a03, 53\u201369 (1997)","journal-title":"Bull. Symb. Log."},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Guti\u00e9rrez-Basulto, V., Jung, J., Lutz, C., Schr\u00f6der, L.: A closer look at the probabilistic description logic prob- $\\mathcal{EL}$ . In: Artificial Intelligence, AAAI 2011. AAAI Press (2011)","DOI":"10.1609\/aaai.v25i1.7856"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0004-3702(90)90019-V","volume":"46","author":"J. Halpern","year":"1990","unstructured":"Halpern, J.: An analysis of first-order logics of probability. Artif. Intell.\u00a046, 311\u2013350 (1990)","journal-title":"Artif. Intell."},{"key":"22_CR13","first-page":"51","volume":"24","author":"D. Harel","year":"1985","unstructured":"Harel, D.: Recurring dominoes: making the highly undecidable highly understandable. Ann. Discrete Math.\u00a024, 51\u201372 (1985)","journal-title":"Ann. Discrete Math."},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1023\/A:1021356410579","volume":"72","author":"I. Hodkinson","year":"2002","unstructured":"Hodkinson, I.: Monodic packed fragment with equality is decidable. Stud. Log.\u00a072, 185\u2013197 (2002)","journal-title":"Stud. Log."},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.apal.2005.06.007","volume":"138","author":"I. Hodkinson","year":"2006","unstructured":"Hodkinson, I.: Complexity of monodic guarded fragments over linear and real time. Ann. Pure Appl. Logic\u00a0138, 94\u2013125 (2006)","journal-title":"Ann. Pure Appl. Logic"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"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\u201398. IEEE Computer Society (2003)","DOI":"10.1109\/TIME.2003.1214884"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0168-0072(00)00018-X","volume":"106","author":"I. Hodkinson","year":"2000","unstructured":"Hodkinson, I., Wolter, F., Zakharyaschev, M.: Decidable fragment of first-order temporal logics. Ann. Pure Appl. Logic\u00a0106, 85\u2013134 (2000)","journal-title":"Ann. Pure Appl. Logic"},{"key":"22_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45653-8_1","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"I. Hodkinson","year":"2001","unstructured":"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.\u00a02250, pp. 1\u201323. Springer, Heidelberg (2001)"},{"key":"22_CR19","unstructured":"Koller, D., Halpern, J.: Irrelevance and conditioning in first-order probabilistic logic. In: Proc. AAAI\/IAAI 1096, pp. 569\u2013576. AAAI Press \/ The MIT Press (1996)"},{"key":"22_CR20","unstructured":"Lutz, C., Schr\u00f6der, L.: Probabilistic description logics for subjective uncertainty. In: Principles of Knowledge Representation and Reasoning, KR 2010. AAAI Press (2010)"},{"key":"22_CR21","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10994-006-5833-1","volume":"62","author":"M. Richardson","year":"2006","unstructured":"Richardson, M., Domingos, P.: Markov logic networks. Machine Learning\u00a062, 107\u2013136 (2006)","journal-title":"Machine Learning"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-642-11805-0_32","volume-title":"Graph Drawing","author":"M. Schaefer","year":"2010","unstructured":"Schaefer, M.: Complexity of some geometric and topological problems. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 334\u2013344. Springer, Heidelberg (2010)"},{"key":"22_CR23","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0168-0072(01)00124-5","volume":"118","author":"F. Wolter","year":"2002","unstructured":"Wolter, F., Zakharyaschev, M.: Axiomatizing the monodic fragment of first-order temporal logic. Ann. Pure Appl. Logic\u00a0118, 133\u2013145 (2002)","journal-title":"Ann. Pure Appl. Logic"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:23:35Z","timestamp":1746264215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}