<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-23T22:19:23Z</responseDate>
  <request identifier="1381" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:1381</identifier>
        <datestamp>2024-03-06T11:07:29Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Markov Logic in Infinite Domains</dc:title>
          <dc:creator>Domingos, Pedro</dc:creator>
          <dc:creator>Singla, Parag</dc:creator>
          <dc:subject>Markov logic networks</dc:subject>
          <dc:subject>Gibbs measures</dc:subject>
          <dc:subject>first-order logic</dc:subject>
          <dc:subject>infinite probabilistic models</dc:subject>
          <dc:subject>Markov networks</dc:subject>
          <dc:description>Markov logic combines logic and probability by attaching weights to&#13;
first-order formulas, and viewing them as templates for features of Markov&#13;
networks. Unfortunately, in its original formulation it does not have the&#13;
full power of first-order logic, because it applies only to finite domains.&#13;
Recently, we have extended Markov logic to infinite domains, by casting it&#13;
in the framework of Gibbs measures. In this talk I will summarize our main&#13;
results to date, including sufficient conditions for the existence and&#13;
uniqueness of a Gibbs measure consistent with an infinite MLN, and&#13;
properties of the set of consistent measures in the non-unique case.&#13;
(Many important phenomena, like phase transitions, are modeled by&#13;
non-unique MLNs.) Under the conditions for existence, we have extended&#13;
to infinite domains the result in Richardson and Domingos (2006) that&#13;
first-order logic is the limiting case of Markov logic when all weights&#13;
tend to infinity. I will also discuss some fundamental limitations of&#13;
Herbrand interpretations (and representations based on them) for&#13;
probabilistic modeling of infinite domains, and how to get around them.&#13;
Finally, I will discuss some of the surprising insights for learning&#13;
and inference in large finite domains that result from considering the&#13;
infinite limit.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Pedro Domingos and Parag Singla</dc:contributor>
          <dc:date>2008</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 7161, Probabilistic, Logical and Relational Learning - A Further Synthesis (2008)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.07161.6</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-13811</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07161.6</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
