Sciweavers

224 search results - page 11 / 45
» A Formal Treatment of Context-Awareness
Sort
View
IJAR
2008
129views more  IJAR 2008»
13 years 8 months ago
Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the trea...
Teresa Alsinet, Carlos Iván Chesñeva...
ENTCS
2006
138views more  ENTCS 2006»
13 years 8 months ago
Variables as Resource in Separation Logic
Separation logic [20,21,14] began life as an extended formalisation of Burstall's treatment of list-mutating programs [8]. It rapidly became clear that there was more that it...
Richard Bornat, Cristiano Calcagno, Hongseok Yang
ENTCS
2007
110views more  ENTCS 2007»
13 years 8 months ago
Data Anonymity in the FOO Voting Scheme
We study one of the many aspects of privacy, which is referred to as data anonymity, in a formal context. Data anonymity expresses whether some piece of observed data, such as a v...
Sjouke Mauw, Jan Verschuren, Erik P. de Vink
FM
1997
Springer
159views Formal Methods» more  FM 1997»
14 years 20 days ago
Term Rewrite Systems to Derive Set Boolean Operations on 2D Objects
Abstract Set boolean operations between 2-dlmensional geometric objects are crucial in computational geometry and deserve rigorous treatments. We build up a simple and convergent s...
David Cazier, Jean-François Dufourd
ESOP
2000
Springer
14 years 3 days ago
Formalizing Implementation Strategies for First-Class Continuations
Abstract. We present the first formalization of implementation straor first-class continuations. The formalization hinges on abstract machines for continuation-passing style (CPS) ...
Olivier Danvy