45 search results - page 9 / 9 » The complexity of satisfiability for fragments of hybrid log... |
CSREAESA
2003
13 years 6 months ago
2003
Most so-called “adiabatic” digital logic circuit families reported in the low-power design literature are actually not truly adiabatic, in that they do not satisfy the general...
SEFM
2003
IEEE
13 years 10 months ago
2003
IEEE
Despite the advances in software engineering since 1968, current methods for going from a set of functional requirements to a design are not as direct, repeatable and constructive...
ENTCS
2007
13 years 5 months ago
2007
This paper gives an overview of recent advances in Real-Time Maude. Real-Time Maude extends the Maude rewriting logic tool to support formal specification and analysis of object-...
STACS
2010
Springer
14 years 9 days ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
AI
2011
Springer
13 years 11 days ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...