Sciweavers

3624 search results - page 133 / 725
» Abstract Algebraic Logic
Sort
View
124
Voted
AML
2005
104views more  AML 2005»
15 years 4 months ago
Weak theories of linear algebra
Abstract. We investigate the theories LA, LAP, LAP of linear algebra, which were originally defined to study the question of whether commutativity of matrix inverses has polysize F...
Neil Thapen, Michael Soltys
ACS
2011
14 years 11 months ago
Algebras of Higher Operads as Enriched Categories
Abstract. One of the open problems in higher category theory is the systematic construction of the higher dimensional analogues of the Gray tensor product. In this paper we begin t...
Michael Batanin, Mark Weber
IPPS
2007
IEEE
15 years 11 months ago
Using Rewriting Logic to Match Patterns of Instructions from a Compiler Intermediate Form to Coarse-Grained Processing Elements
This paper presents a new and retargetable method to identify patterns of instructions with direct support in coarsegrained processing elements (PEs). The method uses a three-addr...
Carlos Morra, João M. P. Cardoso, Jürg...
AGP
1993
IEEE
15 years 9 months ago
A Note on Logic Programming Fixed-Point Semantics
In this paper, we present an account of classical Logic Programming fixed-point semantics in terms of two standard categorical constructions in which the least Herbrand model is ...
Vladimiro Sassone
126
Voted
CORR
2010
Springer
129views Education» more  CORR 2010»
15 years 5 months ago
The complexity of positive first-order logic without equality
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of ...
Florent R. Madelaine, Barnaby Martin