551 search results - page 66 / 111 » Formalizing the Logic-Automaton Connection |
131
click to vote
ICCS
2003
Springer
15 years 11 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
141
click to vote
VL
2002
IEEE
15 years 11 months ago
2002
IEEE
There is a range of modelling notations, both textual and diagrammatic, whose semantics are based on first-order predicate logic. This paper presents a visual framework for organ...
165
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— The present paper considers distributed consensus algorithms for agents evolving on a connected compact homogeneous (CCH) manifold. The agents track no external referen...
198
click to vote
TABLEAUX
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-f...
150
click to vote
AOSE
2001
Springer
15 years 10 months ago
2001
Springer
Two key issues in building multi-agent systems concern their scalability and engineering open systems. We offer solutions to these potential problems by introducing a lifecycle fo...