Sciweavers

61 search results - page 7 / 13
» Decidable Cases of First-order Temporal Logic with Functions
Sort
View
CORR
2007
Springer
117views Education» more  CORR 2007»
14 years 11 months ago
Alternative axiomatics and complexity of deliberative STIT theories
We propose two alternatives to Xu’s axiomatization of Chellas’s STIT. The first one simplifies its presentation, and also provides an alternative axiomatization of the delib...
Philippe Balbiani, Andreas Herzig, Nicolas Troquar...
CORR
2010
Springer
82views Education» more  CORR 2010»
14 years 9 months ago
Computing (or not) Quasi-Periodicity Functions of Tilings
Abstract. We know that tilesets that can tile the plane always admit a quasiperiodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicit...
Alexis Ballier, Emmanuel Jeandel
CONCUR
2006
Springer
15 years 3 months ago
Controller Synthesis for MTL Specifications
Abstract. We consider the control problem for timed automata against specifications given as MTL formulas. The logic MTL is a linear-time timed temporal logic which extends LTL wit...
Patricia Bouyer, Laura Bozzelli, Fabrice Chevalier
ECML
2007
Springer
15 years 5 months ago
Generalization-Based Similarity for Conceptual Clustering
The availability of techniques for comparing descriptions has many applications in Artificial Intelligence, ranging from description selection to flexible matching, from instance...
Stefano Ferilli, Teresa Maria Altomare Basile, Nic...
LFCS
2007
Springer
15 years 5 months ago
Model Checking Knowledge and Linear Time: PSPACE Cases
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
Kai Engelhardt, Peter Gammie, Ron van der Meyden