scientific article; zbMATH DE number 2086598

zbMath1057.68116MaRDI QIDQ4737132

Philippe Balbiani, Jean-François Condotta

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2309/23090162.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)

Related Items (12)

The Complexity of Linear-Time Temporal Logic Model Repair ⋮ Generalized Qualitative Spatio-Temporal Reasoning: Complexity and Tableau Method ⋮ On the freeze quantifier in Constraint LTL: Decidability and complexity ⋮ An automata-theoretic approach to constraint LTL ⋮ A tableau algorithm for description logics with concrete domains and general TBoxes ⋮ Realizability problem for constraint LTL ⋮ Reasoning about sequences of memory states ⋮ On the axiomatizability of some first-order spatio-temporal theories ⋮ Verification of qualitative \(\mathbb Z\) constraints ⋮ An Automata-based Approach for CTL⋆ With Constraints ⋮ LTL over integer periodicity constraints ⋮ Complexity classification in qualitative temporal constraint reasoning

This page was built for publication: