Sciweavers

13 search results - page 2 / 3
» On Deciding Consistency for CSPs of Cyclic Time Intervals
Sort
View
CONCUR
1998
Springer
13 years 9 months ago
Axioms for Real-Time Logics
This paper presents a complete axiomatization of two decidable propositional realtime linear temporal logics: Event Clock Logic (EventClockTL) and Metric Interval Temporal Logic w...
Jean-François Raskin, Pierre-Yves Schobbens...
TIME
2002
IEEE
13 years 10 months ago
Applying Local Search to Temporal Reasoning
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
John Thornton, Matthew Beaumont, Abdul Sattar, Mic...
FOSSACS
2005
Springer
13 years 11 months ago
A Computational Model for Multi-variable Differential Calculus
Abstract. We introduce a domain-theoretic computational model for multivariable differential calculus, which for the first time gives rise to data types for differentiable functio...
Abbas Edalat, André Lieutier, Dirk Pattinso...
CIE
2007
Springer
13 years 11 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
IJAC
2007
116views more  IJAC 2007»
13 years 5 months ago
On the Complexity of the Whitehead Minimization Problem
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
Abdó Roig, Enric Ventura, Pascal Weil