Sciweavers

1943 search results - page 167 / 389
» Ordering Default Theories
Sort
View
151
Voted
AMAI
2002
Springer
15 years 7 months ago
A Reasoning Model Based on the Production of Acceptable Arguments
Argumentation is a reasoning model based on the construction of arguments and counterarguments (defeaters) then the selection of the most acceptable of them. In this paper, we pro...
Leila Amgoud, Claudette Cayrol
198
Voted
ENTCS
2002
129views more  ENTCS 2002»
15 years 6 months ago
Eliminating Proofs from Programs
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
Femke van Raamsdonk, Paula Severi
ENTCS
2002
91views more  ENTCS 2002»
15 years 6 months ago
Subtyping in Logical Form
By using intersection types and filter models we formulate a theory of types for a -calculus with record subtyping via a finitary programming logic. Types are interpreted as space...
Ugo de'Liguoro
IEEEARES
2009
IEEE
15 years 4 months ago
Quantitative Analysis of Secure Information Flow via Probabilistic Semantics
We present an automatic analyzer for measuring information flow within software systems. In this paper, we quantify leakage in terms of information theory and incorporate this comp...
Chunyan Mu, David Clark
FUIN
2010
158views more  FUIN 2010»
15 years 4 months ago
Cellular Automata, Decidability and Phasespace
Abstract. Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phas...
Klaus Sutner