Optimization in temporal qualitative constraint networks
DOI10.1007/S00236-015-0228-ZzbMATH Open1336.68244OpenAlexW2014377129MaRDI QIDQ262133FDOQ262133
Authors: Jean-François Condotta, Souhila Kaci, Yakoub Salhi 
Publication date: 29 March 2016
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-015-0228-z
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Knowledge representation (68T30) Logic in artificial intelligence (68T27)
Cites Work
- Maintaining knowledge about temporal intervals
- Title not available (Why is that?)
- Constructivism in mathematics. An introduction. Volume I
- Temporally distributed symptoms in technical diagnosis
- Consistency in networks of relations
- A complete classification of tractability in Allen's algebra relative to subsets of basic relations
- Metamathematics of fuzzy logic
- Numerical representation of \(PQI\) interval orders
- Reasoning with various kinds of preferences: logic, non-monotonicity, and algorithms
- Title not available (Why is that?)
- A propositional calculus with denumerable matrix
- Weak Composition for Qualitative Spatial and Temporal Reasoning
- Decomposition and tractability in qualitative spatial and temporal reasoning
- Reasoning about temporal relations
- Automated Reasoning
- Bounding Resource Consumption with Gödel-Dummett Logics
- Cut Elimination for First Order Gödel Logic by Hyperclause Resolution
- Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class
Cited In (6)
- Relation algebras of Sugihara, Belnap, Meyer, and Church
- On the consistency problem for the \(\mathcal {INDU}\) calculus
- Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure
- Solving multi-granularity temporal constraint networks
- Temporal logic based synthesis of experimentally constrained interaction networks
- Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
This page was built for publication: Optimization in temporal qualitative constraint networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q262133)
