Sciweavers

32 search results - page 3 / 7
» Tractable Reasoning in a Fragment of Separation Logic
Sort
View
KR
2010
Springer
13 years 10 months ago
Worst-Case Optimal Reasoning for the Horn-DL Fragments of OWL 1 and 2
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...
Magdalena Ortiz, Sebastian Rudolph, Mantas Simkus
CONCUR
2007
Springer
13 years 11 months ago
A Marriage of Rely/Guarantee and Separation Logic
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...
Viktor Vafeiadis, Matthew J. Parkinson
CSFW
2003
IEEE
13 years 10 months ago
Using First-Order Logic to Reason about Policies
A policy describes the conditions under which an action is permitted or forbidden. We show that a fragment of (multi-sorted) first-order logic can be used to represent and reason...
Joseph Y. Halpern, Vicky Weissman
AI
2011
Springer
13 years 10 days ago
Local closed world reasoning with description logics under the well-founded semantics
An important question for the upcoming Semantic Web is how to best combine open world ontology languages, such as the OWL-based ones, with closed world rule-based languages. One o...
Matthias Knorr, José Júlio Alferes, ...
ESOP
2006
Springer
13 years 9 months ago
ILC: A Foundation for Automated Reasoning About Pointer Programs
This paper presents a new program logic designed for facilitating automated reasoning about pointer programs. The program logic is directly inspired by previous work by O'Hea...
Limin Jia, David Walker