Sciweavers

    955 search results - page 61 / 191
    » Tractable Temporal Reasoning
    Sort
    View
    AAAI
    2007
    76views Intelligent Agents» more  AAAI 2007»
    On the Partial Observability of Temporal Uncertainty
    13 years 11 months ago
    On the Partial Observability of Temporal Uncertainty
    Download  www.aaai.org
    We explore a means to both model and reason about partial observability within the scope of constraintbased temporal reasoning. Prior studies of uncertainty in Temporal CSPs have ...
    Michael D. Moffitt
    claim paper
    Read More »
    LREC
    2008
    96views Education» more  LREC 2008»
    An Empirical Approach to a Preliminary Successful Identification and Resolution of Temporal Expressions in Spanish News Corpora
    13 years 10 months ago
    An Empirical Approach to a Preliminary Successful Identification and Resolution of Temporal Expressions in Spanish News Corpora
    Download  www.lrec-conf.org
    Dating of contents is relevant to multiple advanced Natural Language Processing (NLP) applications, such as Information Retrieval or Question Answering. These could be improved by...
    Maria Teresa Vicente-Díez, Doaa Samy, Palom...
    claim paper
    Read More »
    AAAI
    1997
    119views Intelligent Agents» more  AAAI 1997»
    Structured Solution Methods for Non-Markovian Decision Processes
    13 years 10 months ago
    Structured Solution Methods for Non-Markovian Decision Processes
    Download  www.cs.toronto.edu
    Markov Decision Processes (MDPs), currently a popular method for modeling and solving decision theoretic planning problems, are limited by the Markovian assumption: rewards and dy...
    Fahiem Bacchus, Craig Boutilier, Adam J. Grove
    claim paper
    Read More »
    AAAI
    2000
    146views Intelligent Agents» more  AAAI 2000»
    The Complexity of Restricted Consequence Finding and Abduction
    13 years 10 months ago
    The Complexity of Restricted Consequence Finding and Abduction
    Download  arantxa.ii.uam.es
    We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices ...
    Alvaro del Val
    claim paper
    Read More »
    DLOG
    2004
    96views Automated Reasoning» more  DLOG 2004»
    On Subsumption and Instance Problem in ELH w.r.t. General TBoxes
    13 years 10 months ago
    On Subsumption and Instance Problem in ELH w.r.t. General TBoxes
    Download  sunsite.informatik.rwth-aachen.de
    Recently, it was shown for the DL EL that subsumption and instance problem w.r.t. cyclic terminologies can be decided in polynomial time. In this paper, we show that both problems...
    Sebastian Brandt
    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-2024, USA.