Sciweavers

    JAIR
    2008
    92views more  JAIR 2008»
    On the Expressiveness of Levesque's Normal Form
    14 years 13 days ago
    On the Expressiveness of Levesque's Normal Form
    Download  www.jair.org
    Levesque proposed a generalization of a database called a proper knowledge base (KB), which is equivalent to a possibly infinite consistent set of ground literals. In contrast to ...
    Yongmei Liu, Gerhard Lakemeyer
    claim paper
    Read More »
    DM
    2006
    73views more  DM 2006»
    Composition of Post classes and normal forms of Boolean functions
    14 years 14 days ago
    Composition of Post classes and normal forms of Boolean functions
    Download  math.tut.fi
    The class composition C K of Boolean clones, being the set of composite functions f(g1, . . . , gn) with f C, g1, . . . , gn K, is investigated. This composition C K is either...
    Miguel Couceiro, Stephan Foldes, Erkko Lehtonen
    claim paper
    Read More »
    FUIN
    2008
    74views more  FUIN 2008»
    A P Systems Flat Form Preserving Step-by-step Behaviour
    14 years 15 days ago
    A P Systems Flat Form Preserving Step-by-step Behaviour
    Download  www.di.unipi.it
    Starting from a compositional operational semantics of transition P Systems we have previously defined, we face the problem of developing an axiomatization that is sound and comple...
    Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo ...
    claim paper
    Read More »
    ENTCS
    2008
    110views more  ENTCS 2008»
    A New Proposal Of Quasi-Solved Form For Equality Constraint Solving
    14 years 15 days ago
    A New Proposal Of Quasi-Solved Form For Equality Constraint Solving
    Download  www.sc.ehu.es
    Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...
    Javier Álvez, Paqui Lucio
    claim paper
    Read More »
    DAM
    2008
    114views more  DAM 2008»
    Efficient solutions to the braid isotopy problem
    14 years 15 days ago
    Efficient solutions to the braid isotopy problem
    Download  www.math.unicaen.fr
    We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy probl...
    Patrick Dehornoy
    claim paper
    Read More »
    AML
    2007
    80views more  AML 2007»
    Normal forms for fuzzy logics: a proof-theoretic approach
    14 years 17 days ago
    Normal forms for fuzzy logics: a proof-theoretic approach
    Download  sitemason.vanderbilt.edu
    A method is described for obtaining conjunctive normal forms for logics using Gentzen-style rules possessing a special kind of strong invertibility. This method is then applied to ...
    Petr Cintula, George Metcalfe
    claim paper
    Read More »
    BNCOD
    2009
    145views Database» more  BNCOD 2009»
    A Study of a Positive Fragment of Path Queries: Expressiveness, Normal Form, and Minimization
    14 years 1 months ago
    A Study of a Positive Fragment of Path Queries: Expressiveness, Normal Form, and Minimization
    Download  www.cs.indiana.edu
    We study the expressiveness of a positive fragment of path queries, denoted Path+ , on node-labeled trees documents. The expressiveness of Path+ is studied from two angles. First, ...
    Yuqing Wu, Dirk Van Gucht, Marc Gyssens, Jan Pared...
    claim paper
    Read More »
    EACL
    1989
    ACL Anthology
    117views Natural Language Processing» more  EACL 1989»
    Parsing And Derivational Equivalence
    14 years 1 months ago
    Parsing And Derivational Equivalence
    Download  acl.ldc.upenn.edu
    It is a tacit assumption of much linguisticinquiry that alldistinctderivations of a string should assign distinct meanings. But despite the tidinessof such derivational uniqueness...
    Mark Hepple, Glyn Morrill
    claim paper
    Read More »
    AAAI
    2004
    167views Intelligent Agents» more  AAAI 2004»
    Dynamic Programming for Partially Observable Stochastic Games
    14 years 1 months ago
    Dynamic Programming for Partially Observable Stochastic Games
    Download  anytime.cs.umass.edu
    We develop an exact dynamic programming algorithm for partially observable stochastic games (POSGs). The algorithm is a synthesis of dynamic programming for partially observable M...
    Eric A. Hansen, Daniel S. Bernstein, Shlomo Zilber...
    claim paper
    Read More »
    SODA
    2008
    ACM
    134views Algorithms» more  SODA 2008»
    Fast algorithms for finding proper strategies in game trees
    14 years 1 months ago
    Fast algorithms for finding proper strategies in game trees
    Download  www.daimi.au.dk
    We show how to find a normal form proper equilibrium in behavior strategies of a given two-player zero-sum extensive form game with imperfect information but perfect recall. Our a...
    Peter Bro Miltersen, Troels Bjerre Sørensen
    claim paper
    Read More »
    « first‹ previous1234next ›last »
    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.