Sciweavers

1941 search results - page 364 / 389
» On the Hardness of Approximate Reasoning
Sort
View
AI
2008
Springer
14 years 12 months ago
What makes propositional abduction tractable
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
Gustav Nordh, Bruno Zanuttini
BMCBI
2010
232views more  BMCBI 2010»
14 years 12 months ago
LucidDraw: Efficiently visualizing complex biochemical networks within MATLAB
Background: Biochemical networks play an essential role in systems biology. Rapidly growing network data and e research activities call for convenient visualization tools to aid i...
Sheng He, Juan Mei, Guiyang Shi, Zhengxiang Wang, ...
CORR
2010
Springer
208views Education» more  CORR 2010»
14 years 12 months ago
Bounded Model Checking of Multi-threaded Software using SMT solvers
The transition from single-core to multi-core processors has made multi-threaded software an important subject in computer aided verification. Here, we describe and evaluate an ex...
Lucas Cordeiro, Bernd Fischer 0002
CCR
2007
135views more  CCR 2007»
14 years 11 months ago
Future internet: fundamentals and measurement
While the Internet is hardly “broken”, it has proved unable to integrate new ideas, new architectures, and provide paths for future integration of data, voice, rich media and ...
Thrasyvoulos Spyropoulos, Serge Fdida, Scott Kirkp...
KI
2008
Springer
14 years 11 months ago
Shallow Models for Non-iterative Modal Logics
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
Lutz Schröder, Dirk Pattinson