Sciweavers

6355 search results - page 208 / 1271
» From Logic to Games
Sort
View
CSL
2000
Springer
15 years 11 months ago
Bounded Arithmetic and Descriptive Complexity
We study definability of languages in arithmetic and the free monoid by bounded versions of fixed-point and transitive-closure logics. In particular we give logical characterisat...
Achim Blumensath
CORR
2007
Springer
121views Education» more  CORR 2007»
15 years 6 months ago
Diagrammatic Inference
Diagrammatic logics were introduced in 2002, with emphasis on the notions of specifications and models. In this paper we improve the description of the inference process, which i...
Dominique Duval
IANDC
2010
102views more  IANDC 2010»
15 years 5 months ago
Presenting functors on many-sorted varieties and applications
This paper studies several applications of the notion of a presentation of a functor by operations and equations. We show that the technically straightforward generalisation of th...
Alexander Kurz, Daniela Petrisan
WECWIS
2002
IEEE
112views ECommerce» more  WECWIS 2002»
15 years 11 months ago
Separating Business Process from User Interaction Utilizing Process-Aware XSLT Style-Sheets
In the web context, it is difficult to disentangle presentation from process logic, and sometimes even data is not separate from the presentation. Consequently, it becomes to de...
Karl Aberer, Anwitaman Datta, Zoran Despotovic
SAC
2002
ACM
15 years 6 months ago
Dynamically generating web application fragments from page templates
Web-based applications are typically required to be highly customizable and configurable. New application requirements have to be introduced rapidly, often without stopping the ru...
Uwe Zdun