Sciweavers

3353 search results - page 50 / 671
» Laver and set theory
Sort
View
ICRA
2008
IEEE
135views Robotics» more  ICRA 2008»
15 years 4 months ago
Path and trajectory diversity: Theory and algorithms
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
Michael S. Branicky, Ross A. Knepper, James J. Kuf...
FUIN
2010
83views more  FUIN 2010»
14 years 7 months ago
Expressing Cardinality Quantifiers in Monadic Second-Order Logic over Trees
We study an extension of monadic second-order logic of order with the uncountability quantifier "there exist uncountably many sets". We prove that, over the class of fini...
Vince Bárány, Lukasz Kaiser, Alexand...
ICALP
2005
Springer
15 years 3 months ago
Combining Intruder Theories
Abstract. Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples o...
Yannick Chevalier, Michaël Rusinowitch
ECIS
2003
14 years 11 months ago
A qualitative approach to investigating the behavioural definitions of the four-paradigm theory of information systems developme
Hirschheim, Klein and Lyytinen introduced the four-paradigm theory of information systems development (ISD) as a significant attempt to systematise developer assumptions. The theo...
Donal J. Flynn, Zahid I. Hussain
VMCAI
2007
Springer
15 years 3 months ago
Invariant Synthesis for Combined Theories
We present a constraint-based algorithm for the synthesis of invariants expressed in the combined theory of linear arithmetic and uninterpreted function symbols. Given a set of pro...
Dirk Beyer, Thomas A. Henzinger, Rupak Majumdar, A...