68 search results - page 5 / 14 » Realizability algebras: a program to well order R |
99
Voted
JUCS
2000
15 years 7 days ago
2000
Abstract: A study of the classes of nite relations as enriched strict monoidal categories is presented in CaS91]. The relations there are interpreted as connections in owchart sche...
146
Voted
SAS
1992
Springer
15 years 4 months ago
1992
Springer
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
128
Voted
JAR
2008
15 years 13 days ago
2008
This article presents detailed implementations of quantifier elimination for both integer and real linear arithmetic for theorem provers. The underlying algorithms are those by Coo...
125
click to vote
ECML
2006
Springer
15 years 2 months ago
2006
Springer
This paper presents a decomposition method for efficiently constructing 1-norm Support Vector Machines (SVMs). The decomposition algorithm introduced in this paper possesses many d...
98
Voted
JLP
2006
15 years 13 days ago
2006
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work...