Sciweavers

1634 search results - page 124 / 327
» Reasoning about Knowledge Using Rough Sets
Sort
View
LPNMR
2009
Springer
14 years 5 months ago
The Complexity of Circumscriptive Inference in Post's Lattice
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
Michael Thomas
POPL
2005
ACM
14 years 10 months ago
Region-based shape analysis with tracked locations
This paper proposes a novel approach to shape analysis: using local reasoning about individual heap locations of global reasoning about entire heap abstractions. We present an int...
Brian Hackett, Radu Rugina
TACAS
2012
Springer
316views Algorithms» more  TACAS 2012»
12 years 6 months ago
Compositional Termination Proofs for Multi-threaded Programs
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
Corneliu Popeea, Andrey Rybalchenko
KES
2004
Springer
14 years 3 months ago
Extracting Biochemical Reaction Kinetics from Time Series Data
We consider the problem of inferring kinetic mechanisms for biochemical reactions from time series data. Using a priori knowledge about the structure of chemical reaction kinetics ...
Edmund J. Crampin, Patrick E. McSharry, Santiago S...
LOGCOM
2000
63views more  LOGCOM 2000»
13 years 10 months ago
Reflection principles in computational logic
We introduce the concept of reflection principle as a knowledge representation paradigm in a computational logic setting. Reflection principles are expressed as certain kinds of l...
Jonas Barklund, Pierangelo Dell'Acqua, Stefania Co...