Sciweavers

571 search results - page 50 / 115
» Domain Theory in Logical Form
Sort
View
APAL
2010
115views more  APAL 2010»
14 years 10 months ago
Kripke semantics for provability logic GLP
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
Lev D. Beklemishev
ICDCS
2002
IEEE
15 years 2 months ago
Reasoning about Joint Administration of Access Policies for Coalition Resources
We argue that joint administration of access policies for a dynamic coalition formed by autonomous domains requires that these domains set up a coalition authority that distribute...
Himanshu Khurana, Virgil D. Gligor, John Linn
OWLED
2007
14 years 11 months ago
Lege Feliciter: Using Structured English to represent a Topographic Hydrology Ontology
: The mathematical nature of description logics has meant that domain experts find it hard to understand. This forms a significant impediment to the creation and adoption of ontolo...
Glen Hart, Catherine Dolbear, John Goodwin
CAV
2004
Springer
99views Hardware» more  CAV 2004»
15 years 3 months ago
Range Allocation for Separation Logic
Abstract. Separation Logic consists of a Boolean combination of predicates of the form vi ≥ vj +c where c is a constant and vi, vj are variables of some ordered infinite type li...
Muralidhar Talupur, Nishant Sinha, Ofer Strichman,...
FUZZY
2004
Springer
170views Fuzzy Logic» more  FUZZY 2004»
15 years 3 months ago
Consistency Conditions for Fuzzy Choice Functions
The revealed preference is a central subject in classical consumer theory. Authors like Samuelson, Arrow, Richter, Sen, Uzawa and others have proposed an axiomatic setting of reve...
Irina Georgescu