Sciweavers

3032 search results - page 300 / 607
» Description Logic Rules
Sort
View
NGC
1998
Springer
115views Communications» more  NGC 1998»
15 years 4 months ago
On Semantic Resolution with Lemmaizing and Contraction and a Formal Treatment of Caching
Reducing redundancy in search has been a major concern for automated deduction. Subgoal-reduction strategies, such as those based on model elimination and implemented in Prolog te...
Maria Paola Bonacina, Jieh Hsiang
EDOC
2006
IEEE
15 years 10 months ago
Trust Assessment Using Provenance in Service Oriented Applications
Workflow forms a key part of many existing Service Oriented applications, involving the integration of services that may be made available at distributed sites. It is possible ng...
Shrija Rajbhandari, Arnaud Contes, Omer F. Rana, V...
ICFP
2005
ACM
16 years 4 months ago
Translating specifications from nominal logic to CIC with the theory of contexts
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
Marino Miculan, Ivan Scagnetto, Furio Honsell
ESOP
2007
Springer
15 years 10 months ago
On the Relationship Between Concurrent Separation Logic and Assume-Guarantee Reasoning
We study the relationship between Concurrent Separation Logic (CSL) and the assume-guarantee (A-G) method (a.k.a. rely-guarantee method). We show in three steps that CSL can be tre...
Xinyu Feng, Rodrigo Ferreira, Zhong Shao
SAS
2004
Springer
123views Formal Methods» more  SAS 2004»
15 years 9 months ago
Non-termination Inference for Constraint Logic Programs
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...
Étienne Payet, Frédéric Mesna...