Sciweavers

1636 search results - page 78 / 328
» Reasoning About Quantum Systems
Sort
View
IFM
1999
Springer
15 years 10 months ago
Modelling Discrete Behaviour in a Continuous-Time Formalism
Embedded real-time systems consist of a digital controller interacting with its physical environment. Developing such systems therefore involves specifying and reasoning about bot...
Colin J. Fidge
RTA
1987
Springer
15 years 9 months ago
Completion for Rewriting Modulo a Congruence
We present completion methods for rewriting modulo a congruence, generalizing previous methods by Peterson and Stickel (1981) and Jouannaud and Kirchner (1986). We formalize our me...
Leo Bachmair, Nachum Dershowitz
CADE
2001
Springer
16 years 6 months ago
Termination and Reduction Checking for Higher-Order Logic Programs
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
Brigitte Pientka
AMAI
2004
Springer
15 years 11 months ago
Deductive Algorithmic Knowledge
The framework of algorithmic knowledge assumes that agents use algorithms to compute the facts they explicitly know. In many cases of interest, a logical theory, rather than a par...
Riccardo Pucella
KBSE
2008
IEEE
16 years 15 days ago
MTSA: The Modal Transition System Analyser
Modal Transition Systems (MTS) are operational models that distinguish between required and proscribed behaviour of the system to be and behaviour which it is not yet known whethe...
Nicolás D'Ippolito, Dario Fischbein, Marsha...