32 search results - page 2 / 7 » Tractable Reasoning in a Fragment of Separation Logic |
DEXAW
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper we explore embeddings of the various kinds of RDF entailment in F-Logic. We show that the embeddings of simple, RDF, and RDFS entailment, as well as a large fragment...
ENTCS
2008
13 years 4 months ago
2008
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
FOSSACS
2005
Springer
13 years 10 months ago
2005
Springer
Separation logic is a spatial logic for reasoning locally about heap structures. A decidable fragment of its assertion language was presented in [1], based on a bounded model prope...
AAAI
1998
13 years 6 months ago
1998
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...
LICS
2010
IEEE
13 years 2 months ago
2010
IEEE
One of the major interests of finite model theory is to separate the expressive power of different logics or fragments of logics. In this paper, we define a variant of EhrenfeuchtF...