Sciweavers

    50 search results - page 8 / 10
    » Learning Semantic Grammars with Constructive Inductive Logic...
    Sort
    View
    IJCAI
    2007
    184views Artificial Intelligence» more  IJCAI 2007»
    A Fully Connectionist Model Generator for Covered First-Order Logic Programs
    13 years 9 months ago
    A Fully Connectionist Model Generator for Covered First-Order Logic Programs
    Download  www.wv.inf.tu-dresden.de
    We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
    Sebastian Bader, Pascal Hitzler, Steffen Höll...
    claim paper
    Read More »
    KDD
    2009
    ACM
    175views Data Mining» more  KDD 2009»
    Multi-class protein fold recognition using large margin logic based divide and conquer learning
    14 years 7 days ago
    Multi-class protein fold recognition using large margin logic based divide and conquer learning
    Download  www.doc.ic.ac.uk
    Inductive Logic Programming (ILP) systems have been successfully applied to solve complex problems in bioinformatics by viewing them as binary classification tasks. It remains an...
    Huma Lodhi, Stephen Muggleton, Michael J. E. Stern...
    claim paper
    Read More »
    CORR
    2008
    Springer
    137views Education» more  CORR 2008»
    Combining generic judgments with recursive definitions
    13 years 7 months ago
    Combining generic judgments with recursive definitions
    Download  www.dtc.umn.edu
    Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
    Andrew Gacek, Dale Miller, Gopalan Nadathur
    claim paper
    Read More »
    POPL
    2006
    ACM
    125views Programming Languages» more  POPL 2006»
    Polymorphic regular tree types and patterns
    14 years 8 months ago
    Polymorphic regular tree types and patterns
    Download  www.pps.jussieu.fr
    We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
    Jerome Vouillon
    claim paper
    Read More »
    POPL
    2006
    ACM
    131views Programming Languages» more  POPL 2006»
    Small bisimulations for reasoning about higher-order imperative programs
    14 years 8 months ago
    Small bisimulations for reasoning about higher-order imperative programs
    Download  ftp.ccs.neu.edu
    We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
    Vasileios Koutavas, Mitchell Wand
    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.