Sciweavers

    775 search results - page 2 / 155
    » First-order probabilistic inference
    Sort
    View
    AIPS
    2007
    156views Artificial Intelligence» more  AIPS 2007»
    Approximate Solution Techniques for Factored First-Order MDPs
    14 years 11 months ago
    Approximate Solution Techniques for Factored First-Order MDPs
    Download  www.cs.toronto.edu
    Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
    Scott Sanner, Craig Boutilier
    claim paper
    Read More »
    UAI
    2008
    224views Artificial Intelligence» more  UAI 2008»
    Sampling First Order Logical Particles
    14 years 11 months ago
    Sampling First Order Logical Particles
    Download  uai2008.cs.helsinki.fi
    Approximate inference in dynamic systems is the problem of estimating the state of the system given a sequence of actions and partial observations. High precision estimation is fu...
    Hannaneh Hajishirzi, Eyal Amir
    claim paper
    Read More »
    DLOG
    2009
    161views Automated Reasoning» more  DLOG 2009»
    On Correspondences between Probabilistic First-Order and Description Logics
    14 years 7 months ago
    On Correspondences between Probabilistic First-Order and Description Logics
    Download  sunsite.informatik.rwth-aachen.de
    Abstract This paper analyzes the probabilistic description logic PSHIQ by looking at it as a fragment of probabilistic first-order logic with semantics based on possible worlds. We...
    Pavel Klinov, Bijan Parsia, Ulrike Sattler
    claim paper
    Read More »
    WFLP
    2009
    Springer
    255views Algorithms» more  WFLP 2009»
    A Simple Region Inference Algorithm for a First-Order Functional Language
    15 years 4 months ago
    A Simple Region Inference Algorithm for a First-Order Functional Language
    Download  dalila.sip.ucm.es
    Manuel Montenegro, Ricardo Peña-Marí...
    claim paper
    Read More »
    SYNASC
    2008
    IEEE
    208views Algorithms» more  SYNASC 2008»
    On Some Problems of Efficient Inference Search in First-Order Cut-Free Modal Sequent Calculi
    15 years 3 months ago
    On Some Problems of Efficient Inference Search in First-Order Cut-Free Modal Sequent Calculi
    Download  www.math.nsc.ru
    Alexander V. Lyaletski
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2025, USA.