Sciweavers

3053 search results - page 77 / 611
» A Logic of Abstract Argumentation
Sort
View
EUROPAR
2005
Springer
15 years 12 months ago
Replication Predicates for Dependent-Failure Algorithms
Abstract. To establish lower bounds on the amount of replication, there is a common partition argument used to construct indistinguishable executions such that one violates some pr...
Flavio Paiva Junqueira, Keith Marzullo
LPAR
1999
Springer
15 years 10 months ago
Extensions to the Estimation Calculus
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...
Jeremy Gow, Alan Bundy, Ian Green
CHI
1995
ACM
15 years 10 months ago
Belvedere: stimulating students' critical discussion
We describe “Belvedere,” a system to support students engaged in critical discussion of science and public policy issues. The design is intended to address cognitive and metac...
Massimo Paolucci, Daniel D. Suthers, Arlene Weiner
IJCAI
1997
15 years 7 months ago
Reasoning Symbolically About Partially Matched Cases
In teaching case-based argumentation skills, the CATO program, an intelligent learning environment, guides students' assessments of partial matches between problems and cases...
Kevin D. Ashley, Vincent Aleven
ICALP
2010
Springer
15 years 6 months ago
What Is a Pure Functional?
Abstract. Given an ML function f : (int->int)->int how can we rigorously specify that f is pure, i.e., produces no side-effects other than those arising from calling its func...
Martin Hofmann, Aleksandr Karbyshev, Helmut Seidl