Sciweavers

331 search results - page 24 / 67
» Fragments of order
Sort
View
JSAT
2006
126views more  JSAT 2006»
13 years 7 months ago
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
Sylvie Coste-Marquis, Daniel Le Berre, Florian Let...
DLT
2009
13 years 5 months ago
Subshifts, Languages and Logic
We study the Monadic Second Order (MSO) Hierarchy over infinite pictures, that is tilings. We give a characterization of existential MSO in terms of tilings and projections of tili...
Emmanuel Jeandel, Guillaume Theyssier
JCB
2007
94views more  JCB 2007»
13 years 7 months ago
A Quantile Method for Sizing Optical Maps
Optical mapping is an integrated system for the analysis of single DNA molecules. It constructs restriction maps (noted as “optical map”) from individual DNA molecules present...
Haifeng Li, Anton Valouev, David C. Schwartz, Mich...
LFCS
2007
Springer
14 years 1 months ago
On Decidability and Expressiveness of Propositional Interval Neighborhood Logics
Interval-based temporal logics are an important research area in computer science and artificial intelligence. In this paper we investigate decidability and expressiveness issues ...
Davide Bresolin, Valentin Goranko, Angelo Montanar...
DLOG
2003
13 years 9 months ago
Fixpoint Extensions of Temporal Description Logics
In this paper we introduce a decidable fixpoint extension of temporal Description Logics. We exploit the decidability results obtained for various monodic extensions of Descripti...
Enrico Franconi, David Toman