Sciweavers

    LOGCOM
    1998
    178views more  LOGCOM 1998»
    Applying the Mu-Calculus in Planning and Reasoning about Action
    14 years 12 days ago
    Applying the Mu-Calculus in Planning and Reasoning about Action
    Download  www.csc.ncsu.edu
    Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
    Munindar P. Singh
    claim paper
    Read More »
    LOGCOM
    1998
    80views more  LOGCOM 1998»
    Occurrences and Narratives as Constraints in the Branching Structure of the Situation Calculus
    14 years 12 days ago
    Occurrences and Narratives as Constraints in the Branching Structure of the Situation Calculus
    Download  www.cs.toronto.edu
    The Situation Calculus is a logic of time and change in which there is a distinguished initial situation ¡£¢ and all other situations arise from the different sequences of acti...
    Javier Pinto
    claim paper
    Read More »
    LOGCOM
    1998
    132views more  LOGCOM 1998»
    Agents That Reason and Negotiate by Arguing
    14 years 12 days ago
    Agents That Reason and Negotiate by Arguing
    Download  www.sci.brooklyn.cuny.edu
    The need for negotiation in multi-agent systems stems from the requirement for agents to solve the problems posed by their interdependence upon one another. Negotiation provides a...
    Simon Parsons, Carles Sierra, Nicholas R. Jennings
    claim paper
    Read More »
    LOGCOM
    1998
    64views more  LOGCOM 1998»
    A Relevant Analysis of Natural Deduction
    14 years 12 days ago
    A Relevant Analysis of Natural Deduction
    Download  www-2.cs.cmu.edu
    Samin S. Ishtiaq, David J. Pym
    claim paper
    Read More »
    LOGCOM
    1998
    110views more  LOGCOM 1998»
    leanTAP Revisited
    14 years 12 days ago
    leanTAP Revisited
    Download  comet.lehman.cuny.edu
    A sequent calculus of a new sort is extracted from the Prolog program leanTAP. This calculus is sound and complete, even though it lacks almost all structural rules. Thinking of l...
    Melvin Fitting
    claim paper
    Read More »
    LOGCOM
    1998
    122views more  LOGCOM 1998»
    Adding the Everywhere Operator to Propositional Logic
    14 years 12 days ago
    Adding the Everywhere Operator to Propositional Logic
    Download  www.cs.cornell.edu
    Sound and complete modal propositional logic C is presented, in which 2P has the interpretation “ P is true in all states”. The interpretation is already known as the Carnapia...
    David Gries, Fred B. Schneider
    claim paper
    Read More »
    LOGCOM
    1998
    126views more  LOGCOM 1998»
    Engineering AgentSpeak(L): A Formal Computational Model
    14 years 12 days ago
    Engineering AgentSpeak(L): A Formal Computational Model
    Download  www.dcs.kcl.ac.uk
    Perhaps the most successful agent architectures, and certainly the best known, are those based on the Belief-Desire-Intention (BDI) framework. Despite the wealth of research that ...
    Mark d'Inverno, Michael Luck
    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.