1391 search results - page 234 / 279 » Completeness of Neighbourhood Logic |
156
click to vote
ADBIS
2005
Springer
15 years 11 months ago
2005
Springer
The current period of IT development is characterized by an explosive growth of diverse information representation languages. Applying integration and composition of heterogeneous ...
141
click to vote
CALCO
2005
Springer
15 years 11 months ago
2005
Springer
This paper shows that bisimulation equivalence does not afford a finite equational axiomatization over the language obtained by enriching Bergstra and Klop’s Basic Process Alge...
168
click to vote
ESWS
2005
Springer
15 years 11 months ago
2005
Springer
The paper addresses the problem of reasoning with multiple ontologies interrelated with semantic mappings. This problem is becoming more and more relevant due to the necessity of b...
145
click to vote
FPL
2005
Springer
15 years 11 months ago
2005
Springer
Modern heterogeneous FPGAs contain “hard” specificpurpose structures such as blocks of memory and multipliers in addition to the completely flexible “soft” programmable ...
155
click to vote
ICLP
2005
Springer
15 years 11 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...