Results 1  10
of
813
Tractable reasoning and efficient query answering in description logics: The DLLite family
 J. OF AUTOMATED REASONING
, 2007
"... We propose a new family of Description Logics (DLs), called DLLite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts, and checking satisfiability of the whole knowledge base, b ..."
Abstract

Cited by 497 (123 self)
 Add to MetaCart
of the ABox (i.e., in data complexity). To the best of our knowledge, this is the first result of polynomial time data complexity for query answering over DL knowledge bases. Notably our logics allow for a separation between TBox and ABox reasoning during query evaluation: the part of the process requiring
Waveletbased statistical signal processing using hidden Markov models
 IEEE TRANSACTIONS ON SIGNAL PROCESSING
, 1998
"... Waveletbased statistical signal processing techniques such as denoising and detection typically model the wavelet coefficients as independent or jointly Gaussian. These models are unrealistic for many realworld signals. In this paper, we develop a new framework for statistical signal processing b ..."
Abstract

Cited by 415 (50 self)
 Add to MetaCart
, probabilistic signal models. Efficient expectation maximization algorithms are developed for fitting the HMM’s to observational signal data. The new framework is suitable for a wide range of applications, including signal estimation, detection, classification, prediction, and even synthesis. To demonstrate
Computationally Manageable Combinatorial Auctions
, 1998
"... There is interest in designing simultaneous auctions for situations in which the value of assets to a bidder depends upon which other assets he or she wins. In such cases, bidders may well wish to submit bids for combinations of assets. When this is allowed, the problem of determining the revenue ma ..."
Abstract

Cited by 345 (1 self)
 Add to MetaCart
maximizing set of nonconflicting bids can be a difficult one. We analyze this problem, identifying several different structures of combinatorial bids for which computational tractability is constructively demonstrated and some structures for which computational tractability 1 Introduction Some auctions
Reveal, A General Reverse Engineering Algorithm For Inference Of Genetic Network Architectures
, 1998
"... Given the immanent gene expression mapping covering whole genomes during development, health and disease, we seek computational methods to maximize functional inference from such large data sets. Is it possible, in principle, to completely infer a complex regulatory network architecture from input/o ..."
Abstract

Cited by 344 (5 self)
 Add to MetaCart
Given the immanent gene expression mapping covering whole genomes during development, health and disease, we seek computational methods to maximize functional inference from such large data sets. Is it possible, in principle, to completely infer a complex regulatory network architecture from input
Reasoning about Temporal Relations: A Maximal Tractable Subclass of Allen's Interval Algebra
 Journal of the ACM
, 1995
"... We introduce a new subclass of Allen's interval algebra we call "ORDHorn subclass," which is a strict superset of the "pointisable subclass." We prove that reasoning in the ORDHorn subclass is a polynomialtime problem and show that the pathconsistency method is sufficient ..."
Abstract

Cited by 199 (9 self)
 Add to MetaCart
is sufficient for deciding satisfiability. Further, using an extensive machinegenerated case analysis, we show that the ORDHorn subclass is a maximal tractable subclass of the full algebra (assuming<F NaN> P6=NP). In fact, it is the unique greatest tractable subclass amongst the subclasses that contain
On the Complexity of Qualitative Spatial Reasoning: A Maximal Tractable Fragment of the Region Connection Calculus
 Artificial Intelligence
, 1997
"... The computational properties of qualitative spatial reasoning have been investigated to some degree. However, the question for the boundary between polynomial and NPhard reasoning problems has not been addressed yet. In this paper we explore this boundary in the "Region Connection Calculus&quo ..."
Abstract

Cited by 144 (23 self)
 Add to MetaCart
" RCC8. We extend Bennett's encoding of RCC8 in modal logic. Based on this encoding, we prove that reasoning is NPcomplete in general and identify a maximal tractable subset of the relations in RCC8 that contains all base relations. Further, we show that for this subset path
On the tractability of maximal strip recovery
 Erratum in Journal of Computational Biology, 18:129, 2011. Cited
"... Abstract. Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subsequences in the input maps, either directly or in reversed and negated form. The problem Maximal Strip Recovery ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
the open problem by showing that MSR is NPcomplete, using a polynomial time reduction from OneinThree 3SAT. We also solve the MSR problem and its variants exactly with FPT algorithms, i.e., showing that MSR is fixedparameter tractable. Let k be the minimum number of markers deleted in various versions
Tractable Constraints in Finite Semilattices
 Science of Computer Programming
, 1996
"... . We introduce the notion of definite inequality constraints involving monotone functions in a finite meetsemilattice, generalizing the logical notion of Hornclauses, and we give a linear time algorithm for deciding satisfiability. We characterize the expressiveness of the framework of definit ..."
Abstract

Cited by 61 (3 self)
 Add to MetaCart
clauses (hornsat) and study its efficiency. Finally, we show that the algorithm is complete for a maximal class of tractable constraints, by proving that any strict extension will lead to NPhard problems in any meetsemilattice. Keywords: Finite semilattices, constraint satisfiability, program analysis
Tractability and Approximability of Maximal Strip Recovery
"... Abstract. An essential task in comparative genomics is usually to decompose two or more genomes into synteny blocks, that is, segments of chromosomes with similar contents. In this paper, we study the Maximal Strip Recovery problem (MSR) [Zheng et al. 07], which aims at finding an optimal decomposit ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
d and δgapCMSRd running in time O(2.360 k poly(nd)), where k is the number of markers or genes considered as erroneous, and a (d + 1.5)approximation algorithm for CMSRd and δgapCMSRd. 1
A maximal tractable class of soft constraints
 J. Artif. Intell. Res
, 2004
"... Many optimization problems can be expressed using some form of soft constraints, where different measures of desirability arc associated with different combinations of domain values for specified subsets of variables. In this paper we identify a class of soft binary constraints for which the problem ..."
Abstract

Cited by 30 (12 self)
 Add to MetaCart
the problem of finding the optimal solution is tractable. In other words, we show that for any given set of such constraints, there exists a polynomial time algorithm to determine the assignment having the best overall combined measure of desirability. This tractable class includes many commonly
Results 1  10
of
813