Sciweavers

1989 search results - page 193 / 398
» Set functions for functional logic programming
Sort
View
MP
1998
108views more  MP 1998»
15 years 3 months ago
Base polytopes of series-parallel posets: Linear description and optimization
We define the base polytope B(P, g) of a partially ordered set P and a supermodular function g on the ideals ofP as the convex hull of the incidence vectors of all linear extensio...
Rainer Schrader, Andreas S. Schulz, Georg Wambach
FOIKS
2006
Springer
15 years 7 months ago
Reasoning Support for Expressive Ontology Languages Using a Theorem Prover
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
Ian Horrocks, Andrei Voronkov
123
Voted
FOSSACS
2008
Springer
15 years 5 months ago
Footprints in Local Reasoning
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
Mohammad Raza, Philippa Gardner
141
Voted
ICISS
2010
Springer
15 years 1 months ago
ValueGuard: Protection of Native Applications against Data-Only Buffer Overflows
Abstract. Code injection attacks that target the control-data of an application have been prevalent amongst exploit writers for over 20 years. Today however, these attacks are gett...
Steven Van Acker, Nick Nikiforakis, Pieter Philipp...
141
Voted
JCSS
2002
114views more  JCSS 2002»
15 years 3 months ago
Polymorphic Type Inference for the Relational Algebra
A database programming language is a programming language extended with database operations. In this paper we extend a core functional language with explicitly labeled tuples and ...
Jan Van den Bussche, Emmanuel Waller