1391 search results - page 166 / 279 » Completeness of Neighbourhood Logic |
189
click to vote
APSEC
2008
IEEE
15 years 8 months ago
2008
IEEE
Reactive systems are often described by interconnecting sub-components along architectural connectors defining communication policies. Generally, such global systems may exhibit p...
139
click to vote
IAT
2005
IEEE
15 years 12 months ago
2005
IEEE
Our previous research presents a methodology of cooperative problem solving for BDI systems, based on a complete formal theory. This covers both a static part, defining individua...
146
click to vote
CADE
2003
Springer
16 years 6 months ago
2003
Springer
The DPLL procedure is the basis of some of the most successful propositional satisfiability solvers to date. Although originally devised as a proofprocedure for first-order logic, ...
159
click to vote
PPDP
2007
Springer
16 years 13 days ago
2007
Springer
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
131
click to vote
MICRO
2005
IEEE
15 years 12 months ago
2005
IEEE
Large numbers of logical registers can improve performance by allowing fast access to multiple subroutine contexts (register windows) and multiple thread contexts (multithreading)...