Sciweavers

2084 search results - page 300 / 417
» Set Constraints in Logic Programming
Sort
View
IGPL
2010
109views more  IGPL 2010»
13 years 6 months ago
Deductive coherence and norm adoption
This paper is a contribution to the formalisation of Thagard’s coherence theory. The term coherence is defined as the quality or the state of cohering, especially a logical, ord...
Sindhu Joseph, Carles Sierra, W. Marco Schorlemmer...
AGP
1999
IEEE
14 years 15 days ago
The Relative Complement Problem for Higher-Order Patterns
We address the problem of complementing higher-order patterns without repetitions of free variables. Differently from the first-order case, the complement of a pattern cannot, in ...
Alberto Momigliano, Frank Pfenning
EON
2008
13 years 9 months ago
Abductive Synthesis of the Mediator Scenario with jABC and GEM
We reuse here the framework, the setting, and the semantic modelling for the automated synthesis of the SWS Challenge Mediator presented in the companion paper [5], and show how to...
Christian Kubczak, Tiziana Margaria, Matthias Kais...
ICFP
2003
ACM
14 years 8 months ago
A sound and complete axiomatization of delimited continuations
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...
Yukiyoshi Kameyama, Masahito Hasegawa
SAS
2007
Springer
124views Formal Methods» more  SAS 2007»
14 years 2 months ago
Arithmetic Strengthening for Shape Analysis
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static analyses are often largely unaware of the shape of a program’s heap. In this p...
Stephen Magill, Josh Berdine, Edmund M. Clarke, By...