Sciweavers

393 search results - page 41 / 79
» Logic Programs with Classical Negation
Sort
View
ICFP
2012
ACM
13 years 4 days ago
Propositions as sessions
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
Philip Wadler
ECIR
2009
Springer
14 years 7 months ago
Graded-Inclusion-Based Information Retrieval Systems
This paper investigates the use of fuzzy logic mechanisms coming from the database community, namely graded inclusions, to model the information retrieval process. In this framewor...
Patrick Bosc, Vincent Claveau, Olivier Pivert, Lau...
EUSFLAT
2001
14 years 11 months ago
Similarity-based unification: a multi-adjoint approach
The aim of this paper is to build a formal model for similarity-based fuzzy unification in multi-adjoint logic programs. Specifically, a general framework of logic programming whi...
Jesús Medina, Manuel Ojeda-Aciego, Peter Vo...
POPL
2000
ACM
15 years 2 months ago
(Optimal) Duplication is not Elementary Recursive
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
Andrea Asperti, Paolo Coppola, Simone Martini
FAC
2008
114views more  FAC 2008»
14 years 9 months ago
Specification of communicating processes: temporal logic versus refusals-based refinement
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...
Gavin Lowe