Sciweavers

JAIR
2008
92views more  JAIR 2008»
13 years 6 months ago
On the Expressiveness of Levesque's Normal Form
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
DM
2006
73views more  DM 2006»
13 years 6 months ago
Composition of Post classes and normal forms of Boolean functions
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
FUIN
2008
74views more  FUIN 2008»
13 years 6 months ago
A P Systems Flat Form Preserving Step-by-step Behaviour
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 ...
ENTCS
2008
110views more  ENTCS 2008»
13 years 6 months ago
A New Proposal Of Quasi-Solved Form For Equality Constraint Solving
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
DAM
2008
114views more  DAM 2008»
13 years 6 months ago
Efficient solutions to the braid isotopy problem
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
AML
2007
80views more  AML 2007»
13 years 6 months ago
Normal forms for fuzzy logics: a proof-theoretic approach
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
BNCOD
2009
145views Database» more  BNCOD 2009»
13 years 7 months ago
A Study of a Positive Fragment of Path Queries: Expressiveness, Normal Form, and Minimization
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...
EACL
1989
ACL Anthology
13 years 7 months ago
Parsing And Derivational Equivalence
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
AAAI
2004
13 years 7 months ago
Dynamic Programming for Partially Observable Stochastic Games
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...
SODA
2008
ACM
134views Algorithms» more  SODA 2008»
13 years 7 months ago
Fast algorithms for finding proper strategies in game trees
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