Sciweavers

111 search results - page 21 / 23
» Inferring Phylogenetic Trees Using Answer Set Programming
Sort
View
ICTAI
2007
IEEE
14 years 2 months ago
Establishing Logical Rules from Empirical Data
We review a method of generating logical rules, or axioms, from empirical data. This method, using closed set properties of formal concept analysis, has been previously described ...
John L. Pfaltz
ML
2006
ACM
131views Machine Learning» more  ML 2006»
13 years 7 months ago
Markov logic networks
We propose a simple approach to combining first-order logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a first-order knowledge b...
Matthew Richardson, Pedro Domingos
BMCBI
2004
200views more  BMCBI 2004»
13 years 7 months ago
ABC: software for interactive browsing of genomic multiple sequence alignment data
Background: Alignment and comparison of related genome sequences is a powerful method to identify regions likely to contain functional elements. Such analyses are data intensive, ...
Gregory M. Cooper, Senthil A. G. Singaravelu, Aren...
ACL
2009
13 years 5 months ago
Unsupervised Multilingual Grammar Induction
We investigate the task of unsupervised constituency parsing from bilingual parallel corpora. Our goal is to use bilingual cues to learn improved parsing models for each language ...
Benjamin Snyder, Tahira Naseem, Regina Barzilay
JAIR
2011
123views more  JAIR 2011»
13 years 2 months ago
The Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
Lucas Bordeaux, George Katsirelos, Nina Narodytska...