<?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-08-16T22:59:14Z</responseDate>
  <request identifier="1379" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:1379</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>Logical Particle Filtering</dc:title>
          <dc:creator>Zettlemoyer, Luke S.</dc:creator>
          <dc:creator>Pasula, Hanna M.</dc:creator>
          <dc:creator>Pack Kaelbling, Leslie</dc:creator>
          <dc:subject>Particle filter</dc:subject>
          <dc:subject>logical hidden Markov model</dc:subject>
          <dc:description>In this paper, we consider the problem of&#13;
filtering in relational hidden Markov models.&#13;
We present a compact representation for such models&#13;
and an associated logical particle filtering &#13;
algorithm.  Each particle contains a logical &#13;
formula that describes a set of states.&#13;
The algorithm updates the formulae as new &#13;
observations are received. &#13;
Since a single particle tracks many states, this filter &#13;
can be more accurate than a traditional particle filter &#13;
in high dimensional state spaces, as we demonstrate &#13;
in experiments.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Luke S. Zettlemoyer and Hanna M. Pasula and Leslie Pack Kaelbling</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.5</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-13792</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07161.5</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>
