Sciweavers

9370 search results - page 139 / 1874
» An Abstract Notion of Application
Sort
View
110
Voted
ESOP
1998
Springer
15 years 5 months ago
A Polyvariant Binding-Time Analysis for Off-line Partial Deduction
Abstract. We study the notion of binding-time analysis for logic programs. We formalise the unfolding aspect of an on-line partial deduction s a Prolog program. Using abstract inte...
Maurice Bruynooghe, Michael Leuschel, Konstantinos...
COMMA
2006
15 years 2 months ago
Evaluation and comparison criteria for extension-based argumentation semantics
In the context of Dung's theory of abstract argumentation frameworks, the comparison between different semantics is often carried out by resorting to some specific examples co...
Pietro Baroni, Massimiliano Giacomin
97
Voted
ENTCS
2002
152views more  ENTCS 2002»
15 years 18 days ago
Contract-based mutation testing in the refinement calculus
This article discusses mutation testing strategies in the context of refinement. Here, a novel generalization of mutation testing techniques is presented to be applied to contract...
Bernhard K. Aichernig
KR
2004
Springer
15 years 6 months ago
Reasoning about Knowledge by Variable Forgetting
In this paper, we investigate knowledge reasoning within a simple framework called knowledge structure. We use variable forgetting as a basic operation for one agent to reason abo...
Kaile Su, Guanfeng Lv, Yan Zhang
107
Voted
IANDC
2006
103views more  IANDC 2006»
15 years 24 days ago
Bisimulation and cocongruence for probabilistic systems
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...
Vincent Danos, Josee Desharnais, François L...