Sciweavers

232 search results - page 4 / 47
» Completeness and Decidability in Sequence Logic
Sort
View
FSTTCS
2004
Springer
14 years 23 days ago
A Decidable Fragment of Separation Logic
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
ESWS
2009
Springer
14 years 1 months ago
Decidability of SHI with Transitive Closure of Roles
This paper investigates a Description Logic, namely SHI+, which extends SHI by adding transitive closure of roles. The resulting logic SHI+ allows transitive closure of roles to oc...
Chan Le Duc
RTA
1998
Springer
13 years 11 months ago
The Decidability of Simultaneous Rigid E-Unification with One Variable
We show that simultaneous rigid E-unification, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the fragment of i...
Anatoli Degtyarev, Yuri Gurevich, Paliath Narendra...
JSYML
2010
107views more  JSYML 2010»
13 years 5 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
DLOG
2008
13 years 9 months ago
Decidable Reasoning over Timestamped Conceptual Models
We show that reasoning in the temporal conceptual model ERV T , a fragment of ERV T that only allows timestamping is complete for 2-ExpTime. The membership result is based on an em...
Alessandro Artale, David Toman