3374 search results - page 260 / 675 » Explaining Similarity of Terms |
169
click to vote
TACS
2001
Springer
15 years 11 months ago
2001
Springer
We give a logic programming language based on Fiore, Plotkin and Turi’s binding algebras. In this language, we can use not only first-order terms but also terms involving variab...
155
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
The current state of the art in agent technology sees that several implementations of agent frameworks exist. However, there is little agreement on the terms and concepts used to ...
163
click to vote
RTA
1991
Springer
15 years 10 months ago
1991
Springer
A term rewriting system is called complete if it is both confluent and strongly norrealizing. Barendregt and Klop showed that the disjoint union of complete term rewriting systems...
164
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The causal Markov condition (CMC) is a postulate that links observations to causality. It describes the conditional independences among the observations that are entailed by a cau...
151
click to vote
AUTOMATICA
2005
15 years 6 months ago
2005
: Given a continuous-time controller and a Lyapunov function that shows global asymptotic stability for the closed loop system, we provide several results for modification of the c...