# Modelling and solving temporal reasoning as propositional satisfiability

@article{Pham2008ModellingAS,
title={Modelling and solving temporal reasoning as propositional satisfiability},
author={Duc Nghia Pham and John Thornton and A. Sattar},
journal={Artif. Intell.},
year={2008},
volume={172},
pages={1752-1782}
}
• Published 2008
• Mathematics, Computer Science
• Artif. Intell.
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely used formalisms for representing interval-based qualitative temporal information is Allen's interval algebra (IA). The fundamental reasoning task in IA is to find a scenario that is consistent with the given information. This problem is in general NP-complete. In this paper, we investigate how an interval-based… Expand
A Generalised Approach for Encoding and Reasoning with Qualitative Theories in Answer Set Programming
• Computer Science
• Theory and Practice of Logic Programming
• 2020
Experimental results show that the proposed encodings outperform one of the two reasoners, but fall behind the other, an acceptable trade-off given the added benefits of handling any type of reasoning as well as the interpretability of logic programs. Expand
Improved Algorithms for Allen's Interval Algebra: a Dynamic Programming Approach
• Computer Science
• IJCAI
• 2021
The constraint satisfaction problem (CSP) is an important framework in artificial intelligence used to model e.g. qualitative reasoning problems such as Allen’s interval algebra (A). There is strongExpand
Qualitative Spatial and Temporal Reasoning with Answer Set Programming
• Jason Jingshi Li
• Computer Science
• 2012 IEEE 24th International Conference on Tools with Artificial Intelligence
• 2012
Three novel encodings which translate problems in qualitative spatial and temporal reasoning into logic programs for answer set programming solvers are introduced, each reflecting a different type of modeling abstraction. Expand
Decomposition and tractability in qualitative spatial and temporal reasoning
• Computer Science
• Artif. Intell.
• 2013
A sufficient condition under which consistency can be decided in polynomial time for networks of bounded treewidth in QSTR is identified, and this condition is satisfied by a range of calculi including the Interval Algebra, Rectangle Al algebra, Block Algebra), RCC8, and RCC5. Expand
SAT vs. Search for Qualitative Temporal Reasoning
A SAT encoding of IA is presented that simulates the use of tractable subsets in native solvers and shows that the refutation of any inconsistent IA network can always be done by SAT (via the authors' new encoding) as efficiently as by native search. Expand
Satisfiability Checking in Łukasiewicz Logic as Finite Constraint Satisfaction
• Mathematics, Computer Science
• Journal of Automated Reasoning
• 2011
An efficient, polynomial-time algorithm is proposed for establishing a strong upper bound on the required number of truth degrees, allowing us to check the satisfiability of sets of formulas in $\mathcal{L}_{\infty}$, and more generally, sets of fuzzy clauses over Łukasiewicz logic formulas, by solving a small number of constraint satisfaction problems. Expand
Theory propagation and reification
• Computer Science
• Sci. Comput. Program.
• 2015
It is demonstrated how reification provides a natural way for orchestrating reification in the propositional part of the problem with theory propagation in the constraint component of SMT, allowing an elegant implementation of DPLL(T) solvers in Prolog. Expand
A Divide-and-Conquer Approach for Solving Interval Algebra Networks
• Mathematics, Computer Science
• IJCAI
• 2009
A divide-and-conquer method that recursively partitions a given problem into smaller sub-problems in deciding consistency is introduced and a key theoretical property of a qualitative calculus is identified that ensures the soundness and completeness of this method. Expand
Efficient automated planning with new formulations
• Computer Science
• 2011
This work strongly suggests a shifting trend of planning from STRIPS to SAS+, and shows the power of formulating planning problems as Satisfiability, and developed a new SAS+ based SAT encoding scheme (SASE) for planning. Expand
A SAT Approach for Maximizing Satisfiability in Qualitative Spatial and Temporal Constraint Networks
• Computer Science
• KR
• 2016
To efficiently solve the MAX-QCN problem, this paper introduces and study two families of encodings of the partial maximum satisfiability problem (PMAX-SAT), based on a forbidden covering with regard to the composition table of the considered qualitative calculus. Expand

#### References

SHOWING 1-10 OF 88 REFERENCES
Reasoning About Qualitative Temporal Information
• P. V. Beek
• Computer Science, Mathematics
• Artif. Intell.
• 1992
This paper defines computationally efficient procedures for solving two related reasoning tasks that arise in interval and point algebras: Given (possibly indefinite) knowledge of the relationships between some intervals or points, find one or more scenarios that are consistent with the information provided, and find all the feasible relations between every pair of interval or points. Expand
Encoding Plans in Propositional Logic
• Computer Science
• KR
• 1996
A novel encoding based on the theory of causal planning, that exploits the notion of “lifting” from the theorem-proving community is introduced, which strictly dominates the others in terms of asymptotic complexity. Expand
Exact and approximate reasoning about temporal relations 1
• Computer Science
• Comput. Intell.
• 1990
This paper addresses a fundamental reasoning task that arises in applications of the algebra: Given (possibly indefinite) knowledge about the relationships between intervals, find all feasible relationships between two intervals, called the minimal labels problem. Expand
Complexity and algorithms for reasoning about time: a graph-theoretic approach
• Mathematics, Computer Science
• JACM
• 1993
This work unifies notions of interval algebras in artificial intelligence with those of interval orders and interval graphs in combinatorics and shows that even when the temporal data comprises of subsets of relations based on intersection and precedence only, the satisfiability question is NP-complete. Expand
A Local Search Approach to Modelling and Solving Interval Algebra Problems
• Computer Science
• J. Log. Comput.
• 2004
This paper looks at modelling and solving problems formulated using Allen's interval algebra and proposes a new constraint weighting algorithm derived from DLM and shows that local search outperforms existing consistency-enforcing algorithms on those problems that the existing techniques find most difficult. Expand
Efficient solution techniques for disjunctive temporal reasoning problems
• Computer Science
• Artif. Intell.
• 2003
A new algorithm is presented, called Epilitis, which integrates strategies for efficient DTP solving from the previous literature, including conflictdirected backjumping, removal of subsumed variables, and semantic branching, and further adds no-good recording as a central technique and can achieve a nearly two order-of-magnitude speed-up over previously published algorithms on benchmark problems in the DTP literature. Expand
Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class
• B. Nebel
• Computer Science, Mathematics
• Constraints
• 2004
It is proved that Ladkin and Reinefeld's algorithm is complete when using the ORD-Horn class, and evidence is given that combining search methods orthogonally can dramatically improve the performance of the backtracking algorithm. Expand
Towards an Efficient SAT Encoding for Temporal Reasoning
• Mathematics, Computer Science
• CP
• 2006
Encoding IA into SAT produces better results than existing approaches, and the phase transition region maps directly from the IA encoding to each SAT encoding, but, surprisingly, the location of the hard region varies according to the encoding scheme. Expand
Temporal Constraint Networks
• Computer Science, Mathematics
• Artif. Intell.
• 1989
It is shown that the STP, which subsumes the major part of Vilain and Kautz's point algebra, can be solved in polynomial time and the applicability of path consistency algorithms as preprocessing of temporal problems is studied, to demonstrate their termination and bound their complexities. Expand
The design and experimental analysis of algorithms for temporal reasoning
• Computer Science
• 1996
This paper discusses the design and empirical analysis of algorithms for a temporal reasoning system based on Allen's influential interval-based framework for representing temporal information, and develops techniques that can result in up to a ten-fold speedup over an already highly optimized implementation. Expand