Sciweavers

504 search results - page 42 / 101
» The Complexity of Symmetry-Breaking Formulas
Sort
View
LICS
2005
IEEE
14 years 3 months ago
On the Decidability of Metric Temporal Logic
Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words...
Joël Ouaknine, James Worrell
ICSE
2003
IEEE-ACM
14 years 3 months ago
Data Flow Testing as Model Checking
This paper presents a model checking-based approach to data flow testing. We characterize data flow oriented coverage criteria in temporal logic such that the problem of test ge...
Hyoung Seok Hong, Sung Deok Cha, Insup Lee, Oleg S...
PODS
1999
ACM
89views Database» more  PODS 1999»
14 years 2 months ago
Type Inference in the Polymorphic Relational Algebra
We give a polymorphic account of the relational algebra. We introduce a formalism of \type formulas" speci cally tuned for relational algebra expressions, and present an algo...
Jan Van den Bussche, Emmanuel Waller
ECAI
2006
Springer
14 years 1 months ago
Boolean Games Revisited
Abstract. Game theory is a widely used formal model for studying strategical interactions between agents. Boolean games [8] are two players, zero-sum static games where players...
Elise Bonzon, Marie-Christine Lagasquie-Schiex, J&...
AAAI
2007
14 years 7 days ago
Asymptotically Optimal Encodings of Conformant Planning in QBF
The world is unpredictable, and acting intelligently requires anticipating possible consequences of actions that are taken. Assuming that the actions and the world are determinist...
Jussi Rintanen