3693 search results - page 248 / 739 » Splitting a Logic Program |
128
click to vote
TC
1998
15 years 4 months ago
1998
—Many modern Field Programmable Logic Arrays (FPGAs) use lookup table (LUT) logic blocks which can be programmed to realize any function of a fixed number of inputs. It is possib...
146
Voted
JSAC
2007
15 years 5 months ago
2007
— We introduce a new version of the widely studied survivable mapping problem in IP-over-WDM networks. The new problem allows augmenting the given logical topology and is describ...
138
click to vote
SEFM
2005
IEEE
15 years 10 months ago
2005
IEEE
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...
112
Voted
BIRTHDAY
2005
Springer
15 years 10 months ago
2005
Springer
We present an extension of first-order predicate logic with a novel predicate ‘at t’ meaning intuitively “this term is a variable symbol”. We give simple sequent proof-ru...
169
Voted
CONCUR
2005
Springer
15 years 10 months ago
2005
Springer
The context of this study is timed temporal logics for timed automata. In this paper, we propose an extension of the classical logic TCTL with a new Until modality, called “Until...