Sciweavers

1101 search results - page 134 / 221
» Forcing in proof theory
Sort
View
DLT
2008
15 years 2 months ago
Derivation Tree Analysis for Accelerated Fixed-Point Computation
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
117
Voted
COMMA
2006
15 years 2 months ago
The Carneades Argumentation Framework - Using Presumptions and Exceptions to Model Critical Questions
Abstract. In 2005, Gordon and Walton presented initial ideas for a computational model of defeasible argument [12, 26], which builds on and elaborates Walton's theory of argum...
Thomas F. Gordon, Douglas Walton
ICWS
2004
IEEE
15 years 2 months ago
Logic-based Web Services Composition: From Service Description to Process Model
This paper introduces a method for automatic composition of Semantic Web services using Linear Logic (LL) theorem proving. The method uses Semantic Web service language (DAML-S) f...
Jinghai Rao, Peep Küngas, Mihhail Matskin
DCG
2008
82views more  DCG 2008»
15 years 22 days ago
Schnyder Woods and Orthogonal Surfaces
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...
Stefan Felsner, Florian Zickfeld
FAC
2008
80views more  FAC 2008»
15 years 21 days ago
Verification of Mondex electronic purses with KIV: from transactions to a security protocol
The Mondex case study about the specification and refinement of an electronic purse as defined in the Oxford Technical Monograph PRG-126 has recently been proposed as a challenge f...
Dominik Haneberg, Gerhard Schellhorn, Holger Grand...