Sciweavers

1679 search results - page 62 / 336
» Strong order equivalence
Sort
View
JSYML
2008
86views more  JSYML 2008»
13 years 10 months ago
On Skolemization in constructive theories
In this paper a method for the replacement, in formulas, of strong quantifiers by functions is introduced that can be considered as an alternative to Skolemization in the setting ...
Matthias Baaz, Rosalie Iemhoff
JUCS
2010
114views more  JUCS 2010»
13 years 8 months ago
An Axiomatization of a First-order Branching Time Temporal Logic
: We introduce a first-order temporal logic for reasoning about branching time. It is well known that the set of valid formulas is not recursively enumerable and there is no fini...
Dragan Doder, Zoran Ognjanovic, Zoran Markovic
APN
1999
Springer
14 years 2 months ago
Detection of Illegal Behaviors Based on Unfoldings
We show how the branching process approach can be used for the detection of illegal behaviors. Our study is based on the specification of properties in terms of testers that cover...
Jean-Michel Couvreur, Denis Poitrenaud
HEURISTICS
2006
102views more  HEURISTICS 2006»
13 years 10 months ago
A logic of soft constraints based on partially ordered preferences
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...
Nic Wilson
INFOCOM
2007
IEEE
14 years 4 months ago
Stochastic Ordering for Internet Congestion Control and its Applications
— Window growth function for congestion control is a strong determinant of protocol behaviors, especially its second and higher-order behaviors associated with the distribution o...
Han Cai, Do Young Eun, Sangtae Ha, Injong Rhee, Li...