Sciweavers

1269 search results - page 100 / 254
» Pi-Calculus in Logical Form
Sort
View
IJCAI
2001
15 years 2 months ago
Computational Complexity of Planning with Temporal Goals
In the last decade, there has been several studies on the computational complexity of planning. These studies normally assume that the goal of planning is to make a certain fluent...
Chitta Baral, Vladik Kreinovich, Raul Trejo
108
Voted
TCS
2008
15 years 17 days ago
Verification of qualitative Z constraints
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...
Stéphane Demri, Régis Gascon
100
Voted
COLING
2002
15 years 15 days ago
Answering it with Charts: Dialogue in Natural Language and Charts
A methodology is proposed for taking queries and requests expressed in natural language as input and answering them in charts through organizing that interaction into felicitous d...
Tsuneaki Kato, Mitsunori Matsushita, Eisaku Maeda
229
Voted
FM
2011
Springer
357views Formal Methods» more  FM 2011»
14 years 4 months ago
TraceContract: A Scala DSL for Trace Analysis
Abstract. In this paper we describe TRACECONTRACT, an API for trace analysis, implemented in the SCALA programming language. We argue that for certain forms of trace analysis the b...
Howard Barringer, Klaus Havelund
87
Voted
FPGA
2003
ACM
156views FPGA» more  FPGA 2003»
15 years 5 months ago
Architectures and algorithms for synthesizable embedded programmable logic cores
As integrated circuits become more and more complex, the ability to make post-fabrication changes will become more and more attractive. This ability can be realized using programm...
Noha Kafafi, Kimberly Bozman, Steven J. E. Wilton