Sciweavers

    25 search results - page 2 / 5
    » Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Prog...
    Sort
    View
    CSCLP
    2008
    Springer
    258views Artificial Intelligence» more  CSCLP 2008»
    From Rules to Constraint Programs with the Rules2CP Modelling Language
    13 years 10 months ago
    From Rules to Constraint Programs with the Rules2CP Modelling Language
    Download  contraintes.inria.fr
    In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
    François Fages, Julien Martin
    claim paper
    Read More »
    WFLP
    2009
    Springer
    239views Algorithms» more  WFLP 2009»
    Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation
    14 years 3 months ago
    Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation
    Download  users.dsic.upv.es
    A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
    Michael Leuschel, Salvador Tamarit, Germán ...
    claim paper
    Read More »
    DAGSTUHL
    1998
    168views Software Engineering» more  DAGSTUHL 1998»
    Active-U-Datalog: Integrating Active Rules in a Logical Update Language
    13 years 10 months ago
    Active-U-Datalog: Integrating Active Rules in a Logical Update Language
    Download  circe.di.unipi.it
    Deductive database technology represents an important step towards the goal of developing highly-declarative database programming languages. In order to make deductive databases a ...
    Elisa Bertino, Barbara Catania, Vincenzo Gervasi, ...
    claim paper
    Read More »
    SLP
    1993
    110views more  SLP 1993»
    Logic Program Specialisation With Deletion of Useless Clauses
    13 years 9 months ago
    Logic Program Specialisation With Deletion of Useless Clauses
    Download  repository.readscheme.org
    In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
    D. Andre de Waal, John P. Gallagher
    claim paper
    Read More »
    POPL
    2004
    ACM
    120views Programming Languages» more  POPL 2004»
    Free theorems in the presence of seq
    14 years 8 months ago
    Free theorems in the presence of seq
    Download  wwwtcs.inf.tu-dresden.de
    Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
    Janis Voigtländer, Patricia Johann
    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.