Sciweavers

254 search results - page 41 / 51
» Answer Sets for Propositional Theories
Sort
View
FUIN
2010
109views more  FUIN 2010»
15 years 4 months ago
Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem
Given a set of taxa S and a complete set of quartet topologies Q over S, the problem of determining a phylogeny that satisfies the maximum number of topologies is called the Maxi...
António Morgado, João Marques-Silva
JMLR
2010
104views more  JMLR 2010»
15 years 14 days ago
Learnability, Stability and Uniform Convergence
The problem of characterizing learnability is the most basic question of statistical learning theory. A fundamental and long-standing answer, at least for the case of supervised c...
Shai Shalev-Shwartz, Ohad Shamir, Nathan Srebro, K...
LICS
2009
IEEE
16 years 10 days ago
The Structure of First-Order Causality
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...
Samuel Mimram
KR
2004
Springer
15 years 11 months ago
Updating of a Possibilistic Knowledge Base by Crisp or Fuzzy Transition Rules
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...
Boris Mailhé, Henri Prade
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
16 years 3 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...