Sciweavers

3658 search results - page 268 / 732
» The logic of proofs, semantically
Sort
View
PDP
2009
IEEE
16 years 1 months ago
Two Formal Semantics of a Subset of the Paderborn University BSPlib
PUB (Paderborn University BSPLib) is a C library supporting the development of Bulk-Synchronous Parallel (BSP) algorithms. The BSP model allows an estimation of the execution time...
Frédéric Gava, Jean Fortin
AMAI
2004
Springer
16 years 4 days ago
The Expressive Rate of Constraints
In reasoning tasks involving logical formulas, high expressiveness is desirable, although it often leads to high computational complexity. We study a simple measure of expressiven...
Hubie Chen
DLOG
2003
15 years 8 months ago
Comparing Natural Language Documents: a DL Based Approach
We propose a method to compare semantically two natural language texts. The process is realized in two steps, the first translates the texts into description logics terminologies...
Naouel Karam, Michel Schneider
132
Voted
IGPL
2008
67views more  IGPL 2008»
15 years 6 months ago
Complete Axiomatisations of Properties of Finite Sets
We study a logic whose formulae are interpreted as properties of a finite set over some universe. The language is propositional, with two unary operators inclusion and extension, ...
Thomas Ågotnes, Michal Walicki
AMAST
1998
Springer
15 years 11 months ago
Type Analysis for CHIP
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
Wlodzimierz Drabent, Pawel Pietrzak