Optimization in temporal qualitative constraint networks
DOI10.1007/S00236-015-0228-ZzbMath1336.68244OpenAlexW2014377129MaRDI QIDQ262133
Souhila Kaci, Yakoub Salhi, Jean-François Condotta
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Maintaining knowledge about temporal intervals
- Decomposition and tractability in qualitative spatial and temporal reasoning
- Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class
- 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
- A propositional calculus with denumerable matrix
- Weak Composition for 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
This page was built for publication: Optimization in temporal qualitative constraint networks
