1391 search results - page 91 / 279 » Completeness of Neighbourhood Logic |
CP
2005
Springer
13 years 11 months ago
2005
Springer
One of the attractive features of the Constraint Handling Rules (CHR) programming language is its declarative semantics where rules are read as formulae in first-order predicate l...
CSL
2002
Springer
13 years 9 months ago
2002
Springer
Abstract. We give a simple term calculus for the multiplicative exponential fragment of Classical Linear Logic, by extending Barber and Plotkin's system for the intuitionistic...
CIE
2009
Springer
14 years 3 months ago
2009
Springer
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
SEMCO
2008
IEEE
14 years 3 months ago
2008
IEEE
This demonstration shows how semantic schema matching technology is being incorporated into the BEA AquaLogic Data Services Platform. Specifically, it demonstrates how the manuall...
BIRTHDAY
2005
Springer
14 years 2 months ago
2005
Springer
This paper is a guided tour through the theory of fibring as a general mechanism for combining logics. We present the main ideas, constructions and difficulties of fibring, from ...