Sciweavers

300 search results - page 43 / 60
» Extension of a theorem of Whitney
Sort
View
CI
2004
119views more  CI 2004»
13 years 8 months ago
Reasoning with Sets of Defaults in Default Logic
We present a general approach for representing and reasoning with sets of defaults in default logic, focussing on reasoning about preferences among sets of defaults. First, we con...
James P. Delgrande, Torsten Schaub
TPHOL
2009
IEEE
14 years 3 months ago
A Formalisation of Smallfoot in HOL
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,...
Thomas Tuerk
MMMACNS
2005
Springer
14 years 2 months ago
A Modal Logic for Role-Based Access Control
Making correct access-control decisions is central to security, which in turn requires accounting correctly for the identity, credentials, roles, authority, and privileges of users...
Thumrongsak Kosiyatrakul, Susan Older, Shiu-Kai Ch...
PEPM
2010
ACM
13 years 11 months ago
A3PAT, an approach for certified automated termination proofs
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
Evelyne Contejean, Andrey Paskevich, Xavier Urbain...
AML
2006
120views more  AML 2006»
13 years 9 months ago
On the infinite-valued Lukasiewicz logic that preserves degrees of truth
Lukasiewicz's infinite-valued logic is commonly defined as the set of formulas that take the value 1 under all evaluations in the Lukasiewicz algebra on the unit real interva...
Josep Maria Font, Àngel J. Gil, Antoni Torr...