Sciweavers

3758 search results - page 180 / 752
» A Complete Subsumption Algorithm
Sort
View
CAV
2007
Springer
113views Hardware» more  CAV 2007»
15 years 4 months ago
On Synthesizing Controllers from Bounded-Response Properties
In this paper we propose a complete chain for synthesizing controllers from high-level specifications. From real-time properties expressed in the logic MTL we generate, under boun...
Oded Maler, Dejan Nickovic, Amir Pnueli
CSFW
1999
IEEE
15 years 2 months ago
Decision Procedures for the Analysis of Cryptographic Protocols by Logics of Belief
Belief-logic deductions are used in the analysis of cryptographic protocols. We show a new method to decide such logics. In addition to the familiar BAN logic, it is also applicab...
David Monniaux
ECAI
1992
Springer
15 years 2 months ago
Phenomenology, Representations and Complexity
Abstract. The paper refutes the general phenomenological argument that knowledge cannot be completely represented by symbols and, hence, symbolic AI does not work. Moreover, the vi...
Achim G. Hoffmann
COCO
2006
Springer
97views Algorithms» more  COCO 2006»
15 years 1 months ago
Grid Graph Reachability Problems
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
Eric Allender, David A. Mix Barrington, Tanmoy Cha...
AAAI
2004
14 years 11 months ago
Assessing the Complexity of Plan Recognition
This paper presents a discussion of the theoretical complexity of plan recognition on the basis of an analysis of the number of explanations that any complete plan recognition alg...
Christopher W. Geib