Sciweavers

    24 search results - page 2 / 5
    » Planning in Answer Set Programming using Ordered Task Decomp...
    Sort
    View
    DKE
    2010
    167views more  DKE 2010»
    The consistency extractor system: Answer set programs for consistent query answering in databases
    13 years 5 months ago
    The consistency extractor system: Answer set programs for consistent query answering in databases
    Download  people.scs.carleton.ca
    We describe the Consistency Extractor System (ConsEx) that computes consistent answers to Datalog queries with negation posed to relational databases that may be inconsistent with...
    Mónica Caniupán Marileo, Leopoldo E....
    claim paper
    Read More »
    AI
    2004
    Springer
    219views Artificial Intelligence» more  AI 2004»
    ASSAT: computing answer sets of a logic program by SAT solvers
    13 years 5 months ago
    ASSAT: computing answer sets of a logic program by SAT solvers
    Download  www.cs.ust.hk
    We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
    Fangzhen Lin, Yuting Zhao
    claim paper
    Read More »
    AMAI
    2006
    Springer
    122views Artificial Intelligence» more  AMAI 2006»
    Answer set based design of knowledge systems
    13 years 5 months ago
    Answer set based design of knowledge systems
    Download  www.krlab.cs.ttu.edu
    The aim of this paper is to demonstrate that A-Prolog is a powerful language for the construction of reasoning systems. In fact, A-Prolog allows to specify the initial situation, t...
    Marcello Balduccini, Michael Gelfond, Monica Nogue...
    claim paper
    Read More »
    PUK
    2003
    120views Computer Science» more  PUK 2003»
    On the Decomposition and Concurrent Resolution of a Planning Problem
    13 years 6 months ago
    On the Decomposition and Concurrent Resolution of a Planning Problem
    Download  www-is.informatik.uni-oldenburg.de
    Planning is known to be a difficult task. One of the approaches used to reduce this difficulty is problem decomposition under divide-and-conquer methodology. This paper introduce...
    Laura Sebastia, Eva Onaindia, Eliseo Marzal
    claim paper
    Read More »
    IOR
    2007
    106views more  IOR 2007»
    Planning and Scheduling by Logic-Based Benders Decomposition
    13 years 5 months ago
    Planning and Scheduling by Logic-Based Benders Decomposition
    Download  wpweb2.tepper.cmu.edu
    We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
    John N. Hooker
    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.