Sciweavers

1679 search results - page 125 / 336
» Strong order equivalence
Sort
View
ENDM
2007
89views more  ENDM 2007»
13 years 10 months ago
Homomorphisms and Polynomial Invariants of Graphs
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial. This connection enables us to extend the study to other important polynomial i...
Delia Garijo, Jaroslav Nesetril, M. P. Revuelta
JNCA
2007
87views more  JNCA 2007»
13 years 10 months ago
Representing and analysing composed web services using Cress
Composite web services are defined using the industry-standard language BPEL (Business Process Execution Logic). There is a strong need for graphical and automated support for th...
Kenneth J. Turner
ENTCS
2002
129views more  ENTCS 2002»
13 years 10 months ago
Eliminating Proofs from Programs
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
Femke van Raamsdonk, Paula Severi
ACL
2009
13 years 8 months ago
Incorporating Information Status into Generation Ranking
We investigate the influence of information status (IS) on constituent order in German, and integrate our findings into a loglinear surface realisation ranking model. We show that...
Aoife Cahill, Arndt Riester
TAMC
2010
Springer
14 years 3 months ago
Algebraic Proofs over Noncommutative Formulas
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
Iddo Tzameret