scientific article; zbMATH DE number 1149417

zbMath0900.68389MaRDI QIDQ4386938

No author found.

Publication date: 10 May 1998

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)

Related Items

Modelling and solving temporal reasoning as propositional satisfiability ⋮ A condensed semantics for qualitative spatial reasoning about oriented straight line segments ⋮ Implementation of the temporal reasoning mechanism in modern intelligent systems ⋮ Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure ⋮ A Generalised Approach for Encoding and Reasoning with Qualitative Theories in Answer Set Programming ⋮ The algebra \(\text{IA}^{\text{fuz}}\): a framework for qualitative fuzzy temporal reasoning ⋮ Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class ⋮ Dynamic Branching in Qualitative Constraint Networks via Counting Local Models ⋮ Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure ⋮ Range-consistent forbidden regions of Allen's relations ⋮ Unnamed Item ⋮ Probabilistic temporal networks: A unified framework for reasoning with time and uncertainty ⋮ Dynamic branching in qualitative constraint-based reasoning via counting local models ⋮ Backtracking algorithms for disjunctions of temporal constraints ⋮ A new approach to cyclic ordering of 2D orientations using ternary relation algebras ⋮ Collective singleton-based consistency for qualitative constraint networks: theory and practice ⋮ Combining interval-based temporal reasoning with general TBoxes

This page was built for publication: