Belief extrapolation (or how to reason about observations and unpredicted change) Fulltext Access 31 Pages 2011
Semantic linking through spaces for cyber-physical-socio intelligence: A methodology Fulltext Access 32 Pages 2011
Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs Fulltext Access 32 Pages 2011
A classification of the expressive power of well-structured transition systems Fulltext Access 32 Pages 2011
A new representation and associated algorithms for generalized planning Fulltext Access 33 Pages 2011
A unifying theory of control dependence and its application to arbitrary program structures Fulltext Access 34 Pages 2011
Distributed temporal logic for the analysis of security protocol models Fulltext Access 37 Pages 2011
The well-designed logical robot: Learning and experience from observations to the Situation Calculus Fulltext Access 38 Pages 2011
A general framework for explaining the results of a multi-attribute preference model Fulltext Access 39 Pages 2011
Computational techniques for a simple theory of conditional preferences Fulltext Access 39 Pages 2011
Algorithms and mechanisms for procuring services with uncertain durations using redundancy Fulltext Access 40 Pages 2011
Approximation of action theories and its application to conformant planning Fulltext Access 41 Pages 2011
Solving conflicts in information merging by a flexible interpretation of atomic propositions Fulltext Access 41 Pages 2011
A tactic language for refinement of state-rich concurrent specifications Fulltext Access 42 Pages 2011
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning Fulltext Access 42 Pages 2011
How does a box work? A study in the qualitative dynamics of solid objects Fulltext Access 47 Pages 2011
Decomposition of sparse graphs into two forests, one having bounded maximum degree Fulltext Access 4 Pages 2010
A new parameter for a broadcast algorithm with locally bounded Byzantine faults Fulltext Access 4 Pages 2010
New upper bounds on the Boolean circuit complexity of symmetric functions Fulltext Access 4 Pages 2010
Closures of may-, should- and must-convergences for contextual equivalence Fulltext Access 4 Pages 2010
A network flow based approach for network selection in dynamic spectrum access networks Fulltext Access 4 Pages 2010
RETRACTED ARTICLE: On 3-choosability of planar graphs with neither adjacent triangles nor 5-, 6- and 9-cycles Fulltext Access 4 Pages 2010
Vocabularies, ontologies, and rules for enterprise and business process modeling and management Fulltext Access 4 Pages 2010
Efficient 3-dimensional GLV method for faster point multiplication on some GLS elliptic curves Fulltext Access 4 Pages 2010
On the coNP hardness of computing certain answers over locally specified incomplete DOM-trees Fulltext Access 4 Pages 2010
A polylogarithmic approximation for computing non-metric terminal Steiner trees Fulltext Access 4 Pages 2010
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover–Delayer games Fulltext Access 4 Pages 2010
Conditional connectivity of Cayley graphs generated by transposition trees Fulltext Access 4 Pages 2010
Linearized voltage stability index for wide-area voltage monitoring and control Fulltext Access 4 Pages 2010
Distinguishing attacks on stream ciphers based on arrays of pseudo-random words Fulltext Access 4 Pages 2010
An improved algorithm for the red–blue hitting set problem with the consecutive ones property Fulltext Access 4 Pages 2010
Scheduling with job-dependent learning effects and multiple rate-modifying activities Fulltext Access 4 Pages 2010