Modelling and solving temporal reasoning as propositional satisfiability
DOI10.1016/J.ARTINT.2008.06.003zbMATH Open1184.68485OpenAlexW2145603219MaRDI QIDQ2389682FDOQ2389682
Authors: Yanyan Li 
Publication date: 17 July 2009
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10072/26367
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27)
Cites Work
- Theory and Applications of Satisfiability Testing
- Maintaining knowledge about temporal intervals
- Theory and Applications of Satisfiability Testing
- Temporal constraint networks
- Consistency in networks of relations
- A Sufficient Condition for Backtrack-Free Search
- Reasoning about temporal relations
- Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class
- Title not available (Why is that?)
- Locating the phase transition in binary constraint satisfaction problems
- Efficient solution techniques for disjunctive temporal reasoning problems
- Needed: An Empirical Science of Algorithms
- Fast algebraic methods for interval constraint problems
- Modelling and solving temporal reasoning as propositional satisfiability
- Balance and filtering in structured satisfiable problems. (Preliminary report)
- Complexity and algorithms for reasoning about time
- Experimental results on the crossover point in random 3-SAT
- An empirical study of phase transitions in binary constraint satisfaction problems
- Reasoning about qualitative temporal information
- Title not available (Why is that?)
- Title not available (Why is that?)
- Synthesizing constraint expressions
- Mechanizing Mathematical Reasoning
- \textsf{TSAT++}: an open platform for satisfiability modulo theories
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Title not available (Why is that?)
- A Local Search Approach to Modelling and Solving Interval Algebra Problems
Cited In (16)
- Title not available (Why is that?)
- Temporal Assertions with Parametrized Propositions
- Modelling and solving temporal reasoning as propositional satisfiability
- Qualitative constraint satisfaction problems: an extended framework with landmarks
- A Generalised Approach for Encoding and Reasoning with Qualitative Theories in Answer Set Programming
- Experimental analysis of numeric and symbolic constraint satisfaction techniques for temporal reasoning
- Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction
- Trends in Temporal Reasoning: Constraints, Graphs and Posets
- On prime scenarios in qualitative spatial and temporal reasoning
- Temporal induction by incremental SAT solving
- Branching interval algebra: an almost complete picture
- Spatial reasoning with rectangular cardinal relations. The convex tractable subalgebra
- Search strategies for resolution in temporal logics
- Model Theoretic Syntax and Parsing
- EvIA -- evidential interval algebra and heuristic backtrack-free algorithm
- Resolution for temporal logics of knowledge
Uses Software
This page was built for publication: Modelling and solving temporal reasoning as propositional satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2389682)
