Sciweavers

509 search results - page 28 / 102
» On the completeness of compositional reasoning methods
Sort
View
IJCAI
2007
13 years 10 months ago
Tractable Temporal Reasoning
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
Clare Dixon, Michael Fisher, Boris Konev
PRICAI
2000
Springer
14 years 11 days ago
Improved Efficiency of Oil Well Drilling through Case Based Reasoning
A system that applies a method of knowledge-intensive case-based reasoning, for repair and prevention of unwanted events in the domain of offshore oil well drilling, has been deve...
Pål Skalle, Jostein Sveen, Agnar Aamodt
BMCBI
2008
130views more  BMCBI 2008»
13 years 9 months ago
A novel series of compositionally biased substitution matrices for comparing Plasmodium proteins
Background: The most common substitution matrices currently used (BLOSUM and PAM) are based on protein sequences with average amino acid distributions, thus they do not represent ...
Kevin Brick, Elisabetta Pizzi
CG
2006
Springer
13 years 8 months ago
Shape reasoning and understanding
s: clustering, denoising, sharp feature, shape abstraction, reverse engineering In this paper we describe a hierarchical face clustering algorithm for triangle meshes based on fit...
Bianca Falcidieno, Remco C. Veltkamp
CSL
1994
Springer
14 years 27 days ago
Resolution Games and Non-Liftable Resolution Orderings
We prove the completeness of the combination of ordered resolution and factoring for a large class of non-liftable orderings, without the need for any additional rules like satura...
Hans de Nivelle