{"id":452109,"date":"2017-12-28T09:33:24","date_gmt":"2017-12-28T17:33:24","guid":{"rendered":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/?post_type=msr-research-item&#038;p=452109"},"modified":"2018-10-16T20:09:20","modified_gmt":"2018-10-17T03:09:20","slug":"computability-of-validity-and-satisfiability-in-probability-logics-over-finite-and-countable-models","status":"publish","type":"msr-research-item","link":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/publication\/computability-of-validity-and-satisfiability-in-probability-logics-over-finite-and-countable-models\/","title":{"rendered":"Computability of validity and satisfiability in probability logics over finite and countable models"},"content":{"rendered":"<p>The \u03f5-logic (which is called \u03f5E-logic in this paper) of Kuyper and Terwijn is a variant of first order logic with the same syntax, in which the models are equipped with probability measures and in which the \u2200x quantifier is interpreted as &#8220;there exists a set A of measure \u22651\u2212\u03f5 such that for each x\u2208A, &#8230;.&#8221; Previously, Kuyper and Terwijn proved that the general satisfiability and validity problems for this logic are, i) for rational \u03f5\u2208(0,1), respectively \u03a311-complete and \u03a011-hard, and ii) for \u03f5=0, respectively decidable and \u03a301-complete. The adjective &#8220;general&#8221; here means &#8220;uniformly over all languages.&#8221;<br \/>\nWe extend these results in the scenario of finite models. In particular, we show that the problems of satisfiability by and validity over finite models in \u03f5E-logic are, i) for rational \u03f5\u2208(0,1), respectively \u03a301- and \u03a001-complete, and ii) for \u03f5=0, respectively decidable and \u03a001-complete. Although partial results toward the countable case are also achieved, the computability of \u03f5E-logic over countable models still remains largely unsolved. In addition, most of the results, of this paper and of Kuyper and Terwijn, do not apply to individual languages with a finite number of unary predicates. Reducing this requirement continues to be a major point of research.<br \/>\nOn the positive side, we derive the decidability of the corresponding problems for monadic relational languages &#8212; equality- and function-free languages with finitely many unary and zero other predicates. This result holds for all three of the unrestricted, the countable, and the finite model cases.<br \/>\nApplications in computational learning theory, weighted graphs, and neural networks are discussed in the context of these decidability and undecidability results.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>The \u03f5-logic (which is called \u03f5E-logic in this paper) of Kuyper and Terwijn is a variant of first order logic with the same syntax, in which the models are equipped with probability measures and in which the \u2200x quantifier is interpreted as &#8220;there exists a set A of measure \u22651\u2212\u03f5 such that for each x\u2208A, [&hellip;]<\/p>\n","protected":false},"featured_media":0,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"_classifai_error":"","msr-author-ordering":[{"type":"user_nicename","value":"gregyang","user_id":"37245"}],"msr_publishername":"Taylor and Francis","msr_publisher_other":"","msr_booktitle":"","msr_chapter":"","msr_edition":"Journal of Applied Non-Classical Logics","msr_editors":"","msr_how_published":"","msr_isbn":"1166-3081","msr_issue":"","msr_journal":"Journal of Applied Non-Classical Logics","msr_number":"","msr_organization":"","msr_pages_string":"324-372","msr_page_range_start":"324","msr_page_range_end":"372","msr_series":"","msr_volume":"25","msr_copyright":"","msr_conference_name":"","msr_doi":"10.1080\/11663081.2016.1139967","msr_arxiv_id":"","msr_s2_paper_id":"","msr_mag_id":"","msr_pubmed_id":"","msr_other_authors":"","msr_other_contributors":"","msr_speaker":"","msr_award":"","msr_affiliation":"","msr_institution":"","msr_host":"","msr_version":"","msr_duration":"","msr_original_fields_of_study":"","msr_release_tracker_id":"","msr_s2_match_type":"","msr_citation_count_updated":"","msr_published_date":"2016-01-06","msr_highlight_text":"","msr_notes":"","msr_longbiography":"","msr_publicationurl":"http:\/\/dx.doi.org\/10.1080\/11663081.2016.1139967","msr_external_url":"","msr_secondary_video_url":"","msr_conference_url":"","msr_journal_url":"","msr_s2_pdf_url":"","msr_year":0,"msr_citation_count":0,"msr_influential_citations":0,"msr_reference_count":0,"msr_s2_match_confidence":0,"msr_microsoftintellectualproperty":true,"msr_s2_open_access":false,"msr_s2_author_ids":[],"msr_pub_ids":[],"msr_hide_image_in_river":0,"footnotes":""},"msr-research-highlight":[],"research-area":[13561,13556,13546],"msr-publication-type":[193715],"msr-publisher":[],"msr-focus-area":[],"msr-locale":[268875],"msr-post-option":[],"msr-field-of-study":[],"msr-conference":[],"msr-journal":[],"msr-impact-theme":[],"msr-pillar":[],"class_list":["post-452109","msr-research-item","type-msr-research-item","status-publish","hentry","msr-research-area-algorithms","msr-research-area-artificial-intelligence","msr-research-area-computational-sciences-mathematics","msr-locale-en_us"],"msr_publishername":"Taylor and Francis","msr_edition":"Journal of Applied Non-Classical Logics","msr_affiliation":"","msr_published_date":"2016-01-06","msr_host":"","msr_duration":"","msr_version":"","msr_speaker":"","msr_other_contributors":"","msr_booktitle":"","msr_pages_string":"324-372","msr_chapter":"","msr_isbn":"1166-3081","msr_journal":"Journal of Applied Non-Classical Logics","msr_volume":"25","msr_number":"","msr_editors":"","msr_series":"","msr_issue":"","msr_organization":"","msr_how_published":"","msr_notes":"","msr_highlight_text":"","msr_release_tracker_id":"","msr_original_fields_of_study":"","msr_download_urls":"","msr_external_url":"","msr_secondary_video_url":"","msr_longbiography":"","msr_microsoftintellectualproperty":1,"msr_main_download":"452115","msr_publicationurl":"http:\/\/dx.doi.org\/10.1080\/11663081.2016.1139967","msr_doi":"10.1080\/11663081.2016.1139967","msr_publication_uploader":[{"type":"file","title":"computability_problogic","viewUrl":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-content\/uploads\/2017\/12\/computability_problogic.pdf","id":452115,"label_id":0},{"type":"url","title":"http:\/\/dx.doi.org\/10.1080\/11663081.2016.1139967","viewUrl":false,"id":false,"label_id":0},{"type":"doi","title":"10.1080\/11663081.2016.1139967","viewUrl":false,"id":false,"label_id":0}],"msr_related_uploader":"","msr_citation_count":0,"msr_citation_count_updated":"","msr_s2_paper_id":"","msr_influential_citations":0,"msr_reference_count":0,"msr_arxiv_id":"","msr_s2_author_ids":[],"msr_s2_open_access":false,"msr_s2_pdf_url":null,"msr_attachments":[{"id":0,"url":"http:\/\/dx.doi.org\/10.1080\/11663081.2016.1139967"}],"msr-author-ordering":[{"type":"user_nicename","value":"gregyang","user_id":37245,"rest_url":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/microsoft-research\/v1\/researchers?person=gregyang"}],"msr_impact_theme":[],"msr_research_lab":[],"msr_event":[],"msr_group":[],"msr_project":[],"publication":[],"video":[],"msr-tool":[],"msr_publication_type":"article","related_content":[],"_links":{"self":[{"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-research-item\/452109","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-research-item"}],"about":[{"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-research-item"}],"version-history":[{"count":5,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-research-item\/452109\/revisions"}],"predecessor-version":[{"id":453085,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-research-item\/452109\/revisions\/453085"}],"wp:attachment":[{"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/media?parent=452109"}],"wp:term":[{"taxonomy":"msr-research-highlight","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-research-highlight?post=452109"},{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=452109"},{"taxonomy":"msr-publication-type","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-publication-type?post=452109"},{"taxonomy":"msr-publisher","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-publisher?post=452109"},{"taxonomy":"msr-focus-area","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-focus-area?post=452109"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=452109"},{"taxonomy":"msr-post-option","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-post-option?post=452109"},{"taxonomy":"msr-field-of-study","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-field-of-study?post=452109"},{"taxonomy":"msr-conference","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-conference?post=452109"},{"taxonomy":"msr-journal","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-journal?post=452109"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=452109"},{"taxonomy":"msr-pillar","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-pillar?post=452109"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}