Sciweavers

903 search results - page 163 / 181
» Completeness Results for Memory Logics
Sort
View
IJCAI
1993
15 years 7 months ago
A Model-Theoretic Approach to the Verification of Situated Reasoning Systems
agent-oriented system. We show the complexity to be linear time for one of these logics and polynomial time for another, thus providing encouraging results with respect to the prac...
Anand S. Rao, Michael P. Georgeff
JLP
2006
138views more  JLP 2006»
15 years 6 months ago
Algebraic-coalgebraic specification in CoCasl
We introduce CoCasl as a light-weight but expressive coalgebraic extension of the algebraic specification language Casl. CoCasl allows the nested combination of algebraic datatype...
Till Mossakowski, Lutz Schröder, Markus Rogge...
JFP
2007
126views more  JFP 2007»
15 years 6 months ago
Engineering Software Correctness
Software engineering courses offer one of many opportunities for providing students with a significant experience in declarative programming. This report discusses some results fr...
Rex L. Page
ICCAD
2003
IEEE
117views Hardware» more  ICCAD 2003»
16 years 3 months ago
On Whitespace and Stability in Mixed-Size Placement and Physical Synthesis
In the context of physical synthesis, large-scale standard-cell placement algorithms must facilitate incremental changes to layout, both local and global. In particular, flexible...
Saurabh N. Adya, Igor L. Markov, Paul Villarrubia
EUROGP
2009
Springer
105views Optimization» more  EUROGP 2009»
15 years 10 months ago
Quantum Circuit Synthesis with Adaptive Parameters Control
The contribution presented herein proposes an adaptive genetic algorithm applied to quantum logic circuit synthesis that, dynamically adjusts its control parameters. The adaptation...
Cristian Ruican, Mihai Udrescu, Lucian Prodan, Mir...