Sciweavers

2178 search results - page 372 / 436
» Inferring complex plans
Sort
View
LOGCOM
2007
115views more  LOGCOM 2007»
13 years 7 months ago
The Dynamics of Syntactic Knowledge
The syntactic approach to epistemic logic avoids the logical omniscience problem by taking knowledge as primary rather than as defined in terms of possible worlds. In this study, ...
Thomas Ågotnes, Natasha Alechina
BIOINFORMATICS
2004
83views more  BIOINFORMATICS 2004»
13 years 7 months ago
Haplotypes histories as pathways of recombinations
Motivation: The diversity of a haplotype, represented as a string of polymorphic sites along a DNA sequence, increases exponentially with the number of sites if recombinations are...
Nadia El-Mabrouk, Damian Labuda
CORR
2004
Springer
119views Education» more  CORR 2004»
13 years 7 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
BIOINFORMATICS
2002
100views more  BIOINFORMATICS 2002»
13 years 7 months ago
Optimal algorithms for local vertex quartet cleaning
Reconstructing evolutionary trees is an important problem in biology. A response to the computational intractability of most of the traditional criteria for inferring evolutionary...
Gianluca Della Vedova, Todd Wareham
AI
1999
Springer
13 years 7 months ago
Modal Logics, Description Logics and Arithmetic Reasoning
Forthcoming in the Journal of Aritificial Intelligence We introduce mathematical programming and atomic decomposition as the basic modal (T-Box) inference techniques for a large c...
Hans Jürgen Ohlbach, Jana Koehler