62 search results - page 6 / 13 » On a Generalisation of Herbrand's Theorem |
SLP
1997
13 years 8 months ago
1997
Compositionality of programsis an important concern in knowledge representation and software development. In the context of Logic Programming, up till now, the issue has mostly be...
ENTCS
2006
13 years 7 months ago
2006
In 1937 Marshall Stone extended his celebrated representation theorem for Boolean algebras to distributive lattices. In modern terminology, the representing topological spaces are...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
-Preserving Atomicity Abstraction Alexey Gotsman1 and Hongseok Yang2 1 IMDEA Software Institute 2 University of Oxford Modern concurrent algorithms are usually encapsulated in libr...
APAL
2010
13 years 7 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
ENTCS
2002
13 years 7 months ago
2002
We show how coalgebras can be presented by operations and equations. This is a special case of Linton's approach to algebras over a general base category X, namely where X is...