Sciweavers

    210 search results - page 38 / 42
    » A Unified Theory of Irony and Its Computational Formalizatio...
    Sort
    View
    AAAI
    2008
    153views Intelligent Agents» more  AAAI 2008»
    An Integrated Reasoning Approach to Moral Decision-Making
    13 years 9 months ago
    An Integrated Reasoning Approach to Moral Decision-Making
    Download  www.qrg.northwestern.edu
    We present a computational model, MoralDM, which integrates several AI techniques in order to model recent psychological findings on moral decision-making. Current theories of mor...
    Morteza Dehghani, Emmett Tomai, Kenneth D. Forbus,...
    claim paper
    Read More »
    COMMA
    2006
    149views Applied Computing» more  COMMA 2006»
    The Carneades Argumentation Framework - Using Presumptions and Exceptions to Model Critical Questions
    13 years 8 months ago
    The Carneades Argumentation Framework - Using Presumptions and Exceptions to Model Critical Questions
    Download  www.csc.liv.ac.uk
    Abstract. In 2005, Gordon and Walton presented initial ideas for a computational model of defeasible argument [12, 26], which builds on and elaborates Walton's theory of argum...
    Thomas F. Gordon, Douglas Walton
    claim paper
    Read More »
    GIS
    2006
    ACM
    131views Automated Reasoning» more  GIS 2006»
    Qualitative polyline similarity testing with applications to query-by-sketch, indexing and classification
    13 years 7 months ago
    Qualitative polyline similarity testing with applications to query-by-sketch, indexing and classification
    Download  alpha.uhasselt.be
    We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the...
    Bart Kuijpers, Bart Moelans, Nico Van de Weghe
    claim paper
    Read More »
    MST
    2006
    149views more  MST 2006»
    Parameterized Intractability of Distinguishing Substring Selection
    13 years 7 months ago
    Parameterized Intractability of Distinguishing Substring Selection
    Download  theinf1.informatik.uni-jena.de
    A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
    Jens Gramm, Jiong Guo, Rolf Niedermeier
    claim paper
    Read More »
    BIRTHDAY
    2004
    Springer
    176views Applied Computing» more  BIRTHDAY 2004»
    Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
    14 years 24 days ago
    Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
    Download  formal.cs.uiuc.edu
    Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
    Mark-Oliver Stehr, José Meseguer
    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.