271 search results - page 9 / 55 » Logics from Galois connections |
120
click to vote
FPL
2008
Springer
15 years 3 months ago
2008
Springer
It is often desirable to change the logic and/or the connections within an FPGA design on-the-fly without the benefit of a workstation or vendor CAD software. This paper presents ...
112
click to vote
DBKDA
2009
IEEE
15 years 5 months ago
2009
IEEE
Most database applications are designed according the ANSI/SPARC architecture. When it is used, a large amount of semantics of data may be lost during the transformation from the ...
141
click to vote
LPNMR
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. In this paper, we present a logic R for rule bases by introducing a set of rule connectives. We define both the models and extensions of a rule base. The semantics of ex...
116
click to vote
CSL
2010
Springer
15 years 3 months ago
2010
Springer
It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented i...
126
click to vote
ILP
2005
Springer
15 years 7 months ago
2005
Springer
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...