936 search results - page 58 / 188 » The Logical Difference Problem for Description Logic Termino... |
TPHOL
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
TCS
2008
13 years 7 months ago
2008
Reversible computing is a paradigm where computing models are so defined that they reflect physical reversibility, one of the fundamental microscopic physical property of Nature. ...
BIB
2006
13 years 8 months ago
2006
: In recent years, as a knowledge-based discipline, bioinformatics has moved to make its knowledge more computationally amenable. After its beginnings in the disciplines as a techn...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
INFFUS
2006
13 years 8 months ago
2006
This paper addresses the problem of merging uncertain information in the framework of possibilistic logic. It presents several syntactic combination rules to merge possibilistic k...